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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
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__t82_number14', t80_number14)).
fof(t82_number14, conjecture, ![X1]:(v1_int_1(X1)=>k4_card_1(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1))))=np__1), file('number14/number14__t82_number14', t82_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__t82_number14', t79_number14)).
fof(redefinition_k4_card_1, axiom, ![X1]:(v1_finset_1(X1)=>k4_card_1(X1)=k1_card_1(X1)), file('number14/number14__t82_number14', redefinition_k4_card_1)).
fof(fc1_finset_1, axiom, ![X1]:v1_finset_1(k1_tarski(X1)), file('number14/number14__t82_number14', fc1_finset_1)).
fof(t30_card_1, axiom, ![X1]:k1_card_1(k1_tarski(X1))=np__1, file('number14/number14__t82_number14', t30_card_1)).
fof(c_0_6, 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_7, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>k4_card_1(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X1,k2_xcmplx_0(X1,np__1))))=np__1)), inference(assume_negation,[status(cth)],[t82_number14])).
fof(c_0_8, plain, ![X13]:(~v1_int_1(X13)|(v1_abian(X13)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X13,k2_xcmplx_0(X13,np__1)))=k1_tarski(k2_xcmplx_0(X13,np__1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
fof(c_0_9, negated_conjecture, (v1_int_1(esk1_0)&k4_card_1(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(esk1_0,k2_xcmplx_0(esk1_0,np__1))))!=np__1), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, plain, ![X12]:(~v1_int_1(X12)|(~v1_abian(X12)|k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(X12,k2_xcmplx_0(X12,np__1)))=k1_tarski(X12))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t79_number14])])).
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_8])).
cnf(c_0_12, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_13, plain, ![X10]:(~v1_finset_1(X10)|k4_card_1(X10)=k1_card_1(X10)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_card_1])])).
fof(c_0_14, plain, ![X9]:v1_finset_1(k1_tarski(X9)), inference(variable_rename,[status(thm)],[fc1_finset_1])).
fof(c_0_15, plain, ![X11]:k1_card_1(k1_tarski(X11))=np__1, inference(variable_rename,[status(thm)],[t30_card_1])).
cnf(c_0_16, 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_10])).
cnf(c_0_17, 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))|v1_abian(esk1_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_18, plain, (k4_card_1(X1)=k1_card_1(X1)|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, plain, (v1_finset_1(k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, plain, (k1_card_1(k1_tarski(X1))=np__1), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_21, negated_conjecture, (k4_card_1(k8_subset_1(k4_numbers,k7_number14(np__2),k2_tarski(esk1_0,k2_xcmplx_0(esk1_0,np__1))))!=np__1), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_22, 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))|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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_12])])).
cnf(c_0_23, plain, (k4_card_1(k1_tarski(X1))=np__1), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
cnf(c_0_24, 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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])])).
cnf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_24]), c_0_23])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 26
# Proof object clause steps            : 12
# Proof object formula steps           : 14
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 8
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# 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                   : 3
# Generated clauses                    : 7
# ...of the previous two non-trivial   : 7
# Contextual simplify-reflections      : 0
# Paramodulations                      : 6
# Factorizations                       : 1
# 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  : 8
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 3
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 5
# Current number of archived formulas  : 0
# Current number of archived clauses   : 10
# 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            : 2
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 729

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