0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.32	% Computer : n011.cluster.edu
0.12/0.32	% Model    : x86_64 x86_64
0.12/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory   : 8042.1875MB
0.12/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1920
0.12/0.32	% WCLimit    : 240
0.12/0.32	% DateTime   : Wed Jul 30 01:59:34 EDT 2025
0.12/0.33	% CPUTime    : 
0.19/0.45	Running first-order theorem proving
0.19/0.45	Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/benchmark/theBenchmark.p
0.79/0.56	# Version: 3.0.0
0.79/0.56	# Preprocessing class: FSLSSMSSSSSNFFN.
0.79/0.56	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.79/0.56	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1200s (5) cores
0.79/0.56	# Starting new_bool_3 with 240s (1) cores
0.79/0.56	# Starting new_bool_1 with 240s (1) cores
0.79/0.56	# Starting sh5l with 240s (1) cores
0.79/0.56	# new_bool_3 with pid 26270 completed with status 0
0.79/0.56	# Result found by new_bool_3
0.79/0.56	# Preprocessing class: FSLSSMSSSSSNFFN.
0.79/0.56	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.79/0.56	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1200s (5) cores
0.79/0.56	# Starting new_bool_3 with 240s (1) cores
0.79/0.56	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.79/0.56	# Search class: FGHSM-FFMF31-MFFFFFNN
0.79/0.56	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
0.79/0.56	# Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 145s (1) cores
0.79/0.56	# G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 26273 completed with status 0
0.79/0.56	# Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
0.79/0.56	# Preprocessing class: FSLSSMSSSSSNFFN.
0.79/0.56	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.79/0.56	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1200s (5) cores
0.79/0.56	# Starting new_bool_3 with 240s (1) cores
0.79/0.56	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.79/0.56	# Search class: FGHSM-FFMF31-MFFFFFNN
0.79/0.56	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
0.79/0.56	# Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 145s (1) cores
0.79/0.56	# Preprocessing time       : 0.001 s
0.79/0.56	# Presaturation interreduction done
0.79/0.56	
0.79/0.56	# Proof found!
0.79/0.56	# SZS status Theorem
0.79/0.56	# SZS output start CNFRefutation
0.79/0.56	fof(l48_li3839, lemma, ![X1, X2, X3, X4]:((pair_in_list(update_slb(X1,X4),X2,X4)<=(strictly_less_than(X3,X4)&pair_in_list(X1,X2,X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l48_li3839)).
0.79/0.56	fof(stricly_smaller_definition, axiom, ![X1, X2]:((strictly_less_than(X1,X2)<=>(~(less_than(X2,X1))&less_than(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax', stricly_smaller_definition)).
0.79/0.56	fof(l45_li4647, lemma, ![X1, X2]:((contains_slb(X1,X2)=>?[X3]:(pair_in_list(X1,X2,X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l45_li4647)).
0.79/0.56	fof(totality, axiom, ![X1, X2]:((less_than(X1,X2)|less_than(X2,X1))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax', totality)).
0.79/0.56	fof(l44_co, conjecture, ![X1, X2, X3, X4]:(((strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))&contains_slb(X2,X4))=>(?[X5]:((less_than(findmin_pqp_res(X1),X5)&pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)))|pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l44_co)).
0.79/0.56	fof(l49_li3637, lemma, ![X1, X2, X3, X4]:(((less_than(X4,X3)&pair_in_list(X1,X2,X3))=>pair_in_list(update_slb(X1,X4),X2,X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l49_li3637)).
0.79/0.56	fof(c_0_6, lemma, ![X1, X2, X3, X4]:(((strictly_less_than(X3,X4)&pair_in_list(X1,X2,X3))=>pair_in_list(update_slb(X1,X4),X2,X4))), inference(fof_simplification,[status(thm)],[l48_li3839])).
0.79/0.57	fof(c_0_7, plain, ![X1, X2]:((strictly_less_than(X1,X2)<=>(~less_than(X2,X1)&less_than(X1,X2)))), inference(fof_simplification,[status(thm)],[stricly_smaller_definition])).
0.79/0.57	fof(c_0_8, lemma, ![X25, X26, X27, X28]:((~strictly_less_than(X27,X28)|~pair_in_list(X25,X26,X27)|pair_in_list(update_slb(X25,X28),X26,X28))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
0.79/0.57	fof(c_0_9, lemma, ![X18, X19]:((~contains_slb(X18,X19)|pair_in_list(X18,X19,esk5_2(X18,X19)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l45_li4647])])])])).
0.79/0.57	fof(c_0_10, plain, ![X61, X62]:((((~less_than(X62,X61)|~strictly_less_than(X61,X62))&(less_than(X61,X62)|~strictly_less_than(X61,X62)))&(less_than(X62,X61)|~less_than(X61,X62)|strictly_less_than(X61,X62)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])).
0.79/0.57	fof(c_0_11, plain, ![X50, X51]:((less_than(X50,X51)|less_than(X51,X50))), inference(variable_rename,[status(thm)],[totality])).
0.79/0.57	fof(c_0_12, negated_conjecture, ~(![X1, X2, X3, X4]:(((strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))&contains_slb(X2,X4))=>(?[X5]:((less_than(findmin_pqp_res(X1),X5)&pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)))|pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1)))))), inference(assume_negation,[status(cth)],[l44_co])).
0.79/0.57	cnf(c_0_13, lemma, (pair_in_list(update_slb(X3,X2),X4,X2)|~strictly_less_than(X1,X2)|~pair_in_list(X3,X4,X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.79/0.57	cnf(c_0_14, lemma, (pair_in_list(X1,X2,esk5_2(X1,X2))|~contains_slb(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.79/0.57	cnf(c_0_15, plain, (less_than(X1,X2)|strictly_less_than(X2,X1)|~less_than(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.79/0.57	cnf(c_0_16, plain, (less_than(X1,X2)|less_than(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.79/0.57	fof(c_0_17, negated_conjecture, ![X10]:(((strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))&contains_slb(esk2_0,esk4_0))&((~less_than(findmin_pqp_res(esk1_0),X10)|~pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X10))&~pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])).
0.79/0.57	fof(c_0_18, lemma, ![X21, X22, X23, X24]:((~less_than(X24,X23)|~pair_in_list(X21,X22,X23)|pair_in_list(update_slb(X21,X24),X22,X23))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l49_li3637])])])).
0.79/0.57	cnf(c_0_19, lemma, (pair_in_list(update_slb(X1,X2),X3,X2)|~contains_slb(X1,X3)|~strictly_less_than(esk5_2(X1,X3),X2)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.79/0.57	cnf(c_0_20, plain, (strictly_less_than(X1,X2)|less_than(X2,X1)), inference(csr,[status(thm)],[c_0_15, c_0_16])).
0.79/0.57	cnf(c_0_21, negated_conjecture, (~less_than(findmin_pqp_res(esk1_0),X1)|~pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.79/0.57	cnf(c_0_22, lemma, (pair_in_list(update_slb(X3,X1),X4,X2)|~less_than(X1,X2)|~pair_in_list(X3,X4,X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.79/0.57	cnf(c_0_23, lemma, (pair_in_list(update_slb(X1,X2),X3,X2)|less_than(X2,esk5_2(X1,X3))|~contains_slb(X1,X3)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.79/0.57	cnf(c_0_24, negated_conjecture, (contains_slb(esk2_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.79/0.57	cnf(c_0_25, negated_conjecture, (~pair_in_list(esk2_0,esk4_0,X1)|~less_than(findmin_pqp_res(esk1_0),X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.79/0.57	cnf(c_0_26, negated_conjecture, (pair_in_list(update_slb(esk2_0,X1),esk4_0,X1)|less_than(X1,esk5_2(esk2_0,esk4_0))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.79/0.57	cnf(c_0_27, negated_conjecture, (~pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.79/0.57	cnf(c_0_28, negated_conjecture, (~pair_in_list(esk2_0,esk4_0,esk5_2(esk2_0,esk4_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
0.79/0.57	cnf(c_0_29, lemma, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_14]), c_0_24])]), ['proof']).
0.79/0.57	# SZS output end CNFRefutation
0.79/0.57	# Parsed axioms                        : 45
0.79/0.57	# Removed by relevancy pruning/SinE    : 19
0.79/0.57	# Initial clauses                      : 36
0.79/0.57	# Removed in clause preprocessing      : 0
0.79/0.57	# Initial clauses in saturation        : 36
0.79/0.57	# Processed clauses                    : 773
0.79/0.57	# ...of these trivial                  : 6
0.79/0.57	# ...subsumed                          : 534
0.79/0.57	# ...remaining for further processing  : 233
0.79/0.57	# Other redundant clauses eliminated   : 3
0.79/0.57	# Clauses deleted for lack of memory   : 0
0.79/0.57	# Backward-subsumed                    : 3
0.79/0.57	# Backward-rewritten                   : 0
0.79/0.57	# Generated clauses                    : 3142
0.79/0.57	# ...of the previous two non-redundant : 2697
0.79/0.57	# ...aggressively subsumed             : 0
0.79/0.57	# Contextual simplify-reflections      : 2
0.79/0.57	# Paramodulations                      : 2960
0.79/0.57	# Factorizations                       : 180
0.79/0.57	# NegExts                              : 0
0.79/0.57	# Equation resolutions                 : 3
0.79/0.57	# Disequality decompositions           : 0
0.79/0.57	# Total rewrite steps                  : 548
0.79/0.57	# ...of those cached                   : 480
0.79/0.57	# Propositional unsat checks           : 0
0.79/0.57	#    Propositional check models        : 0
0.79/0.57	#    Propositional check unsatisfiable : 0
0.79/0.57	#    Propositional clauses             : 0
0.79/0.57	#    Propositional clauses after purity: 0
0.79/0.57	#    Propositional unsat core size     : 0
0.79/0.57	#    Propositional preprocessing time  : 0.000
0.79/0.57	#    Propositional encoding time       : 0.000
0.79/0.57	#    Propositional solver time         : 0.000
0.79/0.57	#    Success case prop preproc time    : 0.000
0.79/0.57	#    Success case prop encoding time   : 0.000
0.79/0.57	#    Success case prop solver time     : 0.000
0.79/0.57	# Current number of processed clauses  : 192
0.79/0.57	#    Positive orientable unit clauses  : 14
0.79/0.57	#    Positive unorientable unit clauses: 0
0.79/0.57	#    Negative unit clauses             : 6
0.79/0.57	#    Non-unit-clauses                  : 172
0.79/0.57	# Current number of unprocessed clauses: 1994
0.79/0.57	# ...number of literals in the above   : 11031
0.79/0.57	# Current number of archived formulas  : 0
0.79/0.57	# Current number of archived clauses   : 39
0.79/0.57	# Clause-clause subsumption calls (NU) : 9320
0.79/0.57	# Rec. Clause-clause subsumption calls : 5261
0.79/0.57	# Non-unit clause-clause subsumptions  : 506
0.79/0.57	# Unit Clause-clause subsumption calls : 55
0.79/0.57	# Rewrite failures with RHS unbound    : 0
0.79/0.57	# BW rewrite match attempts            : 14
0.79/0.57	# BW rewrite match successes           : 1
0.79/0.57	# Condensation attempts                : 0
0.79/0.57	# Condensation successes               : 0
0.79/0.57	# Termbank termtop insertions          : 61193
0.79/0.57	# Search garbage collected termcells   : 616
0.79/0.57	
0.79/0.57	# -------------------------------------------------
0.79/0.57	# User time                : 0.071 s
0.79/0.57	# System time              : 0.005 s
0.79/0.57	# Total time               : 0.076 s
0.79/0.57	# Maximum resident set size: 1852 pages
0.79/0.57	
0.79/0.57	# -------------------------------------------------
0.79/0.57	# User time                : 0.075 s
0.79/0.57	# System time              : 0.005 s
0.79/0.57	# Total time               : 0.080 s
0.79/0.57	# Maximum resident set size: 1772 pages
0.79/0.57	% E exiting
0.79/0.57	% E exiting
0.79/0.57	EOF