%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV162+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 : n019.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 03:00:42 PM UTC 2026
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 58 ( 17 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 55 ( 16 ~; 11 |; 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 : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0012,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_0012) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
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(c_0_3,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_0012]) ).
fof(c_0_4,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_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,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_4]) ).
cnf(c_0_7,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X106,X107] :
( ( leq(X106,pred(X107))
| ~ gt(X107,X106) )
& ( gt(X107,X106)
| ~ leq(X106,pred(X107)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[leq_gt2]) ).
cnf(c_0_10,negated_conjecture,
~ leq(esk1_0,pred(pv10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_11,plain,
( ~ gt(X1,X2)
| leq(X2,pred(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X96,X97] :
( gt(X97,X96)
| X96 = X97
| ~ leq(X96,X97) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_13,negated_conjecture,
~ gt(pv10,esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ leq(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
leq(esk1_0,pv10),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = pv10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV162+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.07/0.34 % Computer : n019.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 21 08:33:34 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.38 Running first-order theorem proving
% 0.07/0.38 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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % sh5l with pid 2152171 completed with status 0
% 0.14/0.41 % Result found by sh5l
% 0.14/0.41 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.41 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 % Search class: FGUSM-FSLM33-DFFFFFNN
% 0.14/0.41 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % SubtermCWHack with pid 2152174 completed with status 0
% 0.14/0.41 % Result found by SubtermCWHack
% 0.14/0.41 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.41 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 % Search class: FGUSM-FSLM33-DFFFFFNN
% 0.14/0.41 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % Preprocessing time : 0.002 s
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Theorem
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 92
% 0.14/0.41 % Removed by relevancy pruning/SinE : 13
% 0.14/0.41 % Initial clauses : 161
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 161
% 0.14/0.41 % Processed clauses : 355
% 0.14/0.41 % ...of these trivial : 6
% 0.14/0.41 % ...subsumed : 137
% 0.14/0.41 % ...remaining for further processing : 212
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 0
% 0.14/0.41 % Backward-rewritten : 12
% 0.14/0.41 % Generated clauses : 722
% 0.14/0.41 % ...of the previous two non-redundant : 557
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 720
% 0.14/0.41 % Factorizations : 2
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 429
% 0.14/0.41 % ...of those cached : 336
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 200
% 0.14/0.41 % Positive orientable unit clauses : 104
% 0.14/0.41 % Positive unorientable unit clauses: 3
% 0.14/0.41 % Negative unit clauses : 55
% 0.14/0.41 % Non-unit-clauses : 38
% 0.14/0.41 % Current number of unprocessed clauses: 361
% 0.14/0.41 % ...number of literals in the above : 1020
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 12
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 269
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 182
% 0.14/0.41 % Non-unit clause-clause subsumptions : 10
% 0.14/0.41 % Unit Clause-clause subsumption calls : 954
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 14
% 0.14/0.41 % BW rewrite match successes : 10
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 15750
% 0.14/0.41 % Search garbage collected termcells : 1834
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.014 s
% 0.14/0.41 % System time : 0.005 s
% 0.14/0.41 % Total time : 0.019 s
% 0.14/0.41 % Maximum resident set size: 4000 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.015 s
% 0.14/0.41 % System time : 0.009 s
% 0.14/0.41 % Total time : 0.024 s
% 0.14/0.41 % Maximum resident set size: 4608 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------