# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S073A
# and selection function SelectCQIArEqLast.
#
# Preprocessing time       : 0.020 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l19_pdlax, conjecture, ![X1]:((v1_funct_1(X1)&m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers))))=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_numbers))=>(r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X1,X2),X2)<=>r2_fdiff_1(X1,X2)))), file('pdlax/pdlax__l19_pdlax', l19_pdlax)).
fof(t5_integra7, axiom, ![X1, X2]:((v1_funct_1(X2)&m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers))))=>(r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X2,X1),X1)<=>r2_fdiff_1(X2,X1))), file('pdlax/pdlax__l19_pdlax', t5_integra7)).
fof(c_0_2, negated_conjecture, ~(![X1]:((v1_funct_1(X1)&m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers))))=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_numbers))=>(r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X1,X2),X2)<=>r2_fdiff_1(X1,X2))))), inference(assume_negation,[status(cth)],[l19_pdlax])).
fof(c_0_3, plain, ![X9, X10]:((~r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X10,X9),X9)|r2_fdiff_1(X10,X9)|(~v1_funct_1(X10)|~m1_subset_1(X10,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers)))))&(~r2_fdiff_1(X10,X9)|r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X10,X9),X9)|(~v1_funct_1(X10)|~m1_subset_1(X10,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers)))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_integra7])])])).
fof(c_0_4, negated_conjecture, ((v1_funct_1(esk1_0)&m1_subset_1(esk1_0,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers))))&(m1_subset_1(esk2_0,k1_zfmisc_1(k1_numbers))&((~r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,esk2_0),esk2_0)|~r2_fdiff_1(esk1_0,esk2_0))&(r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,esk2_0),esk2_0)|r2_fdiff_1(esk1_0,esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
cnf(c_0_5, plain, (r2_fdiff_1(X1,X2)|~r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X1,X2),X2)|~v1_funct_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers)))), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_6, negated_conjecture, (v1_funct_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (m1_subset_1(esk1_0,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers)))), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_8, negated_conjecture, (r2_fdiff_1(esk1_0,X1)|~r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,X1),X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])])).
cnf(c_0_9, negated_conjecture, (r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,esk2_0),esk2_0)|r2_fdiff_1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_10, plain, (r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,X1,X2),X2)|~r2_fdiff_1(X1,X2)|~v1_funct_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(k1_numbers,k1_numbers)))), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_11, negated_conjecture, (~r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,esk2_0),esk2_0)|~r2_fdiff_1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_12, negated_conjecture, (r2_fdiff_1(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
cnf(c_0_13, negated_conjecture, (r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,X1),X1)|~r2_fdiff_1(esk1_0,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_6]), c_0_7])])).
cnf(c_0_14, negated_conjecture, (~r2_fdiff_1(k2_partfun1(k1_numbers,k1_numbers,esk1_0,esk2_0),esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])])).
cnf(c_0_15, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_12]), c_0_14]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 16
# Proof object clause steps            : 11
# Proof object formula steps           : 5
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 2
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 2
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 7
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 7
# Processed clauses                    : 18
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 18
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 4
# ...of the previous two non-trivial   : 4
# Contextual simplify-reflections      : 0
# Paramodulations                      : 4
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 0
# Propositional unsat checks           : 0
#    Propositional check models        : 0
#    Propositional check unsatisfiable : 0
#    Propositional clauses             : 0
#    Propositional clauses after purity: 0
#    Propositional unsat core size     : 0
#    Propositional preprocessing time  : 0.000
#    Propositional encoding time       : 0.000
#    Propositional solver time         : 0.000
#    Success case prop preproc time    : 0.000
#    Success case prop encoding time   : 0.000
#    Success case prop solver time     : 0.000
# Current number of processed clauses  : 9
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 9
# Clause-clause subsumption calls (NU) : 0
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 715

# -------------------------------------------------
# User time                : 0.018 s
# System time              : 0.004 s
# Total time               : 0.023 s
# Maximum resident set size: 3024 pages
