%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM836+1 : TPTP v9.3.1. Released v4.1.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:50:46 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 18 unt; 0 def)
% Number of atoms : 42 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 22 ~; 9 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 7 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(73, 0), 0)',axiom,
! [X14,X15] : X15 != vplus(X14,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).
fof('dis(ex(cond(conseq(131), 0), 1))',conjecture,
( ~ less(vd203,vd204)
| ~ greater(vd203,vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dis(ex(cond(conseq(131), 0), 1))') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X21,X22,X23] : vplus(vplus(X21,X22),X23) = vplus(X21,vplus(X22,X23)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X16,X17] : vplus(X17,X16) = vplus(X16,X17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [X1,X2] :
( less(X2,X1)
<=> ? [X3] : X1 = vplus(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X4,X5] :
( greater(X5,X4)
<=> ? [X6] : X5 = vplus(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(c_0_6,plain,
! [X14,X15] : X15 != vplus(X14,X15),
inference(fof_simplification,[status(thm)],['ass(cond(73, 0), 0)']) ).
fof(c_0_7,negated_conjecture,
~ ( ~ less(vd203,vd204)
| ~ greater(vd203,vd204) ),
inference(assume_negation,[status(cth)],['dis(ex(cond(conseq(131), 0), 1))']) ).
fof(c_0_8,plain,
! [X62,X63] : X63 != vplus(X62,X63),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_9,plain,
! [X69,X70,X71] : vplus(vplus(X69,X70),X71) = vplus(X69,vplus(X70,X71)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_10,negated_conjecture,
~ ( ~ less(vd203,vd204)
| ~ greater(vd203,vd204) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
X1 != vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X64,X65] : vplus(X65,X64) = vplus(X64,X65),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_14,plain,
! [X33,X34,X36,X37,X38] :
( ( less(X37,X36)
| X36 != vplus(X37,X38) )
& ( X33 = vplus(X34,esk1_2(X33,X34))
| ~ less(X34,X33) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)'])])])])])]) ).
fof(c_0_15,negated_conjecture,
( less(vd203,vd204)
& greater(vd203,vd204) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ less(X1,X2)
| X2 = vplus(X1,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
less(vd203,vd204),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
vplus(vd203,esk1_2(vd204,vd203)) = vd204,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
! [X39,X40,X42,X43,X44] :
( ( greater(X43,X42)
| X43 != vplus(X42,X44) )
& ( X40 = vplus(X39,esk2_2(X39,X40))
| ~ greater(X40,X39) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_23,negated_conjecture,
vplus(X1,vd204) != vd203,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
greater(vd203,vd204),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
vplus(vd204,X1) != vd203,
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM836+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 03:12:13 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 708866 completed with status 0
% 0.10/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGHSM-FFSF21-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.43 % new_bool_1 with pid 708874 completed with status 0
% 0.10/0.43 % Result found by new_bool_1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGHSM-FFSF21-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43 % Presaturation interreduction done
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 20
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 24
% 0.10/0.43 % Removed in clause preprocessing : 1
% 0.10/0.43 % Initial clauses in saturation : 23
% 0.10/0.43 % Processed clauses : 83
% 0.10/0.43 % ...of these trivial : 3
% 0.10/0.43 % ...subsumed : 23
% 0.10/0.43 % ...remaining for further processing : 57
% 0.10/0.43 % Other redundant clauses eliminated : 7
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 3
% 0.10/0.43 % Backward-rewritten : 2
% 0.10/0.43 % Generated clauses : 121
% 0.10/0.43 % ...of the previous two non-redundant : 111
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 112
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 9
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 29
% 0.10/0.43 % ...of those cached : 14
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 32
% 0.10/0.43 % Positive orientable unit clauses : 9
% 0.10/0.43 % Positive unorientable unit clauses: 1
% 0.10/0.43 % Negative unit clauses : 11
% 0.10/0.43 % Non-unit-clauses : 11
% 0.10/0.43 % Current number of unprocessed clauses: 64
% 0.10/0.43 % ...number of literals in the above : 90
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 21
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 20
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 20
% 0.10/0.43 % Non-unit clause-clause subsumptions : 3
% 0.10/0.43 % Unit Clause-clause subsumption calls : 17
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 23
% 0.10/0.43 % BW rewrite match successes : 23
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 1846
% 0.10/0.43 % Search garbage collected termcells : 263
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.005 s
% 0.10/0.43 % System time : 0.001 s
% 0.10/0.43 % Total time : 0.006 s
% 0.10/0.43 % Maximum resident set size: 3656 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.020 s
% 0.10/0.43 % System time : 0.010 s
% 0.10/0.43 % Total time : 0.029 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------