%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:24:06 PM UTC 2026
% Result : Theorem 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 17 unt; 0 def)
% Number of atoms : 42 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 11 ~; 8 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 1 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals_15,conjecture,
! [X21] :
( h(X21) = X21
=> X21 = '0' ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).
fof(sos_14,axiom,
! [X1] : h(X1) = '==>'(h(X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(sos_08,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_05,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(sos_07,axiom,
! [X7,X8] :
( ( '>='(X8,X7)
& '>='(X7,X8) )
=> X7 = X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_09,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(c_0_7,negated_conjecture,
~ ! [X21] :
( h(X21) = X21
=> X21 = '0' ),
inference(assume_negation,[status(cth)],[goals_15]) ).
fof(c_0_8,plain,
! [X50] : h(X50) = '==>'(h(X50),X50),
inference(variable_rename,[status(thm)],[sos_14]) ).
fof(c_0_9,negated_conjecture,
( esk1_0 != '0'
& h(esk1_0) = esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X35,X36,X37] :
( ( '>='('+'(X35,X36),X37)
| ~ '>='(X36,'==>'(X35,X37)) )
& ( '>='(X36,'==>'(X35,X37))
| ~ '>='('+'(X35,X36),X37) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
cnf(c_0_11,plain,
h(X1) = '==>'(h(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
h(esk1_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ '>='('+'(X1,X2),X3)
| '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
'==>'(esk1_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X27] : '+'(X27,'0') = X27,
inference(variable_rename,[status(thm)],[sos_03]) ).
fof(c_0_16,plain,
! [X29] : '>='(X29,X29),
inference(variable_rename,[status(thm)],[sos_05]) ).
fof(c_0_17,plain,
! [X33,X34] :
( X33 = X34
| ~ '>='(X34,X33)
| ~ '>='(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ '>='('+'(esk1_0,X1),esk1_0)
| '>='(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X38] : '>='(X38,'0'),
inference(variable_rename,[status(thm)],[sos_09]) ).
cnf(c_0_22,plain,
( ~ '>='(X2,X1)
| ~ '>='(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
'>='('0',esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 != '0',
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 01:10:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.46 Running first-order theorem proving
% 0.16/0.47 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=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.50 % Version: 3.5.1
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 % Starting sh5l with 300s (1) cores
% 0.16/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 523111 completed with status 0
% 0.16/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.50 % No SInE strategy applied
% 0.16/0.50 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.16/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 136s (1) cores
% 0.16/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 523117 completed with status 0
% 0.16/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.50 % No SInE strategy applied
% 0.16/0.50 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.16/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 % Preprocessing time : 0.001 s
% 0.16/0.50 % Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 % Proof found!
% 0.16/0.50 % SZS status Theorem
% 0.16/0.50 % SZS output start CNFRefutation
% See solution above
% 0.16/0.50 % Parsed axioms : 15
% 0.16/0.50 % Removed by relevancy pruning/SinE : 0
% 0.16/0.50 % Initial clauses : 17
% 0.16/0.50 % Removed in clause preprocessing : 0
% 0.16/0.50 % Initial clauses in saturation : 17
% 0.16/0.50 % Processed clauses : 40
% 0.16/0.50 % ...of these trivial : 2
% 0.16/0.50 % ...subsumed : 0
% 0.16/0.50 % ...remaining for further processing : 38
% 0.16/0.50 % Other redundant clauses eliminated : 0
% 0.16/0.50 % Clauses deleted for lack of memory : 0
% 0.16/0.50 % Backward-subsumed : 0
% 0.16/0.50 % Backward-rewritten : 0
% 0.16/0.50 % Generated clauses : 73
% 0.16/0.50 % ...of the previous two non-redundant : 51
% 0.16/0.50 % ...aggressively subsumed : 0
% 0.16/0.50 % Contextual simplify-reflections : 0
% 0.16/0.50 % Paramodulations : 73
% 0.16/0.50 % Factorizations : 0
% 0.16/0.50 % NegExts : 0
% 0.16/0.50 % Equation resolutions : 0
% 0.16/0.50 % Disequality decompositions : 0
% 0.16/0.50 % Total rewrite steps : 34
% 0.16/0.50 % ...of those cached : 14
% 0.16/0.50 % Propositional unsat checks : 0
% 0.16/0.50 % Propositional check models : 0
% 0.16/0.50 % Propositional check unsatisfiable : 0
% 0.16/0.50 % Propositional clauses : 0
% 0.16/0.50 % Propositional clauses after purity: 0
% 0.16/0.50 % Propositional unsat core size : 0
% 0.16/0.50 % Propositional preprocessing time : 0.000
% 0.16/0.50 % Propositional encoding time : 0.000
% 0.16/0.50 % Propositional solver time : 0.000
% 0.16/0.50 % Success case prop preproc time : 0.000
% 0.16/0.50 % Success case prop encoding time : 0.000
% 0.16/0.50 % Success case prop solver time : 0.000
% 0.16/0.50 % Current number of processed clauses : 21
% 0.16/0.50 % Positive orientable unit clauses : 11
% 0.16/0.50 % Positive unorientable unit clauses: 2
% 0.16/0.50 % Negative unit clauses : 1
% 0.16/0.50 % Non-unit-clauses : 7
% 0.16/0.50 % Current number of unprocessed clauses: 44
% 0.16/0.50 % ...number of literals in the above : 75
% 0.16/0.50 % Current number of archived formulas : 0
% 0.16/0.50 % Current number of archived clauses : 17
% 0.16/0.50 % Clause-clause subsumption calls (NU) : 4
% 0.16/0.50 % Rec. Clause-clause subsumption calls : 4
% 0.16/0.50 % Non-unit clause-clause subsumptions : 0
% 0.16/0.50 % Unit Clause-clause subsumption calls : 0
% 0.16/0.50 % Rewrite failures with RHS unbound : 0
% 0.16/0.50 % BW rewrite match attempts : 11
% 0.16/0.50 % BW rewrite match successes : 10
% 0.16/0.50 % Condensation attempts : 0
% 0.16/0.50 % Condensation successes : 0
% 0.16/0.50 % Termbank termtop insertions : 1531
% 0.16/0.50 % Search garbage collected termcells : 123
% 0.16/0.50
% 0.16/0.50 % -------------------------------------------------
% 0.16/0.50 % User time : 0.006 s
% 0.16/0.50 % System time : 0.005 s
% 0.16/0.50 % Total time : 0.011 s
% 0.16/0.50 % Maximum resident set size: 3648 pages
% 0.16/0.50
% 0.16/0.50 % -------------------------------------------------
% 0.16/0.50 % User time : 0.023 s
% 0.16/0.50 % System time : 0.018 s
% 0.16/0.50 % Total time : 0.041 s
% 0.16/0.50 % Maximum resident set size: 4864 pages
% 0.16/0.50 % E exiting
%------------------------------------------------------------------------------