%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV188+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 : n018.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:55 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 122 ( 28 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 113 ( 19 ~; 10 |; 44 &)
% ( 2 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 15 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0116,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(sigmaold_init,X28) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(muold_init,X21) = init ) )
& ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select3(center_init,X20,n0) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) ) )
=> ! [X29] :
( ( leq(X29,tptp_minus_1)
& leq(n0,X29) )
=> a_select2(mu_init,X29) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0116) ).
fof(leq_succ,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
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(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(X1,n0)
& leq(n0,X1) )
=> X1 = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(c_0_6,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(sigmaold_init,X28) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(muold_init,X21) = init ) )
& ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select3(center_init,X20,n0) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) ) )
=> ! [X29] :
( ( leq(X29,tptp_minus_1)
& leq(n0,X29) )
=> a_select2(mu_init,X29) = init ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0116]) ).
fof(c_0_7,plain,
( epred1_0
<=> ( ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(sigmaold_init,X28) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> a_select2(muold_init,X21) = init ) )
& ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> a_select3(center_init,X20,n0) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) ) ) ),
introduced(definition) ).
fof(c_0_8,plain,
! [X39,X40] :
( leq(X39,succ(X40))
| ~ leq(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])])]) ).
fof(c_0_9,negated_conjecture,
~ ( epred1_0
=> ! [X29] :
( ( leq(X29,tptp_minus_1)
& leq(n0,X29) )
=> a_select2(mu_init,X29) = init ) ),
inference(apply_def,[status(thm)],[c_0_6,c_0_7]) ).
fof(c_0_10,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_11,plain,
( ~ leq(X1,X2)
| leq(X1,succ(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_13,negated_conjecture,
( a_select2(mu_init,esk1_0) != init
& leq(esk1_0,tptp_minus_1)
& 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_9])])])]) ).
fof(c_0_14,plain,
! [X57] : ~ gt(X57,X57),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_15,plain,
! [X41,X42] :
( ( leq(X41,X42)
| ~ gt(succ(X42),X41) )
& ( gt(succ(X42),X41)
| ~ leq(X41,X42) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])]) ).
fof(c_0_16,plain,
! [X47] :
( X47 = n0
| ~ leq(X47,n0)
| ~ leq(n0,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])])]) ).
cnf(c_0_17,plain,
( ~ leq(X1,tptp_minus_1)
| leq(X1,n0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ leq(X1,X2)
| gt(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ leq(X1,n0)
| ~ leq(n0,X1)
| X1 = n0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
leq(esk1_0,n0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV188+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.11/0.36 % Computer : n018.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 08:36:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_3 with pid 1465876 completed with status 0
% 0.11/0.44 % Result found by new_bool_3
% 0.11/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.11/0.44 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 1465881 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.11/0.44 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 92
% 0.11/0.45 % Removed by relevancy pruning/SinE : 29
% 0.11/0.45 % Initial clauses : 74
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 74
% 0.11/0.45 % Processed clauses : 114
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 8
% 0.11/0.45 % ...remaining for further processing : 106
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 4
% 0.11/0.45 % Generated clauses : 104
% 0.11/0.45 % ...of the previous two non-redundant : 76
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 102
% 0.11/0.45 % Factorizations : 2
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 63
% 0.11/0.45 % ...of those cached : 42
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 102
% 0.11/0.45 % Positive orientable unit clauses : 72
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 17
% 0.11/0.45 % Non-unit-clauses : 13
% 0.11/0.45 % Current number of unprocessed clauses: 35
% 0.11/0.45 % ...number of literals in the above : 102
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 4
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 22
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 22
% 0.11/0.45 % Non-unit clause-clause subsumptions : 0
% 0.11/0.45 % Unit Clause-clause subsumption calls : 44
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 3
% 0.11/0.45 % BW rewrite match successes : 1
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 4932
% 0.11/0.45 % Search garbage collected termcells : 782
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.004 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.009 s
% 0.11/0.45 % Maximum resident set size: 3752 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.008 s
% 0.11/0.45 % System time : 0.009 s
% 0.11/0.45 % Total time : 0.017 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------