%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV048+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:35 PM UTC 2026
% Result : Theorem 0.55s 0.62s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 37 unt; 0 def)
% Number of atoms : 91 ( 59 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 72 ( 24 ~; 15 |; 24 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 14 con; 0-3 aty)
% Number of variables : 10 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_3) ).
fof(cl5_nebula_norm_0016,conjecture,
( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_5) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).
cnf(c_0_11,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_12,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_13,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_14,plain,
succ(n1) = n2,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0016]) ).
fof(c_0_16,plain,
! [X65] : pred(succ(X65)) = X65,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_17,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_18,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_19,plain,
succ(n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_14]) ).
fof(c_0_20,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_24,plain,
succ(n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_14]),c_0_19]) ).
cnf(c_0_25,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_26,negated_conjecture,
( ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| ~ true )
& ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| n0 = pv78 )
& ( n0 != pv78
| ~ true )
& ( n0 != pv78
| n0 = pv78 )
& leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_27,plain,
minus(succ(X1),n1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
succ(n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_12]),c_0_14]),c_0_19]),c_0_24]) ).
cnf(c_0_29,plain,
pred(n0) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
fof(c_0_30,plain,
! [X55] : sum(n0,tptp_minus_1,X55) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_31,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
minus(n5,n1) = n4,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( n0 != pv78
| ~ true ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_35,negated_conjecture,
( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| n0 = pv78 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
minus(n0,n1) = tptp_minus_1,
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_38,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
leq(n0,pv35),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,negated_conjecture,
leq(pv35,n4),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
pv78 != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[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)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39]),c_0_32]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV048+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n003.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 08:30:16 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.28/0.54 Running first-order theorem proving
% 0.28/0.54 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.55/0.62 % Version: 3.5.1
% 0.55/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.55/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.55/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.55/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.55/0.62 % Starting sh5l with 300s (1) cores
% 0.55/0.62 % new_bool_3 with pid 3858353 completed with status 0
% 0.55/0.62 % Result found by new_bool_3
% 0.55/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.55/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.55/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.55/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.55/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.55/0.62 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.55/0.62 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.55/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.55/0.62 % SubtermCWHack with pid 3858356 completed with status 0
% 0.55/0.62 % Result found by SubtermCWHack
% 0.55/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.55/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.55/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.55/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.55/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.55/0.62 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.55/0.62 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.55/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.55/0.62 % Preprocessing time : 0.003 s
% 0.55/0.62
% 0.55/0.62 % Proof found!
% 0.55/0.62 % SZS status Theorem
% 0.55/0.62 % SZS output start CNFRefutation
% See solution above
% 0.55/0.62 % Parsed axioms : 92
% 0.55/0.62 % Removed by relevancy pruning/SinE : 22
% 0.55/0.62 % Initial clauses : 79
% 0.55/0.62 % Removed in clause preprocessing : 1
% 0.55/0.62 % Initial clauses in saturation : 78
% 0.55/0.62 % Processed clauses : 319
% 0.55/0.62 % ...of these trivial : 0
% 0.55/0.62 % ...subsumed : 114
% 0.55/0.62 % ...remaining for further processing : 204
% 0.55/0.62 % Other redundant clauses eliminated : 0
% 0.55/0.62 % Clauses deleted for lack of memory : 0
% 0.55/0.62 % Backward-subsumed : 1
% 0.55/0.62 % Backward-rewritten : 11
% 0.55/0.62 % Generated clauses : 745
% 0.55/0.62 % ...of the previous two non-redundant : 498
% 0.55/0.62 % ...aggressively subsumed : 0
% 0.55/0.62 % Contextual simplify-reflections : 0
% 0.55/0.62 % Paramodulations : 743
% 0.55/0.62 % Factorizations : 2
% 0.55/0.62 % NegExts : 0
% 0.55/0.62 % Equation resolutions : 0
% 0.55/0.62 % Disequality decompositions : 0
% 0.55/0.62 % Total rewrite steps : 356
% 0.55/0.62 % ...of those cached : 293
% 0.55/0.62 % Propositional unsat checks : 0
% 0.55/0.62 % Propositional check models : 0
% 0.55/0.62 % Propositional check unsatisfiable : 0
% 0.55/0.62 % Propositional clauses : 0
% 0.55/0.62 % Propositional clauses after purity: 0
% 0.55/0.62 % Propositional unsat core size : 0
% 0.55/0.62 % Propositional preprocessing time : 0.000
% 0.55/0.62 % Propositional encoding time : 0.000
% 0.55/0.62 % Propositional solver time : 0.000
% 0.55/0.62 % Success case prop preproc time : 0.000
% 0.55/0.62 % Success case prop encoding time : 0.000
% 0.55/0.62 % Success case prop solver time : 0.000
% 0.55/0.62 % Current number of processed clauses : 192
% 0.55/0.62 % Positive orientable unit clauses : 77
% 0.55/0.62 % Positive unorientable unit clauses: 0
% 0.55/0.62 % Negative unit clauses : 36
% 0.55/0.62 % Non-unit-clauses : 79
% 0.55/0.62 % Current number of unprocessed clauses: 257
% 0.55/0.62 % ...number of literals in the above : 663
% 0.55/0.62 % Current number of archived formulas : 0
% 0.55/0.62 % Current number of archived clauses : 12
% 0.55/0.62 % Clause-clause subsumption calls (NU) : 779
% 0.55/0.62 % Rec. Clause-clause subsumption calls : 685
% 0.55/0.62 % Non-unit clause-clause subsumptions : 18
% 0.55/0.62 % Unit Clause-clause subsumption calls : 349
% 0.55/0.62 % Rewrite failures with RHS unbound : 0
% 0.55/0.62 % BW rewrite match attempts : 8
% 0.55/0.62 % BW rewrite match successes : 7
% 0.55/0.62 % Condensation attempts : 0
% 0.55/0.62 % Condensation successes : 0
% 0.55/0.62 % Termbank termtop insertions : 9815
% 0.55/0.62 % Search garbage collected termcells : 619
% 0.55/0.62
% 0.55/0.62 % -------------------------------------------------
% 0.55/0.62 % User time : 0.026 s
% 0.55/0.62 % System time : 0.006 s
% 0.55/0.62 % Total time : 0.032 s
% 0.55/0.62 % Maximum resident set size: 4000 pages
% 0.55/0.62
% 0.55/0.62 % -------------------------------------------------
% 0.55/0.62 % User time : 0.031 s
% 0.55/0.62 % System time : 0.014 s
% 0.55/0.62 % Total time : 0.045 s
% 0.55/0.62 % Maximum resident set size: 4864 pages
% 0.55/0.62 % E exiting
%------------------------------------------------------------------------------