%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM836+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:56:41 PM UTC 2026
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 43 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 27 ~; 15 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 46 ( 7 sgn 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(88), 0), 2)',axiom,
! [X7,X8] :
( ~ ? [X10] : X8 = vplus(X7,X10)
| ~ ? [X9] : X7 = vplus(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 2)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [X1,X2] :
( less(X2,X1)
<=> ? [X3] : X1 = vplus(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('dis(ex(cond(conseq(131), 0), 1))',conjecture,
( ~ less(vd203,vd204)
| ~ greater(vd203,vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(ex(cond(conseq(131), 0), 1))') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X4,X5] :
( greater(X5,X4)
<=> ? [X6] : X5 = vplus(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(c_0_4,plain,
! [X52,X53,X54,X55] :
( X53 != vplus(X52,X55)
| X52 != vplus(X53,X54) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(88), 0), 2)'])])])]) ).
cnf(c_0_5,plain,
( X2 != vplus(X1,X4)
| X1 != vplus(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,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_7,negated_conjecture,
~ ( ~ less(vd203,vd204)
| ~ greater(vd203,vd204) ),
inference(assume_negation,[status(cth)],['dis(ex(cond(conseq(131), 0), 1))']) ).
cnf(c_0_8,plain,
vplus(vplus(X1,X2),X3) != X1,
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ less(X1,X2)
| X2 = vplus(X1,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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,
~ less(vplus(X1,X2),X1),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]) ).
fof(c_0_12,negated_conjecture,
( less(vd203,vd204)
& greater(vd203,vd204) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( X1 != vplus(X2,X3)
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,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_15,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
less(vd203,vd204),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
less(X1,vplus(X1,X2)),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ less(vd204,vd203),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ greater(X2,X1)
| less(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
greater(vd203,vd204),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM836+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n004.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 03:12:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.41 % Version: 3.5.1
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 % Starting sh5l with 300s (1) cores
% 0.12/0.41 % new_bool_3 with pid 2119077 completed with status 0
% 0.12/0.41 % Result found by new_bool_3
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.41 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.12/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.41 % SubtermCWHack with pid 2119081 completed with status 0
% 0.12/0.41 % Result found by SubtermCWHack
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.41 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.12/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.41 % Preprocessing time : 0.001 s
% 0.12/0.41
% 0.12/0.41 % Proof found!
% 0.12/0.41 % SZS status Theorem
% 0.12/0.41 % SZS output start CNFRefutation
% See solution above
% 0.12/0.41 % Parsed axioms : 20
% 0.12/0.41 % Removed by relevancy pruning/SinE : 8
% 0.12/0.41 % Initial clauses : 15
% 0.12/0.41 % Removed in clause preprocessing : 0
% 0.12/0.41 % Initial clauses in saturation : 15
% 0.12/0.41 % Processed clauses : 60
% 0.12/0.41 % ...of these trivial : 2
% 0.12/0.41 % ...subsumed : 24
% 0.12/0.41 % ...remaining for further processing : 34
% 0.12/0.41 % Other redundant clauses eliminated : 19
% 0.12/0.41 % Clauses deleted for lack of memory : 0
% 0.12/0.41 % Backward-subsumed : 0
% 0.12/0.41 % Backward-rewritten : 2
% 0.12/0.41 % Generated clauses : 133
% 0.12/0.41 % ...of the previous two non-redundant : 107
% 0.12/0.41 % ...aggressively subsumed : 0
% 0.12/0.41 % Contextual simplify-reflections : 0
% 0.12/0.41 % Paramodulations : 113
% 0.12/0.41 % Factorizations : 0
% 0.12/0.41 % NegExts : 0
% 0.12/0.41 % Equation resolutions : 20
% 0.12/0.41 % Disequality decompositions : 0
% 0.12/0.41 % Total rewrite steps : 23
% 0.12/0.41 % ...of those cached : 8
% 0.12/0.41 % Propositional unsat checks : 0
% 0.12/0.41 % Propositional check models : 0
% 0.12/0.41 % Propositional check unsatisfiable : 0
% 0.12/0.41 % Propositional clauses : 0
% 0.12/0.41 % Propositional clauses after purity: 0
% 0.12/0.41 % Propositional unsat core size : 0
% 0.12/0.41 % Propositional preprocessing time : 0.000
% 0.12/0.41 % Propositional encoding time : 0.000
% 0.12/0.41 % Propositional solver time : 0.000
% 0.12/0.41 % Success case prop preproc time : 0.000
% 0.12/0.41 % Success case prop encoding time : 0.000
% 0.12/0.41 % Success case prop solver time : 0.000
% 0.12/0.41 % Current number of processed clauses : 27
% 0.12/0.41 % Positive orientable unit clauses : 8
% 0.12/0.41 % Positive unorientable unit clauses: 1
% 0.12/0.41 % Negative unit clauses : 12
% 0.12/0.41 % Non-unit-clauses : 6
% 0.12/0.41 % Current number of unprocessed clauses: 60
% 0.12/0.41 % ...number of literals in the above : 89
% 0.12/0.41 % Current number of archived formulas : 0
% 0.12/0.41 % Current number of archived clauses : 2
% 0.12/0.41 % Clause-clause subsumption calls (NU) : 1
% 0.12/0.41 % Rec. Clause-clause subsumption calls : 1
% 0.12/0.41 % Non-unit clause-clause subsumptions : 0
% 0.12/0.41 % Unit Clause-clause subsumption calls : 15
% 0.12/0.41 % Rewrite failures with RHS unbound : 0
% 0.12/0.41 % BW rewrite match attempts : 5
% 0.12/0.41 % BW rewrite match successes : 3
% 0.12/0.41 % Condensation attempts : 0
% 0.12/0.41 % Condensation successes : 0
% 0.12/0.41 % Termbank termtop insertions : 1404
% 0.12/0.41 % Search garbage collected termcells : 266
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.006 s
% 0.12/0.41 % System time : 0.001 s
% 0.12/0.41 % Total time : 0.007 s
% 0.12/0.41 % Maximum resident set size: 3656 pages
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.009 s
% 0.12/0.41 % System time : 0.004 s
% 0.12/0.41 % Total time : 0.013 s
% 0.12/0.41 % Maximum resident set size: 4864 pages
% 0.12/0.41 % E exiting
%------------------------------------------------------------------------------