%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV182+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 : n013.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:54 PM UTC 2026
% Result : Theorem 0.23s 0.59s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 161 ( 34 equ)
% Maximal formula atoms : 29 ( 7 avg)
% Number of connectives : 176 ( 38 ~; 33 |; 60 &)
% ( 1 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0086,conjecture,
( ( ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(sigma_init,X22) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init ) )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select3(center_init,X4,n0) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv76) )
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(rho_init,X28) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0086) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(c_0_3,plain,
( epred1_0
<=> ( ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(sigma_init,X22) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init ) )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select3(center_init,X4,n0) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv76) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(sigma_init,X22) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init ) )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select3(center_init,X4,n0) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv76) )
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(rho_init,X28) = init ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0086]) ).
fof(c_0_5,plain,
( epred1_0
=> ( ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(sigma_init,X22) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init ) )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select3(center_init,X4,n0) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv76) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
~ ( epred1_0
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(rho_init,X28) = init ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_3]) ).
fof(c_0_7,plain,
! [X69,X70,X71,X72,X73,X74] :
( ( ~ epred1_0
| a_select2(sigma_init,X74) = init
| ~ leq(X74,n4)
| ~ leq(n0,X74)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| a_select2(rho_init,X73) = init
| ~ leq(X73,n4)
| ~ leq(n0,X73)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| a_select2(mu_init,X72) = init
| ~ leq(X72,n4)
| ~ leq(n0,X72)
| ~ gt(loopcounter,n0) )
& ( ~ epred1_0
| a_select3(center_init,X71,n0) = init
| ~ leq(X71,n4)
| ~ leq(n0,X71) )
& ( ~ epred1_0
| a_select3(q_init,X69,X70) = init
| ~ leq(X70,n4)
| ~ leq(n0,X70)
| ~ leq(X69,n135299)
| ~ leq(n0,X69) )
& ( ~ epred1_0
| leq(n1,loopcounter) )
& ( ~ epred1_0
| leq(tptp_float_0_001,pv76) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,negated_conjecture,
( a_select2(rho_init,esk1_0) != init
& leq(esk1_0,n4)
& leq(n0,esk1_0)
& epred1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,plain,
( ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n0)
| a_select2(rho_init,X1) = init ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X44,X45] :
( gt(X45,X44)
| ~ leq(succ(X44),X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])])]) ).
cnf(c_0_12,negated_conjecture,
a_select2(rho_init,esk1_0) != init,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ gt(loopcounter,n0)
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| a_select2(rho_init,X1) = init ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_14,negated_conjecture,
leq(esk1_0,n4),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ leq(succ(X1),X2)
| gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_18,plain,
( ~ epred1_0
| leq(n1,loopcounter) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
~ gt(loopcounter,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_20,plain,
( ~ leq(n1,X1)
| gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_10])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV182+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.50 % Computer : n013.cluster.edu
% 0.09/0.50 % Model : x86_64 x86_64
% 0.09/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.50 % Memory : 8046.5625MB
% 0.09/0.50 % OS : Linux 6.8.0-71-generic
% 0.09/0.50 % CPULimit : 300
% 0.09/0.50 % WCLimit : 300
% 0.09/0.50 % DateTime : Mon Sep 21 08:33:22 UTC 2026
% 0.09/0.50 % CPUTime :
% 0.09/0.50 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55 Running first-order theorem proving
% 0.09/0.55 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.23/0.59 % Version: 3.5.1
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 % Starting sh5l with 300s (1) cores
% 0.23/0.59 % new_bool_1 with pid 372326 completed with status 0
% 0.23/0.59 % Result found by new_bool_1
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.59 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.23/0.59 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.23/0.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.59 % SubtermCWHack with pid 372328 completed with status 0
% 0.23/0.59 % Result found by SubtermCWHack
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.59 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.23/0.59 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.23/0.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.59 % Preprocessing time : 0.002 s
% 0.23/0.59
% 0.23/0.59 % Proof found!
% 0.23/0.59 % SZS status Theorem
% 0.23/0.59 % SZS output start CNFRefutation
% See solution above
% 0.23/0.59 % Parsed axioms : 92
% 0.23/0.59 % Removed by relevancy pruning/SinE : 29
% 0.23/0.59 % Initial clauses : 75
% 0.23/0.59 % Removed in clause preprocessing : 0
% 0.23/0.59 % Initial clauses in saturation : 75
% 0.23/0.59 % Processed clauses : 287
% 0.23/0.59 % ...of these trivial : 0
% 0.23/0.59 % ...subsumed : 74
% 0.23/0.59 % ...remaining for further processing : 213
% 0.23/0.59 % Other redundant clauses eliminated : 0
% 0.23/0.59 % Clauses deleted for lack of memory : 0
% 0.23/0.59 % Backward-subsumed : 2
% 0.23/0.59 % Backward-rewritten : 10
% 0.23/0.59 % Generated clauses : 642
% 0.23/0.59 % ...of the previous two non-redundant : 472
% 0.23/0.59 % ...aggressively subsumed : 0
% 0.23/0.59 % Contextual simplify-reflections : 0
% 0.23/0.59 % Paramodulations : 640
% 0.23/0.59 % Factorizations : 2
% 0.23/0.59 % NegExts : 0
% 0.23/0.59 % Equation resolutions : 0
% 0.23/0.59 % Disequality decompositions : 0
% 0.23/0.59 % Total rewrite steps : 322
% 0.23/0.59 % ...of those cached : 250
% 0.23/0.59 % Propositional unsat checks : 0
% 0.23/0.59 % Propositional check models : 0
% 0.23/0.59 % Propositional check unsatisfiable : 0
% 0.23/0.59 % Propositional clauses : 0
% 0.23/0.59 % Propositional clauses after purity: 0
% 0.23/0.59 % Propositional unsat core size : 0
% 0.23/0.59 % Propositional preprocessing time : 0.000
% 0.23/0.59 % Propositional encoding time : 0.000
% 0.23/0.59 % Propositional solver time : 0.000
% 0.23/0.59 % Success case prop preproc time : 0.000
% 0.23/0.59 % Success case prop encoding time : 0.000
% 0.23/0.59 % Success case prop solver time : 0.000
% 0.23/0.59 % Current number of processed clauses : 201
% 0.23/0.59 % Positive orientable unit clauses : 106
% 0.23/0.59 % Positive unorientable unit clauses: 0
% 0.23/0.59 % Negative unit clauses : 44
% 0.23/0.59 % Non-unit-clauses : 51
% 0.23/0.59 % Current number of unprocessed clauses: 257
% 0.23/0.59 % ...number of literals in the above : 599
% 0.23/0.59 % Current number of archived formulas : 0
% 0.23/0.59 % Current number of archived clauses : 12
% 0.23/0.59 % Clause-clause subsumption calls (NU) : 312
% 0.23/0.59 % Rec. Clause-clause subsumption calls : 231
% 0.23/0.59 % Non-unit clause-clause subsumptions : 6
% 0.23/0.59 % Unit Clause-clause subsumption calls : 388
% 0.23/0.59 % Rewrite failures with RHS unbound : 0
% 0.23/0.59 % BW rewrite match attempts : 12
% 0.23/0.59 % BW rewrite match successes : 1
% 0.23/0.59 % Condensation attempts : 0
% 0.23/0.59 % Condensation successes : 0
% 0.23/0.59 % Termbank termtop insertions : 9659
% 0.23/0.59 % Search garbage collected termcells : 765
% 0.23/0.59
% 0.23/0.59 % -------------------------------------------------
% 0.23/0.59 % User time : 0.016 s
% 0.23/0.59 % System time : 0.002 s
% 0.23/0.59 % Total time : 0.018 s
% 0.23/0.59 % Maximum resident set size: 3696 pages
% 0.23/0.59
% 0.23/0.59 % -------------------------------------------------
% 0.23/0.59 % User time : 0.019 s
% 0.23/0.59 % System time : 0.007 s
% 0.23/0.59 % Total time : 0.026 s
% 0.23/0.59 % Maximum resident set size: 4864 pages
% 0.23/0.59 % E exiting
%------------------------------------------------------------------------------