0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.15/0.35	% Computer   : n022.cluster.edu
0.15/0.35	% Model      : x86_64 x86_64
0.15/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory     : 8042.1875MB
0.15/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.35	% CPULimit   : 180
0.15/0.35	% DateTime   : Thu Aug 29 09:17:18 EDT 2019
0.15/0.35	% CPUTime    : 
0.15/0.35	# Version: 2.4_pre003
0.15/0.36	# No SInE strategy applied
0.15/0.36	# Trying AutoSched0 for 90 seconds
0.21/0.47	# AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S04AN
0.21/0.47	# and selection function SelectComplexExceptUniqMaxHorn.
0.21/0.47	#
0.21/0.47	# Preprocessing time       : 0.031 s
0.21/0.47	# Presaturation interreduction done
0.21/0.47	
0.21/0.47	# Proof found!
0.21/0.47	# SZS status Theorem
0.21/0.47	# SZS output start CNFRefutation
0.21/0.47	fof(co4, conjecture, ![X1, X2, X3]:(pi_find_min(triple(X1,X2,X3))=>(?[X4]:(findmin_cpq_res(triple(X1,X2,X3))=findmin_pq_res(i(triple(X1,X2,X3)),X4)&pi_sharp_find_min(i(triple(X1,X2,X3)),X4))<=phi(findmin_cpq_eff(triple(X1,X2,X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co4)).
0.21/0.47	fof(ax14, axiom, ![X1, X2]:((issmallestelement_pq(X1,X2)&contains_pq(X1,X2))=>X2=findmin_pq_res(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax', ax14)).
0.21/0.47	fof(ax58, axiom, ![X1, X2]:((contains_pq(X1,X2)&issmallestelement_pq(X1,X2))<=>pi_sharp_find_min(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax', ax58)).
0.21/0.47	fof(main4_l7, lemma, ![X1, X2, X3]:(pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))<=phi(findmin_cpq_eff(triple(X1,X2,X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', main4_l7)).
0.21/0.47	fof(c_0_4, negated_conjecture, ~(![X1, X2, X3]:(pi_find_min(triple(X1,X2,X3))=>(?[X4]:(findmin_cpq_res(triple(X1,X2,X3))=findmin_pq_res(i(triple(X1,X2,X3)),X4)&pi_sharp_find_min(i(triple(X1,X2,X3)),X4))<=phi(findmin_cpq_eff(triple(X1,X2,X3)))))), inference(assume_negation,[status(cth)],[co4])).
0.21/0.47	fof(c_0_5, plain, ![X29, X30]:(~issmallestelement_pq(X29,X30)|~contains_pq(X29,X30)|X30=findmin_pq_res(X29,X30)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])).
0.21/0.47	fof(c_0_6, plain, ![X168, X169]:((~contains_pq(X168,X169)|~issmallestelement_pq(X168,X169)|pi_sharp_find_min(X168,X169))&((contains_pq(X168,X169)|~pi_sharp_find_min(X168,X169))&(issmallestelement_pq(X168,X169)|~pi_sharp_find_min(X168,X169)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])).
0.21/0.47	fof(c_0_7, negated_conjecture, ![X177]:(pi_find_min(triple(esk5_0,esk6_0,esk7_0))&(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))&(findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))!=findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X177)|~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X177)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])).
0.21/0.47	fof(c_0_8, lemma, ![X178, X179, X180]:(~phi(findmin_cpq_eff(triple(X178,X179,X180)))|pi_sharp_find_min(i(triple(X178,X179,X180)),findmin_cpq_res(triple(X178,X179,X180)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[main4_l7])])])).
0.21/0.47	cnf(c_0_9, plain, (X2=findmin_pq_res(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.21/0.47	cnf(c_0_10, plain, (contains_pq(X1,X2)|~pi_sharp_find_min(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.21/0.47	cnf(c_0_11, plain, (issmallestelement_pq(X1,X2)|~pi_sharp_find_min(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.21/0.47	cnf(c_0_12, negated_conjecture, (findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))!=findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X1)|~pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.47	cnf(c_0_13, lemma, (pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))|~phi(findmin_cpq_eff(triple(X1,X2,X3)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.47	cnf(c_0_14, negated_conjecture, (phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.47	cnf(c_0_15, plain, (findmin_pq_res(X1,X2)=X2|~pi_sharp_find_min(X1,X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
0.21/0.47	cnf(c_0_16, negated_conjecture, (findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))!=findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])])).
0.21/0.47	cnf(c_0_17, lemma, (findmin_pq_res(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))=findmin_cpq_res(triple(X1,X2,X3))|~phi(findmin_cpq_eff(triple(X1,X2,X3)))), inference(spm,[status(thm)],[c_0_15, c_0_13])).
0.21/0.47	cnf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_14])]), ['proof']).
0.21/0.47	# SZS output end CNFRefutation
0.21/0.47	# Proof object total steps             : 19
0.21/0.47	# Proof object clause steps            : 10
0.21/0.47	# Proof object formula steps           : 9
0.21/0.47	# Proof object conjectures             : 7
0.21/0.47	# Proof object clause conjectures      : 4
0.21/0.47	# Proof object formula conjectures     : 3
0.21/0.47	# Proof object initial clauses used    : 6
0.21/0.47	# Proof object initial formulas used   : 4
0.21/0.47	# Proof object generating inferences   : 4
0.21/0.47	# Proof object simplifying inferences  : 5
0.21/0.47	# Training examples: 0 positive, 0 negative
0.21/0.47	# Parsed axioms                        : 64
0.21/0.47	# Removed by relevancy pruning/SinE    : 0
0.21/0.47	# Initial clauses                      : 90
0.21/0.47	# Removed in clause preprocessing      : 2
0.21/0.47	# Initial clauses in saturation        : 88
0.21/0.47	# Processed clauses                    : 1260
0.21/0.47	# ...of these trivial                  : 23
0.21/0.47	# ...subsumed                          : 618
0.21/0.47	# ...remaining for further processing  : 619
0.21/0.47	# Other redundant clauses eliminated   : 4
0.21/0.47	# Clauses deleted for lack of memory   : 0
0.21/0.47	# Backward-subsumed                    : 5
0.21/0.47	# Backward-rewritten                   : 2
0.21/0.47	# Generated clauses                    : 3119
0.21/0.47	# ...of the previous two non-trivial   : 2807
0.21/0.47	# Contextual simplify-reflections      : 21
0.21/0.47	# Paramodulations                      : 3114
0.21/0.47	# Factorizations                       : 2
0.21/0.47	# Equation resolutions                 : 4
0.21/0.47	# Propositional unsat checks           : 0
0.21/0.47	#    Propositional check models        : 0
0.21/0.47	#    Propositional check unsatisfiable : 0
0.21/0.47	#    Propositional clauses             : 0
0.21/0.47	#    Propositional clauses after purity: 0
0.21/0.47	#    Propositional unsat core size     : 0
0.21/0.47	#    Propositional preprocessing time  : 0.000
0.21/0.47	#    Propositional encoding time       : 0.000
0.21/0.47	#    Propositional solver time         : 0.000
0.21/0.47	#    Success case prop preproc time    : 0.000
0.21/0.47	#    Success case prop encoding time   : 0.000
0.21/0.47	#    Success case prop solver time     : 0.000
0.21/0.47	# Current number of processed clauses  : 521
0.21/0.47	#    Positive orientable unit clauses  : 69
0.21/0.47	#    Positive unorientable unit clauses: 3
0.21/0.47	#    Negative unit clauses             : 78
0.21/0.47	#    Non-unit-clauses                  : 371
0.21/0.47	# Current number of unprocessed clauses: 1721
0.21/0.47	# ...number of literals in the above   : 4380
0.21/0.47	# Current number of archived formulas  : 0
0.21/0.47	# Current number of archived clauses   : 97
0.21/0.47	# Clause-clause subsumption calls (NU) : 23679
0.21/0.47	# Rec. Clause-clause subsumption calls : 22190
0.21/0.47	# Non-unit clause-clause subsumptions  : 277
0.21/0.47	# Unit Clause-clause subsumption calls : 2828
0.21/0.47	# Rewrite failures with RHS unbound    : 7
0.21/0.47	# BW rewrite match attempts            : 32
0.21/0.47	# BW rewrite match successes           : 4
0.21/0.47	# Condensation attempts                : 0
0.21/0.47	# Condensation successes               : 0
0.21/0.47	# Termbank termtop insertions          : 45401
0.21/0.47	
0.21/0.47	# -------------------------------------------------
0.21/0.47	# User time                : 0.102 s
0.21/0.47	# System time              : 0.011 s
0.21/0.47	# Total time               : 0.113 s
0.21/0.47	# Maximum resident set size: 1672 pages
0.21/0.47	EOF