0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.12/0.34	% Computer   : n008.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 11:41:29 EDT 2021
0.12/0.34	% CPUTime    : 
0.19/0.50	Running first-order theorem proving
0.19/0.50	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.19/0.50	# Version: 2.6
0.19/0.52	# No SInE strategy applied
0.19/0.52	# Trying AutoSched0 for 59 seconds
0.45/0.66	# AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S4S
0.45/0.66	# and selection function SelectNewComplexAHPNS.
0.45/0.66	#
0.45/0.66	# Preprocessing time       : 0.078 s
0.45/0.66	
0.45/0.66	# Proof found!
0.45/0.66	# SZS status Theorem
0.45/0.66	# SZS output start CNFRefutation
0.45/0.66	fof(query80, conjecture, ?[X5]:(mtvisible(c_tptp_member3393_mt)=>tptptypes_5_387(X5,c_pushingwithopenhand)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', query80)).
0.45/0.66	fof(ax1_451, axiom, (tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)<=mtvisible(c_tptp_spindleheadmt)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_451)).
0.45/0.66	fof(ax1_1123, axiom, ![X20, X21]:((mtvisible(X20)&genlmt(X20,X21))=>mtvisible(X21)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_1123)).
0.45/0.66	fof(ax1_302, axiom, ![X1, X5]:(tptptypes_6_388(X5,X1)<=tptptypes_7_389(X1,X5)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_302)).
0.45/0.66	fof(ax1_133, axiom, genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_133)).
0.45/0.66	fof(ax1_99, axiom, ![X1, X5]:(tptptypes_6_388(X1,X5)=>tptptypes_5_387(X1,X5)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_99)).
0.45/0.66	fof(c_0_6, negated_conjecture, ~(?[X5]:(mtvisible(c_tptp_member3393_mt)=>tptptypes_5_387(X5,c_pushingwithopenhand))), inference(assume_negation,[status(cth)],[query80])).
0.45/0.66	fof(c_0_7, plain, (mtvisible(c_tptp_spindleheadmt)=>tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)), inference(fof_simplification,[status(thm)],[ax1_451])).
0.45/0.66	fof(c_0_8, plain, ![X2055, X2056]:(~mtvisible(X2055)|~genlmt(X2055,X2056)|mtvisible(X2056)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])).
0.45/0.66	fof(c_0_9, negated_conjecture, ![X2265]:(mtvisible(c_tptp_member3393_mt)&~tptptypes_5_387(X2265,c_pushingwithopenhand)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.45/0.66	fof(c_0_10, plain, ![X1, X5]:(tptptypes_7_389(X1,X5)=>tptptypes_6_388(X5,X1)), inference(fof_simplification,[status(thm)],[ax1_302])).
0.45/0.66	fof(c_0_11, plain, (~mtvisible(c_tptp_spindleheadmt)|tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)), inference(fof_nnf,[status(thm)],[c_0_7])).
0.45/0.66	cnf(c_0_12, plain, (mtvisible(X2)|~mtvisible(X1)|~genlmt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.45/0.66	cnf(c_0_13, plain, (genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt)), inference(split_conjunct,[status(thm)],[ax1_133])).
0.45/0.66	cnf(c_0_14, negated_conjecture, (mtvisible(c_tptp_member3393_mt)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.45/0.66	fof(c_0_15, plain, ![X1188, X1189]:(~tptptypes_7_389(X1188,X1189)|tptptypes_6_388(X1189,X1188)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])).
0.45/0.66	cnf(c_0_16, plain, (tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)|~mtvisible(c_tptp_spindleheadmt)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.45/0.66	cnf(c_0_17, plain, (mtvisible(c_tptp_spindleheadmt)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])])).
0.45/0.66	fof(c_0_18, plain, ![X2064, X2065]:(~tptptypes_6_388(X2064,X2065)|tptptypes_5_387(X2064,X2065)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_99])])).
0.45/0.66	cnf(c_0_19, plain, (tptptypes_6_388(X2,X1)|~tptptypes_7_389(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.45/0.66	cnf(c_0_20, plain, (tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])])).
0.45/0.66	cnf(c_0_21, plain, (tptptypes_5_387(X1,X2)|~tptptypes_6_388(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.45/0.66	cnf(c_0_22, plain, (tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.45/0.66	cnf(c_0_23, negated_conjecture, (~tptptypes_5_387(X1,c_pushingwithopenhand)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.45/0.66	cnf(c_0_24, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), ['proof']).
0.45/0.66	# SZS output end CNFRefutation
0.45/0.66	# Proof object total steps             : 25
0.45/0.66	# Proof object clause steps            : 11
0.45/0.66	# Proof object formula steps           : 14
0.45/0.66	# Proof object conjectures             : 5
0.45/0.66	# Proof object clause conjectures      : 2
0.45/0.66	# Proof object formula conjectures     : 3
0.45/0.66	# Proof object initial clauses used    : 7
0.45/0.66	# Proof object initial formulas used   : 6
0.45/0.66	# Proof object generating inferences   : 3
0.45/0.66	# Proof object simplifying inferences  : 5
0.45/0.66	# Training examples: 0 positive, 0 negative
0.45/0.66	# Parsed axioms                        : 1132
0.45/0.66	# Removed by relevancy pruning/SinE    : 0
0.45/0.66	# Initial clauses                      : 1133
0.45/0.66	# Removed in clause preprocessing      : 0
0.45/0.66	# Initial clauses in saturation        : 1133
0.45/0.66	# Processed clauses                    : 1805
0.45/0.66	# ...of these trivial                  : 240
0.45/0.66	# ...subsumed                          : 30
0.45/0.66	# ...remaining for further processing  : 1535
0.45/0.66	# Other redundant clauses eliminated   : 0
0.45/0.66	# Clauses deleted for lack of memory   : 0
0.45/0.66	# Backward-subsumed                    : 1
0.45/0.66	# Backward-rewritten                   : 19
0.45/0.66	# Generated clauses                    : 2854
0.45/0.66	# ...of the previous two non-trivial   : 2791
0.45/0.66	# Contextual simplify-reflections      : 0
0.45/0.66	# Paramodulations                      : 2854
0.45/0.66	# Factorizations                       : 0
0.45/0.66	# NegExts                              : 0
0.45/0.66	# Equation resolutions                 : 0
0.45/0.66	# Propositional unsat checks           : 0
0.45/0.66	#    Propositional check models        : 0
0.45/0.66	#    Propositional check unsatisfiable : 0
0.45/0.66	#    Propositional clauses             : 0
0.45/0.66	#    Propositional clauses after purity: 0
0.45/0.66	#    Propositional unsat core size     : 0
0.45/0.66	#    Propositional preprocessing time  : 0.000
0.45/0.66	#    Propositional encoding time       : 0.000
0.45/0.66	#    Propositional solver time         : 0.000
0.45/0.66	#    Success case prop preproc time    : 0.000
0.45/0.66	#    Success case prop encoding time   : 0.000
0.45/0.66	#    Success case prop solver time     : 0.000
0.45/0.66	# Current number of processed clauses  : 1515
0.45/0.66	#    Positive orientable unit clauses  : 649
0.45/0.66	#    Positive unorientable unit clauses: 0
0.45/0.66	#    Negative unit clauses             : 19
0.45/0.66	#    Non-unit-clauses                  : 847
0.45/0.66	# Current number of unprocessed clauses: 2119
0.45/0.66	# ...number of literals in the above   : 3481
0.45/0.66	# Current number of archived formulas  : 0
0.45/0.66	# Current number of archived clauses   : 20
0.45/0.66	# Clause-clause subsumption calls (NU) : 93693
0.45/0.66	# Rec. Clause-clause subsumption calls : 88159
0.45/0.66	# Non-unit clause-clause subsumptions  : 31
0.45/0.66	# Unit Clause-clause subsumption calls : 22383
0.45/0.66	# Rewrite failures with RHS unbound    : 0
0.45/0.66	# BW rewrite match attempts            : 9
0.45/0.66	# BW rewrite match successes           : 6
0.45/0.66	# Condensation attempts                : 0
0.45/0.66	# Condensation successes               : 0
0.45/0.66	# Termbank termtop insertions          : 85395
0.45/0.66	
0.45/0.66	# -------------------------------------------------
0.45/0.66	# User time                : 0.149 s
0.45/0.66	# System time              : 0.011 s
0.45/0.66	# Total time               : 0.160 s
0.45/0.66	# Maximum resident set size: 2544 pages
0.45/0.66	EOF