0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.11/0.32	% Computer : n006.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1920
0.11/0.32	% WCLimit    : 240
0.11/0.32	% DateTime   : Wed Jul 30 02:00:34 EDT 2025
0.11/0.32	% CPUTime    : 
0.19/0.46	Running first-order theorem proving
0.19/0.46	Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
0.19/0.50	# Version: 3.0.0
0.19/0.50	# Preprocessing class: FSLSSMSSSSSNFFN.
0.19/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.50	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1200s (5) cores
0.19/0.50	# Starting new_bool_3 with 240s (1) cores
0.19/0.50	# Starting new_bool_1 with 240s (1) cores
0.19/0.50	# Starting sh5l with 240s (1) cores
0.19/0.50	# new_bool_3 with pid 6387 completed with status 0
0.19/0.50	# Result found by new_bool_3
0.19/0.50	# Preprocessing class: FSLSSMSSSSSNFFN.
0.19/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.50	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1200s (5) cores
0.19/0.50	# Starting new_bool_3 with 240s (1) cores
0.19/0.50	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.19/0.50	# Search class: FGHSF-FFMM32-SFFFFFNN
0.19/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.50	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 130s (1) cores
0.19/0.50	# G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 6390 completed with status 0
0.19/0.50	# Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
0.19/0.50	# Preprocessing class: FSLSSMSSSSSNFFN.
0.19/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.50	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1200s (5) cores
0.19/0.50	# Starting new_bool_3 with 240s (1) cores
0.19/0.50	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.19/0.50	# Search class: FGHSF-FFMM32-SFFFFFNN
0.19/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.50	# Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 130s (1) cores
0.19/0.50	# Preprocessing time       : 0.002 s
0.19/0.50	# Presaturation interreduction done
0.19/0.50	
0.19/0.50	# Proof found!
0.19/0.50	# SZS status Theorem
0.19/0.50	# SZS output start CNFRefutation
0.19/0.50	fof(sos_49, axiom, ![X87]:((?[X88, X89, X90]:(((((((root_occ(X88,X87)&(occurrence_of(X90,tptp1)|occurrence_of(X90,tptp2)))&leaf_occ(X90,X87))&next_subocc(X89,X90,tptp0))&next_subocc(X88,X89,tptp0))&occurrence_of(X89,tptp4))&occurrence_of(X88,tptp3)))<=occurrence_of(X87,tptp0))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_49)).
0.19/0.50	fof(goals, conjecture, ![X36]:((occurrence_of(X36,tptp0)=>?[X37, X38]:((((~(?[X39]:((occurrence_of(X39,tptp1)&min_precedes(X37,X39,tptp0))))<=occurrence_of(X38,tptp2))&(occurrence_of(X38,tptp1)=>~(?[X40]:((min_precedes(X37,X40,tptp0)&occurrence_of(X40,tptp2))))))&leaf_occ(X38,X36))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', goals)).
0.19/0.50	fof(sos_37, axiom, ![X47, X48, X49]:((~(?[X50]:(min_precedes(X48,X50,X49)))<=(occurrence_of(X47,X49)&leaf_occ(X48,X47)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_37)).
0.19/0.50	fof(sos_02, axiom, ![X105, X106, X107]:((X106=X107<=(occurrence_of(X105,X106)&occurrence_of(X105,X107)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_02)).
0.19/0.50	fof(sos_61, axiom, tptp1!=tptp2, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_61)).
0.19/0.50	fof(c_0_5, plain, ![X87]:((occurrence_of(X87,tptp0)=>?[X88, X89, X90]:(((((((root_occ(X88,X87)&(occurrence_of(X90,tptp1)|occurrence_of(X90,tptp2)))&leaf_occ(X90,X87))&next_subocc(X89,X90,tptp0))&next_subocc(X88,X89,tptp0))&occurrence_of(X89,tptp4))&occurrence_of(X88,tptp3))))), inference(fof_simplification,[status(thm)],[sos_49])).
0.19/0.50	fof(c_0_6, negated_conjecture, ~(![X36]:((occurrence_of(X36,tptp0)=>?[X37, X38]:((((occurrence_of(X38,tptp2)=>~(?[X39]:((occurrence_of(X39,tptp1)&min_precedes(X37,X39,tptp0)))))&(occurrence_of(X38,tptp1)=>~(?[X40]:((min_precedes(X37,X40,tptp0)&occurrence_of(X40,tptp2))))))&leaf_occ(X38,X36)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])])).
0.19/0.50	fof(c_0_7, plain, ![X205]:((((((((root_occ(esk4_1(X205),X205)|~occurrence_of(X205,tptp0))&(occurrence_of(esk6_1(X205),tptp1)|occurrence_of(esk6_1(X205),tptp2)|~occurrence_of(X205,tptp0)))&(leaf_occ(esk6_1(X205),X205)|~occurrence_of(X205,tptp0)))&(next_subocc(esk5_1(X205),esk6_1(X205),tptp0)|~occurrence_of(X205,tptp0)))&(next_subocc(esk4_1(X205),esk5_1(X205),tptp0)|~occurrence_of(X205,tptp0)))&(occurrence_of(esk5_1(X205),tptp4)|~occurrence_of(X205,tptp0)))&(occurrence_of(esk4_1(X205),tptp3)|~occurrence_of(X205,tptp0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])).
0.19/0.50	fof(c_0_8, negated_conjecture, ![X172, X173]:((occurrence_of(esk1_0,tptp0)&(((occurrence_of(X173,tptp1)|occurrence_of(X173,tptp2)|~leaf_occ(X173,esk1_0))&((min_precedes(X172,esk3_2(X172,X173),tptp0)|occurrence_of(X173,tptp2)|~leaf_occ(X173,esk1_0))&(occurrence_of(esk3_2(X172,X173),tptp2)|occurrence_of(X173,tptp2)|~leaf_occ(X173,esk1_0))))&(((occurrence_of(X173,tptp1)|occurrence_of(esk2_2(X172,X173),tptp1)|~leaf_occ(X173,esk1_0))&((min_precedes(X172,esk3_2(X172,X173),tptp0)|occurrence_of(esk2_2(X172,X173),tptp1)|~leaf_occ(X173,esk1_0))&(occurrence_of(esk3_2(X172,X173),tptp2)|occurrence_of(esk2_2(X172,X173),tptp1)|~leaf_occ(X173,esk1_0))))&((occurrence_of(X173,tptp1)|min_precedes(X172,esk2_2(X172,X173),tptp0)|~leaf_occ(X173,esk1_0))&((min_precedes(X172,esk3_2(X172,X173),tptp0)|min_precedes(X172,esk2_2(X172,X173),tptp0)|~leaf_occ(X173,esk1_0))&(occurrence_of(esk3_2(X172,X173),tptp2)|min_precedes(X172,esk2_2(X172,X173),tptp0)|~leaf_occ(X173,esk1_0)))))))), inference(distribute,[status(thm)],[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_6])])])])])])).
0.19/0.50	fof(c_0_9, plain, ![X47, X48, X49]:(((occurrence_of(X47,X49)&leaf_occ(X48,X47))=>~(?[X50]:(min_precedes(X48,X50,X49))))), inference(fof_simplification,[status(thm)],[sos_37])).
0.19/0.50	cnf(c_0_10, plain, (leaf_occ(esk6_1(X1),X1)|~occurrence_of(X1,tptp0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.19/0.50	cnf(c_0_11, negated_conjecture, (occurrence_of(esk1_0,tptp0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.19/0.50	fof(c_0_12, plain, ![X176, X177, X178, X179]:((~occurrence_of(X176,X178)|~leaf_occ(X177,X176)|~min_precedes(X177,X179,X178))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])).
0.19/0.50	cnf(c_0_13, negated_conjecture, (min_precedes(X1,esk3_2(X1,X2),tptp0)|occurrence_of(X2,tptp2)|~leaf_occ(X2,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.19/0.50	cnf(c_0_14, negated_conjecture, (leaf_occ(esk6_1(esk1_0),esk1_0)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.19/0.50	cnf(c_0_15, plain, (~occurrence_of(X1,X2)|~leaf_occ(X3,X1)|~min_precedes(X3,X4,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.50	cnf(c_0_16, negated_conjecture, (min_precedes(X1,esk3_2(X1,esk6_1(esk1_0)),tptp0)|occurrence_of(esk6_1(esk1_0),tptp2)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.19/0.50	cnf(c_0_17, negated_conjecture, (occurrence_of(X1,tptp1)|min_precedes(X2,esk2_2(X2,X1),tptp0)|~leaf_occ(X1,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.19/0.50	fof(c_0_18, plain, ![X105, X106, X107]:(((occurrence_of(X105,X106)&occurrence_of(X105,X107))=>X106=X107)), inference(fof_simplification,[status(thm)],[sos_02])).
0.19/0.50	cnf(c_0_19, negated_conjecture, (occurrence_of(esk6_1(esk1_0),tptp2)|~occurrence_of(X1,tptp0)|~leaf_occ(X2,X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.19/0.50	cnf(c_0_20, negated_conjecture, (min_precedes(X1,esk2_2(X1,esk6_1(esk1_0)),tptp0)|occurrence_of(esk6_1(esk1_0),tptp1)), inference(spm,[status(thm)],[c_0_17, c_0_14])).
0.19/0.50	fof(c_0_21, plain, ![X202, X203, X204]:((~occurrence_of(X202,X203)|~occurrence_of(X202,X204)|X203=X204)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
0.19/0.50	cnf(c_0_22, negated_conjecture, (occurrence_of(esk6_1(esk1_0),tptp2)|~leaf_occ(X1,esk1_0)), inference(spm,[status(thm)],[c_0_19, c_0_11])).
0.19/0.50	cnf(c_0_23, negated_conjecture, (occurrence_of(esk6_1(esk1_0),tptp1)|~occurrence_of(X1,tptp0)|~leaf_occ(X2,X1)), inference(spm,[status(thm)],[c_0_15, c_0_20])).
0.19/0.50	fof(c_0_24, plain, tptp1!=tptp2, inference(fof_simplification,[status(thm)],[sos_61])).
0.19/0.50	cnf(c_0_25, plain, (X2=X3|~occurrence_of(X1,X2)|~occurrence_of(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.19/0.50	cnf(c_0_26, negated_conjecture, (occurrence_of(esk6_1(esk1_0),tptp2)), inference(spm,[status(thm)],[c_0_22, c_0_14])).
0.19/0.50	cnf(c_0_27, negated_conjecture, (occurrence_of(esk6_1(esk1_0),tptp1)|~leaf_occ(X1,esk1_0)), inference(spm,[status(thm)],[c_0_23, c_0_11])).
0.19/0.50	fof(c_0_28, plain, tptp1!=tptp2, inference(fof_nnf,[status(thm)],[c_0_24])).
0.19/0.50	cnf(c_0_29, negated_conjecture, (X1=tptp2|~occurrence_of(esk6_1(esk1_0),X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.19/0.50	cnf(c_0_30, negated_conjecture, (occurrence_of(esk6_1(esk1_0),tptp1)), inference(spm,[status(thm)],[c_0_27, c_0_14])).
0.19/0.50	cnf(c_0_31, plain, (tptp1!=tptp2), inference(split_conjunct,[status(thm)],[c_0_28])).
0.19/0.50	cnf(c_0_32, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31]), ['proof']).
0.19/0.50	# SZS output end CNFRefutation
0.19/0.50	# Parsed axioms                        : 63
0.19/0.50	# Removed by relevancy pruning/SinE    : 9
0.19/0.50	# Initial clauses                      : 95
0.19/0.50	# Removed in clause preprocessing      : 0
0.19/0.50	# Initial clauses in saturation        : 95
0.19/0.50	# Processed clauses                    : 341
0.19/0.50	# ...of these trivial                  : 7
0.19/0.50	# ...subsumed                          : 22
0.19/0.50	# ...remaining for further processing  : 312
0.19/0.50	# Other redundant clauses eliminated   : 0
0.19/0.50	# Clauses deleted for lack of memory   : 0
0.19/0.50	# Backward-subsumed                    : 5
0.19/0.50	# Backward-rewritten                   : 26
0.19/0.50	# Generated clauses                    : 404
0.19/0.50	# ...of the previous two non-redundant : 333
0.19/0.50	# ...aggressively subsumed             : 0
0.19/0.50	# Contextual simplify-reflections      : 3
0.19/0.50	# Paramodulations                      : 404
0.19/0.50	# Factorizations                       : 0
0.19/0.50	# NegExts                              : 0
0.19/0.50	# Equation resolutions                 : 0
0.19/0.50	# Disequality decompositions           : 0
0.19/0.50	# Total rewrite steps                  : 172
0.19/0.50	# ...of those cached                   : 132
0.19/0.50	# Propositional unsat checks           : 0
0.19/0.50	#    Propositional check models        : 0
0.19/0.50	#    Propositional check unsatisfiable : 0
0.19/0.50	#    Propositional clauses             : 0
0.19/0.50	#    Propositional clauses after purity: 0
0.19/0.50	#    Propositional unsat core size     : 0
0.19/0.51	#    Propositional preprocessing time  : 0.000
0.19/0.51	#    Propositional encoding time       : 0.000
0.19/0.51	#    Propositional solver time         : 0.000
0.19/0.51	#    Success case prop preproc time    : 0.000
0.19/0.51	#    Success case prop encoding time   : 0.000
0.19/0.51	#    Success case prop solver time     : 0.000
0.19/0.51	# Current number of processed clauses  : 186
0.19/0.51	#    Positive orientable unit clauses  : 55
0.19/0.51	#    Positive unorientable unit clauses: 0
0.19/0.51	#    Negative unit clauses             : 23
0.19/0.51	#    Non-unit-clauses                  : 108
0.19/0.51	# Current number of unprocessed clauses: 159
0.19/0.51	# ...number of literals in the above   : 379
0.19/0.51	# Current number of archived formulas  : 0
0.19/0.51	# Current number of archived clauses   : 126
0.19/0.51	# Clause-clause subsumption calls (NU) : 4127
0.19/0.51	# Rec. Clause-clause subsumption calls : 2054
0.19/0.51	# Non-unit clause-clause subsumptions  : 9
0.19/0.51	# Unit Clause-clause subsumption calls : 1259
0.19/0.51	# Rewrite failures with RHS unbound    : 0
0.19/0.51	# BW rewrite match attempts            : 12
0.19/0.51	# BW rewrite match successes           : 12
0.19/0.51	# Condensation attempts                : 0
0.19/0.51	# Condensation successes               : 0
0.19/0.51	# Termbank termtop insertions          : 13287
0.19/0.51	# Search garbage collected termcells   : 1750
0.19/0.51	
0.19/0.51	# -------------------------------------------------
0.19/0.51	# User time                : 0.028 s
0.19/0.51	# System time              : 0.001 s
0.19/0.51	# Total time               : 0.030 s
0.19/0.51	# Maximum resident set size: 2136 pages
0.19/0.51	
0.19/0.51	# -------------------------------------------------
0.19/0.51	# User time                : 0.033 s
0.19/0.51	# System time              : 0.002 s
0.19/0.51	# Total time               : 0.034 s
0.19/0.51	# Maximum resident set size: 1888 pages
0.19/0.51	% E exiting
0.19/0.51	% E exiting
0.19/0.51	EOF