%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM848+2 : 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 : n010.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:50 PM UTC 2026
% Result : Theorem 0.16s 5.66s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 0 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(286, 441, 4)',conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) = vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(286, 441, 4)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X10,X11,X12] : vplus(vplus(X10,X11),X12) = vplus(X10,vplus(X11,X12)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X5,X6] : vplus(X6,X5) = vplus(X5,X6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
! [X1,X2] :
( vmul(X1,v1) = X1
& vmul(X1,vsucc(X2)) = vplus(vmul(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).
fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
! [X13,X14] :
( vplus(X13,v1) = vsucc(X13)
& vplus(X13,vsucc(X14)) = vsucc(vplus(X13,X14)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof('holds(285, 440, 0)',axiom,
vmul(vd436,vplus(vd437,vd439)) = vplus(vmul(vd436,vd437),vmul(vd436,vd439)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(285, 440, 0)') ).
fof(c_0_6,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(assume_negation,[status(cth)],['holds(286, 441, 4)']) ).
fof(c_0_7,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X18,X19,X20] : vplus(vplus(X18,X19),X20) = vplus(X18,vplus(X19,X20)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_9,plain,
! [X16,X17] : vplus(X17,X16) = vplus(X16,X17),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_10,plain,
! [X21,X22] :
( vmul(X21,v1) = X21
& vmul(X21,vsucc(X22)) = vplus(vmul(X21,X22),X21) ),
inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))']) ).
fof(c_0_11,plain,
! [X26,X27] :
( vplus(X26,v1) = vsucc(X26)
& vplus(X26,vsucc(X27)) = vsucc(vplus(X26,X27)) ),
inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))']) ).
fof(c_0_12,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
vmul(X1,vsucc(X2)) = vplus(vmul(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
cnf(c_0_19,plain,
vmul(vd436,vplus(vd437,vd439)) = vplus(vmul(vd436,vd437),vmul(vd436,vd439)),
inference(split_conjunct,[status(thm)],['holds(285, 440, 0)']) ).
cnf(c_0_20,plain,
vmul(X1,vplus(X2,v1)) = vplus(X1,vmul(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14]),c_0_18]),c_0_19]),c_0_16]),c_0_20]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM848+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.59 % Computer : n010.cluster.edu
% 0.10/5.59 % Model : x86_64 x86_64
% 0.10/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.59 % Memory : 8046.5625MB
% 0.10/5.59 % OS : Linux 6.8.0-71-generic
% 0.10/5.59 % CPULimit : 300
% 0.10/5.59 % WCLimit : 300
% 0.10/5.59 % DateTime : Mon Sep 21 03:13:46 UTC 2026
% 0.10/5.59 % CPUTime :
% 0.10/5.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.63 Running first-order theorem proving
% 0.16/5.64 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/5.66 % Version: 3.5.1
% 0.16/5.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.66 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.66 % Starting sh5l with 300s (1) cores
% 0.16/5.66 % new_bool_3 with pid 4107236 completed with status 0
% 0.16/5.66 % Result found by new_bool_3
% 0.16/5.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.66 % Search class: FUUPM-FFSM21-MFFFFFNN
% 0.16/5.66 % partial match(1): FUUPM-FFSF21-MFFFFFNN
% 0.16/5.66 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.66 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.66 % SubtermCWHack with pid 4107239 completed with status 0
% 0.16/5.66 % Result found by SubtermCWHack
% 0.16/5.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.66 % Search class: FUUPM-FFSM21-MFFFFFNN
% 0.16/5.66 % partial match(1): FUUPM-FFSF21-MFFFFFNN
% 0.16/5.66 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.66 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.66 % Preprocessing time : 0.001 s
% 0.16/5.66
% 0.16/5.66 % Proof found!
% 0.16/5.66 % SZS status Theorem
% 0.16/5.66 % SZS output start CNFRefutation
% See solution above
% 0.16/5.66 % Parsed axioms : 16
% 0.16/5.66 % Removed by relevancy pruning/SinE : 2
% 0.16/5.66 % Initial clauses : 16
% 0.16/5.66 % Removed in clause preprocessing : 0
% 0.16/5.66 % Initial clauses in saturation : 16
% 0.16/5.66 % Processed clauses : 88
% 0.16/5.66 % ...of these trivial : 7
% 0.16/5.66 % ...subsumed : 62
% 0.16/5.66 % ...remaining for further processing : 18
% 0.16/5.66 % Other redundant clauses eliminated : 0
% 0.16/5.66 % Clauses deleted for lack of memory : 0
% 0.16/5.66 % Backward-subsumed : 1
% 0.16/5.66 % Backward-rewritten : 1
% 0.16/5.66 % Generated clauses : 371
% 0.16/5.66 % ...of the previous two non-redundant : 362
% 0.16/5.66 % ...aggressively subsumed : 0
% 0.16/5.66 % Contextual simplify-reflections : 0
% 0.16/5.66 % Paramodulations : 371
% 0.16/5.66 % Factorizations : 0
% 0.16/5.66 % NegExts : 0
% 0.16/5.66 % Equation resolutions : 0
% 0.16/5.66 % Disequality decompositions : 0
% 0.16/5.66 % Total rewrite steps : 189
% 0.16/5.66 % ...of those cached : 114
% 0.16/5.66 % Propositional unsat checks : 0
% 0.16/5.66 % Propositional check models : 0
% 0.16/5.66 % Propositional check unsatisfiable : 0
% 0.16/5.66 % Propositional clauses : 0
% 0.16/5.66 % Propositional clauses after purity: 0
% 0.16/5.66 % Propositional unsat core size : 0
% 0.16/5.66 % Propositional preprocessing time : 0.000
% 0.16/5.66 % Propositional encoding time : 0.000
% 0.16/5.66 % Propositional solver time : 0.000
% 0.16/5.66 % Success case prop preproc time : 0.000
% 0.16/5.66 % Success case prop encoding time : 0.000
% 0.16/5.66 % Success case prop solver time : 0.000
% 0.16/5.66 % Current number of processed clauses : 16
% 0.16/5.66 % Positive orientable unit clauses : 5
% 0.16/5.66 % Positive unorientable unit clauses: 11
% 0.16/5.66 % Negative unit clauses : 0
% 0.16/5.66 % Non-unit-clauses : 0
% 0.16/5.66 % Current number of unprocessed clauses: 290
% 0.16/5.66 % ...number of literals in the above : 290
% 0.16/5.66 % Current number of archived formulas : 0
% 0.16/5.66 % Current number of archived clauses : 2
% 0.16/5.66 % Clause-clause subsumption calls (NU) : 0
% 0.16/5.66 % Rec. Clause-clause subsumption calls : 0
% 0.16/5.66 % Non-unit clause-clause subsumptions : 0
% 0.16/5.66 % Unit Clause-clause subsumption calls : 14
% 0.16/5.66 % Rewrite failures with RHS unbound : 0
% 0.16/5.66 % BW rewrite match attempts : 57
% 0.16/5.66 % BW rewrite match successes : 29
% 0.16/5.66 % Condensation attempts : 0
% 0.16/5.66 % Condensation successes : 0
% 0.16/5.66 % Termbank termtop insertions : 4314
% 0.16/5.66 % Search garbage collected termcells : 14
% 0.16/5.66
% 0.16/5.66 % -------------------------------------------------
% 0.16/5.66 % User time : 0.007 s
% 0.16/5.66 % System time : 0.001 s
% 0.16/5.66 % Total time : 0.008 s
% 0.16/5.66 % Maximum resident set size: 3644 pages
% 0.16/5.66
% 0.16/5.66 % -------------------------------------------------
% 0.16/5.66 % User time : 0.010 s
% 0.16/5.66 % System time : 0.005 s
% 0.16/5.66 % Total time : 0.014 s
% 0.16/5.66 % Maximum resident set size: 4864 pages
% 0.16/5.66 % E exiting
%------------------------------------------------------------------------------