%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV056+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 02:53:36 PM UTC 2026
% Result : Theorem 0.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 32 unt; 0 def)
% Number of atoms : 50 ( 31 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 21 ( 7 ~; 4 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 10 con; 0-3 aty)
% Number of variables : 9 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_3) ).
fof(cl5_nebula_norm_0040,conjecture,
( ( leq(pv25,minus(n5,n1))
& leq(n0,pv25) )
=> ( leq(pv25,minus(n5,n1))
& leq(n0,pv25)
& n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0040) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_4) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
cnf(c_0_10,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_11,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_12,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_13,plain,
succ(n1) = n2,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ( ( leq(pv25,minus(n5,n1))
& leq(n0,pv25) )
=> ( leq(pv25,minus(n5,n1))
& leq(n0,pv25)
& n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0040]) ).
cnf(c_0_15,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_16,plain,
succ(n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_13]) ).
fof(c_0_17,negated_conjecture,
( ( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) )
& leq(pv25,minus(n5,n1))
& leq(n0,pv25) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
fof(c_0_18,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_19,plain,
! [X65] : pred(succ(X65)) = X65,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_20,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_21,plain,
succ(n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_13]),c_0_16]) ).
cnf(c_0_22,negated_conjecture,
leq(pv25,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
succ(n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_11]),c_0_13]),c_0_16]),c_0_21]) ).
cnf(c_0_26,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_27,plain,
! [X55] : sum(n0,tptp_minus_1,X55) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_28,negated_conjecture,
leq(pv25,pred(n5)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
pred(n5) = n4,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
pred(n0) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_32,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
leq(n0,pv25),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,negated_conjecture,
leq(pv25,n4),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,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_30,c_0_23]),c_0_31]),c_0_32]),c_0_33]),c_0_23]),c_0_29]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV056+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 08:28:51 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % new_bool_3 with pid 1987153 completed with status 0
% 0.07/0.34 % Result found by new_bool_3
% 0.07/0.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1987156 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Theorem
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.34 % Parsed axioms : 85
% 0.07/0.34 % Removed by relevancy pruning/SinE : 23
% 0.07/0.34 % Initial clauses : 67
% 0.07/0.34 % Removed in clause preprocessing : 0
% 0.07/0.34 % Initial clauses in saturation : 67
% 0.07/0.34 % Processed clauses : 319
% 0.07/0.34 % ...of these trivial : 6
% 0.07/0.34 % ...subsumed : 126
% 0.07/0.34 % ...remaining for further processing : 186
% 0.07/0.34 % Other redundant clauses eliminated : 0
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 0
% 0.07/0.34 % Backward-rewritten : 9
% 0.07/0.34 % Generated clauses : 636
% 0.07/0.34 % ...of the previous two non-redundant : 470
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 0
% 0.07/0.34 % Paramodulations : 634
% 0.07/0.34 % Factorizations : 2
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 0
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 415
% 0.07/0.34 % ...of those cached : 347
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 177
% 0.07/0.34 % Positive orientable unit clauses : 88
% 0.07/0.34 % Positive unorientable unit clauses: 0
% 0.07/0.34 % Negative unit clauses : 53
% 0.07/0.34 % Non-unit-clauses : 36
% 0.07/0.34 % Current number of unprocessed clauses: 218
% 0.07/0.34 % ...number of literals in the above : 509
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 9
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 96
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 44
% 0.07/0.34 % Non-unit clause-clause subsumptions : 5
% 0.07/0.34 % Unit Clause-clause subsumption calls : 704
% 0.07/0.34 % Rewrite failures with RHS unbound : 0
% 0.07/0.34 % BW rewrite match attempts : 4
% 0.07/0.34 % BW rewrite match successes : 3
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 8507
% 0.07/0.34 % Search garbage collected termcells : 582
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.007 s
% 0.07/0.34 % System time : 0.002 s
% 0.07/0.34 % Total time : 0.010 s
% 0.07/0.34 % Maximum resident set size: 3736 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.009 s
% 0.07/0.34 % System time : 0.005 s
% 0.07/0.34 % Total time : 0.014 s
% 0.07/0.34 % Maximum resident set size: 4864 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------