0.09/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.11	% Command    : run_E %s %d THM
0.10/0.32	% Computer   : n024.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1200
0.10/0.32	% WCLimit    : 120
0.10/0.32	% DateTime   : Wed Jul 14 14:20:17 EDT 2021
0.10/0.32	% CPUTime    : 
0.17/0.44	Running first-order theorem proving
0.17/0.44	Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.17/0.44	# Version: 2.6
0.17/0.45	# No SInE strategy applied
0.17/0.45	# Trying AutoSched0 for 59 seconds
0.17/0.49	# AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S04AN
0.17/0.49	# and selection function SelectComplexExceptUniqMaxHorn.
0.17/0.49	#
0.17/0.49	# Preprocessing time       : 0.031 s
0.17/0.49	# Presaturation interreduction done
0.17/0.49	
0.17/0.49	# Proof found!
0.17/0.49	# SZS status Theorem
0.17/0.49	# SZS output start CNFRefutation
0.17/0.49	fof(ax37, axiom, ![X1, X2, X3, X4, X5]:((check_cpq(triple(X1,X2,X3))<=>check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)))<=less_than(X5,X4)), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax', ax37)).
0.17/0.49	fof(ax42, axiom, ![X1, X2, X3, X4]:triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3)=insert_cpq(triple(X1,X2,X3),X4), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax', ax42)).
0.17/0.49	fof(bottom_smallest, axiom, ![X1]:less_than(bottom,X1), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax', bottom_smallest)).
0.17/0.49	fof(l26_li4142, lemma, ![X1, X2, X3]:(![X4, X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))<=>check_cpq(triple(X1,X2,X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l26_li4142)).
0.17/0.49	fof(l26_co, conjecture, ![X1, X2, X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:~(check_cpq(insert_cpq(triple(X1,X2,X3),X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l26_co)).
0.17/0.49	fof(c_0_5, plain, ![X1, X2, X3, X4, X5]:(less_than(X5,X4)=>(check_cpq(triple(X1,X2,X3))<=>check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)))), inference(fof_simplification,[status(thm)],[ax37])).
0.17/0.49	fof(c_0_6, plain, ![X213, X214, X215, X216, X217]:((~check_cpq(triple(X213,X214,X215))|check_cpq(triple(X213,insert_slb(X214,pair(X216,X217)),X215))|~less_than(X217,X216))&(~check_cpq(triple(X213,insert_slb(X214,pair(X216,X217)),X215))|check_cpq(triple(X213,X214,X215))|~less_than(X217,X216))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.17/0.49	fof(c_0_7, plain, ![X193, X194, X195, X196]:triple(insert_pqp(X193,X196),insert_slb(X194,pair(X196,bottom)),X195)=insert_cpq(triple(X193,X194,X195),X196), inference(variable_rename,[status(thm)],[ax42])).
0.17/0.49	fof(c_0_8, plain, ![X140]:less_than(bottom,X140), inference(variable_rename,[status(thm)],[bottom_smallest])).
0.17/0.49	fof(c_0_9, lemma, ![X249, X250, X253, X254, X255, X256, X257, X258]:(((pair_in_list(X250,esk5_2(X249,X250),esk6_2(X249,X250))|check_cpq(triple(X249,X250,X253)))&(~less_than(esk6_2(X249,X250),esk5_2(X249,X250))|check_cpq(triple(X249,X250,X253))))&(~check_cpq(triple(X254,X255,X256))|(~pair_in_list(X255,X257,X258)|less_than(X258,X257)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[l26_li4142])])])])])])).
0.17/0.49	cnf(c_0_10, plain, (check_cpq(triple(X1,X2,X5))|~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~less_than(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.17/0.49	cnf(c_0_11, plain, (triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4)=insert_cpq(triple(X1,X3,X4),X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.17/0.49	cnf(c_0_12, plain, (less_than(bottom,X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.17/0.49	fof(c_0_13, negated_conjecture, ~(![X1, X2, X3]:(~check_cpq(triple(X1,X2,X3))=>![X4]:~check_cpq(insert_cpq(triple(X1,X2,X3),X4)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l26_co])])).
0.17/0.49	cnf(c_0_14, lemma, (less_than(X5,X4)|~check_cpq(triple(X1,X2,X3))|~pair_in_list(X2,X4,X5)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.17/0.49	cnf(c_0_15, plain, (check_cpq(triple(insert_pqp(X1,X2),X3,X4))|~check_cpq(insert_cpq(triple(X1,X3,X4),X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])])).
0.17/0.49	fof(c_0_16, negated_conjecture, (~check_cpq(triple(esk1_0,esk2_0,esk3_0))&check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.17/0.49	cnf(c_0_17, lemma, (less_than(X1,X2)|~check_cpq(insert_cpq(triple(X3,X4,X5),X6))|~pair_in_list(X4,X2,X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.17/0.49	cnf(c_0_18, negated_conjecture, (check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.17/0.49	cnf(c_0_19, negated_conjecture, (less_than(X1,X2)|~pair_in_list(esk2_0,X2,X1)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.17/0.49	cnf(c_0_20, lemma, (pair_in_list(X1,esk5_2(X2,X1),esk6_2(X2,X1))|check_cpq(triple(X2,X1,X3))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.17/0.49	cnf(c_0_21, lemma, (check_cpq(triple(X1,X2,X3))|~less_than(esk6_2(X1,X2),esk5_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.17/0.49	cnf(c_0_22, negated_conjecture, (~check_cpq(triple(esk1_0,esk2_0,esk3_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.17/0.49	cnf(c_0_23, lemma, (check_cpq(triple(X1,esk2_0,X2))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])).
0.17/0.49	cnf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23])]), ['proof']).
0.17/0.49	# SZS output end CNFRefutation
0.17/0.49	# Proof object total steps             : 25
0.17/0.49	# Proof object clause steps            : 13
0.17/0.49	# Proof object formula steps           : 12
0.17/0.49	# Proof object conjectures             : 7
0.17/0.49	# Proof object clause conjectures      : 4
0.17/0.49	# Proof object formula conjectures     : 3
0.17/0.49	# Proof object initial clauses used    : 8
0.17/0.49	# Proof object initial formulas used   : 5
0.17/0.49	# Proof object generating inferences   : 4
0.17/0.49	# Proof object simplifying inferences  : 5
0.17/0.49	# Training examples: 0 positive, 0 negative
0.17/0.49	# Parsed axioms                        : 43
0.17/0.49	# Removed by relevancy pruning/SinE    : 0
0.17/0.49	# Initial clauses                      : 55
0.17/0.49	# Removed in clause preprocessing      : 2
0.17/0.49	# Initial clauses in saturation        : 53
0.17/0.49	# Processed clauses                    : 255
0.17/0.49	# ...of these trivial                  : 1
0.17/0.49	# ...subsumed                          : 77
0.17/0.49	# ...remaining for further processing  : 177
0.17/0.49	# Other redundant clauses eliminated   : 3
0.17/0.49	# Clauses deleted for lack of memory   : 0
0.17/0.49	# Backward-subsumed                    : 0
0.17/0.49	# Backward-rewritten                   : 1
0.17/0.49	# Generated clauses                    : 519
0.17/0.49	# ...of the previous two non-trivial   : 468
0.17/0.49	# Contextual simplify-reflections      : 6
0.17/0.49	# Paramodulations                      : 515
0.17/0.49	# Factorizations                       : 2
0.17/0.49	# NegExts                              : 0
0.17/0.49	# Equation resolutions                 : 3
0.17/0.49	# Propositional unsat checks           : 0
0.17/0.49	#    Propositional check models        : 0
0.17/0.49	#    Propositional check unsatisfiable : 0
0.17/0.49	#    Propositional clauses             : 0
0.17/0.49	#    Propositional clauses after purity: 0
0.17/0.49	#    Propositional unsat core size     : 0
0.17/0.49	#    Propositional preprocessing time  : 0.000
0.17/0.49	#    Propositional encoding time       : 0.000
0.17/0.49	#    Propositional solver time         : 0.000
0.17/0.49	#    Success case prop preproc time    : 0.000
0.17/0.49	#    Success case prop encoding time   : 0.000
0.17/0.49	#    Success case prop solver time     : 0.000
0.17/0.49	# Current number of processed clauses  : 121
0.17/0.49	#    Positive orientable unit clauses  : 28
0.17/0.49	#    Positive unorientable unit clauses: 1
0.17/0.49	#    Negative unit clauses             : 29
0.17/0.49	#    Non-unit-clauses                  : 63
0.17/0.49	# Current number of unprocessed clauses: 319
0.17/0.49	# ...number of literals in the above   : 945
0.17/0.49	# Current number of archived formulas  : 0
0.17/0.49	# Current number of archived clauses   : 56
0.17/0.49	# Clause-clause subsumption calls (NU) : 624
0.17/0.49	# Rec. Clause-clause subsumption calls : 494
0.17/0.49	# Non-unit clause-clause subsumptions  : 21
0.17/0.49	# Unit Clause-clause subsumption calls : 531
0.17/0.49	# Rewrite failures with RHS unbound    : 8
0.17/0.49	# BW rewrite match attempts            : 15
0.17/0.49	# BW rewrite match successes           : 4
0.17/0.49	# Condensation attempts                : 0
0.17/0.49	# Condensation successes               : 0
0.17/0.49	# Termbank termtop insertions          : 11077
0.17/0.49	
0.17/0.49	# -------------------------------------------------
0.17/0.49	# User time                : 0.044 s
0.17/0.49	# System time              : 0.007 s
0.17/0.49	# Total time               : 0.051 s
0.17/0.49	# Maximum resident set size: 1652 pages
0.17/0.49	EOF