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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t81_number14, conjecture, ![X1]:(v1_int_1(X1)=>(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(X1)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(k2_xcmplx_0(X1,np__1)))), file('number14/number14__t81_number14', t81_number14)).
fof(t80_number14, axiom, ![X1]:(v1_int_1(X1)=>(~(v1_abian(X1))=>k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(k2_xcmplx_0(X1,np__1)))), file('number14/number14__t81_number14', t80_number14)).
fof(t79_number14, axiom, ![X1]:(v1_int_1(X1)=>(v1_abian(X1)=>k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(X1))), file('number14/number14__t81_number14', t79_number14)).
fof(c_0_3, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(X1)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(k2_xcmplx_0(X1,np__1))))), inference(assume_negation,[status(cth)],[t81_number14])).
fof(c_0_4, plain, ![X1]:(v1_int_1(X1)=>(~v1_abian(X1)=>k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(k2_xcmplx_0(X1,np__1)))), inference(fof_simplification,[status(thm)],[t80_number14])).
fof(c_0_5, negated_conjecture, (v1_int_1(esk1_0)&(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(esk1_0,k2_xcmplx_0(esk1_0,np__1)))!=k1_tarski(esk1_0)&k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(esk1_0,k2_xcmplx_0(esk1_0,np__1)))!=k1_tarski(k2_xcmplx_0(esk1_0,np__1)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
fof(c_0_6, plain, ![X6]:(~v1_int_1(X6)|(~v1_abian(X6)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X6,k2_xcmplx_0(X6,np__1)))=k1_tarski(X6))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t79_number14])])).
fof(c_0_7, plain, ![X7]:(~v1_int_1(X7)|(v1_abian(X7)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X7,k2_xcmplx_0(X7,np__1)))=k1_tarski(k2_xcmplx_0(X7,np__1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
cnf(c_0_8, negated_conjecture, (k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(esk1_0,k2_xcmplx_0(esk1_0,np__1)))!=k1_tarski(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, plain, (k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(X1)|~v1_int_1(X1)|~v1_abian(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_11, plain, (v1_abian(X1)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1)))=k1_tarski(k2_xcmplx_0(X1,np__1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(esk1_0,k2_xcmplx_0(esk1_0,np__1)))!=k1_tarski(k2_xcmplx_0(esk1_0,np__1))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_13, negated_conjecture, (~v1_abian(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])).
cnf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_10]), c_0_12]), c_0_13]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 15
# Proof object clause steps            : 7
# Proof object formula steps           : 8
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 5
# Proof object initial formulas used   : 3
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 4
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 3
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 5
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 5
# Processed clauses                    : 12
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 11
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 3
# ...of the previous two non-trivial   : 2
# Contextual simplify-reflections      : 0
# Paramodulations                      : 3
# 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  : 6
#    Positive orientable unit clauses  : 1
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 2
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 5
# Clause-clause subsumption calls (NU) : 2
# Rec. Clause-clause subsumption calls : 2
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 0
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 601

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.003 s
# Total time               : 0.023 s
# Maximum resident set size: 2988 pages
