%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL899+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 : n026.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.14s 0.65s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 34 unt; 0 def)
% Number of atoms : 63 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 12 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 9 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_12,axiom,
! [X1] : '+'(X1,'1') = '1',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(goals_14,conjecture,
! [X21] : '==>'('==>'(X21,'1'),'1') = X21,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X8,X7)
& '>='(X7,X8) )
=> X7 = X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_13,axiom,
! [X1,X2] : '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(c_0_10,plain,
! [X50] : '+'(X50,'0') = X50,
inference(variable_rename,[status(thm)],[sos_03]) ).
fof(c_0_11,plain,
! [X48,X49] : '+'(X48,X49) = '+'(X49,X48),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_12,plain,
! [X42,X43,X44] :
( '>='('+'(X42,X44),'+'(X43,X44))
| ~ '>='(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])]) ).
cnf(c_0_13,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X41] : '>='(X41,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
fof(c_0_16,plain,
! [X34] : '+'(X34,'1') = '1',
inference(variable_rename,[status(thm)],[sos_12]) ).
cnf(c_0_17,plain,
( ~ '>='(X1,X2)
| '>='('+'(X1,X3),'+'(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
'+'(X1,'1') = '1',
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,negated_conjecture,
~ ! [X21] : '==>'('==>'(X21,'1'),'1') = X21,
inference(assume_negation,[status(cth)],[goals_14]) ).
fof(c_0_22,plain,
! [X39,X40] :
( X39 = X40
| ~ '>='(X40,X39)
| ~ '>='(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])]) ).
fof(c_0_23,plain,
! [X23,X24,X25] :
( ( '>='('+'(X23,X24),X25)
| ~ '>='(X24,'==>'(X23,X25)) )
& ( '>='(X24,'==>'(X23,X25))
| ~ '>='('+'(X23,X24),X25) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_24,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,plain,
'+'('1',X1) = '1',
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
fof(c_0_26,negated_conjecture,
'==>'('==>'(esk1_0,'1'),'1') != esk1_0,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_27,plain,
! [X32,X33] : '==>'('==>'(X32,X33),X33) = '==>'('==>'(X33,X32),X32),
inference(variable_rename,[status(thm)],[sos_13]) ).
cnf(c_0_28,plain,
( ~ '>='(X2,X1)
| ~ '>='(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ '>='('+'(X1,X2),X3)
| '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
'>='('1',X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ '>='(X1,'==>'(X2,X3))
| '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_32,plain,
! [X35] : '>='(X35,X35),
inference(variable_rename,[status(thm)],[sos_04]) ).
cnf(c_0_33,negated_conjecture,
'==>'('==>'(esk1_0,'1'),'1') != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( ~ '>='('0',X1)
| '0' = X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_36,plain,
'>='(X1,'==>'('1',X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30])]) ).
cnf(c_0_37,plain,
( ~ '>='(X1,'==>'('0',X2))
| '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_38,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
'==>'('==>'('1',esk1_0),esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
'==>'('1',X1) = '0',
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_43,negated_conjecture,
'==>'('0',esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
'==>'('0',X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_41]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL899+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.09/0.57 % Computer : n026.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Mon Sep 21 01:13:08 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.62 Running first-order theorem proving
% 0.09/0.62 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.14/0.65 % Version: 3.5.1
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % sh5l with pid 1041016 completed with status 0
% 0.14/0.65 % Result found by sh5l
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.65 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.14/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.65 % SubtermCWHack with pid 1041023 completed with status 0
% 0.14/0.65 % Result found by SubtermCWHack
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.65 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.14/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.65 % Preprocessing time : 0.001 s
% 0.14/0.65
% 0.14/0.65 % Proof found!
% 0.14/0.65 % SZS status Theorem
% 0.14/0.65 % SZS output start CNFRefutation
% See solution above
% 0.14/0.65 % Parsed axioms : 14
% 0.14/0.65 % Removed by relevancy pruning/SinE : 0
% 0.14/0.65 % Initial clauses : 15
% 0.14/0.65 % Removed in clause preprocessing : 0
% 0.14/0.65 % Initial clauses in saturation : 15
% 0.14/0.65 % Processed clauses : 142
% 0.14/0.65 % ...of these trivial : 17
% 0.14/0.65 % ...subsumed : 51
% 0.14/0.65 % ...remaining for further processing : 74
% 0.14/0.65 % Other redundant clauses eliminated : 0
% 0.14/0.65 % Clauses deleted for lack of memory : 0
% 0.14/0.65 % Backward-subsumed : 4
% 0.14/0.65 % Backward-rewritten : 12
% 0.14/0.65 % Generated clauses : 808
% 0.14/0.65 % ...of the previous two non-redundant : 464
% 0.14/0.65 % ...aggressively subsumed : 0
% 0.14/0.65 % Contextual simplify-reflections : 0
% 0.14/0.65 % Paramodulations : 808
% 0.14/0.65 % Factorizations : 0
% 0.14/0.65 % NegExts : 0
% 0.14/0.65 % Equation resolutions : 0
% 0.14/0.65 % Disequality decompositions : 0
% 0.14/0.65 % Total rewrite steps : 508
% 0.14/0.65 % ...of those cached : 408
% 0.14/0.65 % Propositional unsat checks : 0
% 0.14/0.65 % Propositional check models : 0
% 0.14/0.65 % Propositional check unsatisfiable : 0
% 0.14/0.65 % Propositional clauses : 0
% 0.14/0.65 % Propositional clauses after purity: 0
% 0.14/0.65 % Propositional unsat core size : 0
% 0.14/0.65 % Propositional preprocessing time : 0.000
% 0.14/0.65 % Propositional encoding time : 0.000
% 0.14/0.65 % Propositional solver time : 0.000
% 0.14/0.65 % Success case prop preproc time : 0.000
% 0.14/0.65 % Success case prop encoding time : 0.000
% 0.14/0.65 % Success case prop solver time : 0.000
% 0.14/0.65 % Current number of processed clauses : 58
% 0.14/0.65 % Positive orientable unit clauses : 24
% 0.14/0.65 % Positive unorientable unit clauses: 2
% 0.14/0.65 % Negative unit clauses : 0
% 0.14/0.65 % Non-unit-clauses : 32
% 0.14/0.65 % Current number of unprocessed clauses: 329
% 0.14/0.65 % ...number of literals in the above : 731
% 0.14/0.65 % Current number of archived formulas : 0
% 0.14/0.65 % Current number of archived clauses : 16
% 0.14/0.65 % Clause-clause subsumption calls (NU) : 353
% 0.14/0.65 % Rec. Clause-clause subsumption calls : 343
% 0.14/0.65 % Non-unit clause-clause subsumptions : 55
% 0.14/0.65 % Unit Clause-clause subsumption calls : 16
% 0.14/0.65 % Rewrite failures with RHS unbound : 0
% 0.14/0.65 % BW rewrite match attempts : 45
% 0.14/0.65 % BW rewrite match successes : 16
% 0.14/0.65 % Condensation attempts : 0
% 0.14/0.65 % Condensation successes : 0
% 0.14/0.65 % Termbank termtop insertions : 6267
% 0.14/0.65 % Search garbage collected termcells : 112
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.012 s
% 0.14/0.65 % System time : 0.002 s
% 0.14/0.65 % Total time : 0.015 s
% 0.14/0.65 % Maximum resident set size: 3648 pages
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.015 s
% 0.14/0.65 % System time : 0.006 s
% 0.14/0.65 % Total time : 0.021 s
% 0.14/0.65 % Maximum resident set size: 4608 pages
% 0.14/0.65 % E exiting
%------------------------------------------------------------------------------