%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV161+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 : n017.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:51 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 63 ( 21 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 56 ( 16 ~; 12 |; 19 &)
% ( 1 <=>; 8 =>; 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 : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 23 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0011,conjecture,
( ( ! [X14] :
( ( leq(X14,pred(pv10))
& leq(n0,X14) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 )
=> ! [X18] :
( ( leq(X18,pv10)
& leq(n0,X18) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0011) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(succ_pred,axiom,
! [X1] : succ(pred(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_pred) ).
fof(c_0_4,negated_conjecture,
~ ( ( ! [X14] :
( ( leq(X14,pred(pv10))
& leq(n0,X14) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 )
=> ! [X18] :
( ( leq(X18,pv10)
& leq(n0,X18) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0011]) ).
fof(c_0_5,plain,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[leq_gt2]) ).
fof(c_0_6,negated_conjecture,
! [X28] :
( sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1
& leq(esk1_0,pv10)
& leq(n0,esk1_0)
& ( sum(n0,n4,a_select3(q,X28,tptp_sum_index)) = n1
| ~ leq(X28,pred(pv10))
| ~ leq(n0,X28) )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_7,plain,
! [X45,X46] :
( gt(X46,X45)
| X45 = X46
| ~ leq(X45,X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X49,X50] :
( ( leq(X49,X50)
| ~ gt(succ(X50),X49) )
& ( gt(succ(X50),X49)
| ~ leq(X49,X50) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])]) ).
fof(c_0_12,plain,
! [X58] : succ(pred(X58)) = X58,
inference(variable_rename,[status(thm)],[succ_pred]) ).
cnf(c_0_13,plain,
( ~ leq(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
leq(esk1_0,pv10),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
~ leq(esk1_0,pred(pv10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_16,plain,
( ~ gt(succ(X1),X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
succ(pred(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( gt(pv10,esk1_0)
| esk1_0 = pv10 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ gt(pv10,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = pv10,
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV161+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:28:57 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.17/0.46 % Version: 3.5.1
% 0.17/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 % Starting sh5l with 300s (1) cores
% 0.17/0.46 % new_bool_3 with pid 1899884 completed with status 0
% 0.17/0.46 % Result found by new_bool_3
% 0.17/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.17/0.46 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.17/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.46 % SubtermCWHack with pid 1899889 completed with status 0
% 0.17/0.46 % Result found by SubtermCWHack
% 0.17/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.17/0.46 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.17/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.46 % Preprocessing time : 0.002 s
% 0.17/0.46
% 0.17/0.46 % Proof found!
% 0.17/0.46 % SZS status Theorem
% 0.17/0.46 % SZS output start CNFRefutation
% See solution above
% 0.17/0.46 % Parsed axioms : 92
% 0.17/0.46 % Removed by relevancy pruning/SinE : 25
% 0.17/0.46 % Initial clauses : 76
% 0.17/0.46 % Removed in clause preprocessing : 0
% 0.17/0.46 % Initial clauses in saturation : 76
% 0.17/0.46 % Processed clauses : 324
% 0.17/0.46 % ...of these trivial : 0
% 0.17/0.46 % ...subsumed : 116
% 0.17/0.46 % ...remaining for further processing : 208
% 0.17/0.46 % Other redundant clauses eliminated : 0
% 0.17/0.46 % Clauses deleted for lack of memory : 0
% 0.17/0.46 % Backward-subsumed : 1
% 0.17/0.46 % Backward-rewritten : 12
% 0.17/0.46 % Generated clauses : 759
% 0.17/0.46 % ...of the previous two non-redundant : 504
% 0.17/0.46 % ...aggressively subsumed : 0
% 0.17/0.46 % Contextual simplify-reflections : 0
% 0.17/0.46 % Paramodulations : 756
% 0.17/0.46 % Factorizations : 2
% 0.17/0.46 % NegExts : 0
% 0.17/0.46 % Equation resolutions : 0
% 0.17/0.46 % Disequality decompositions : 0
% 0.17/0.46 % Total rewrite steps : 362
% 0.17/0.46 % ...of those cached : 306
% 0.17/0.46 % Propositional unsat checks : 0
% 0.17/0.46 % Propositional check models : 0
% 0.17/0.46 % Propositional check unsatisfiable : 0
% 0.17/0.46 % Propositional clauses : 0
% 0.17/0.46 % Propositional clauses after purity: 0
% 0.17/0.46 % Propositional unsat core size : 0
% 0.17/0.46 % Propositional preprocessing time : 0.000
% 0.17/0.46 % Propositional encoding time : 0.000
% 0.17/0.46 % Propositional solver time : 0.000
% 0.17/0.46 % Success case prop preproc time : 0.000
% 0.17/0.46 % Success case prop encoding time : 0.000
% 0.17/0.46 % Success case prop solver time : 0.000
% 0.17/0.46 % Current number of processed clauses : 194
% 0.17/0.46 % Positive orientable unit clauses : 82
% 0.17/0.46 % Positive unorientable unit clauses: 0
% 0.17/0.46 % Negative unit clauses : 29
% 0.17/0.46 % Non-unit-clauses : 83
% 0.17/0.46 % Current number of unprocessed clauses: 252
% 0.17/0.46 % ...number of literals in the above : 671
% 0.17/0.46 % Current number of archived formulas : 0
% 0.17/0.46 % Current number of archived clauses : 14
% 0.17/0.46 % Clause-clause subsumption calls (NU) : 350
% 0.17/0.46 % Rec. Clause-clause subsumption calls : 294
% 0.17/0.46 % Non-unit clause-clause subsumptions : 27
% 0.17/0.46 % Unit Clause-clause subsumption calls : 550
% 0.17/0.46 % Rewrite failures with RHS unbound : 0
% 0.17/0.46 % BW rewrite match attempts : 6
% 0.17/0.46 % BW rewrite match successes : 2
% 0.17/0.46 % Condensation attempts : 0
% 0.17/0.46 % Condensation successes : 0
% 0.17/0.46 % Termbank termtop insertions : 9817
% 0.17/0.46 % Search garbage collected termcells : 668
% 0.17/0.46
% 0.17/0.46 % -------------------------------------------------
% 0.17/0.46 % User time : 0.014 s
% 0.17/0.46 % System time : 0.001 s
% 0.17/0.46 % Total time : 0.015 s
% 0.17/0.46 % Maximum resident set size: 3744 pages
% 0.17/0.46
% 0.17/0.46 % -------------------------------------------------
% 0.17/0.46 % User time : 0.015 s
% 0.17/0.46 % System time : 0.008 s
% 0.17/0.46 % Total time : 0.023 s
% 0.17/0.46 % Maximum resident set size: 4864 pages
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------