%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV175+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 : n026.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:53 PM UTC 2026
% Result : Theorem 0.14s 0.51s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 179 ( 37 equ)
% Maximal formula atoms : 37 ( 8 avg)
% Number of connectives : 203 ( 44 ~; 40 |; 74 &)
% ( 1 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 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 : 39 ( 0 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0051,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,pred(pv28))
& 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 ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) )
=> a_select3(q_init,pv30,pv28) = init ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0051) ).
fof(c_0_1,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,pred(pv28))
& 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 ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) ) ),
introduced(definition) ).
fof(c_0_2,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,pred(pv28))
& 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 ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) )
=> a_select3(q_init,pv30,pv28) = init ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0051]) ).
fof(c_0_3,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,pred(pv28))
& 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 ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_4,negated_conjecture,
~ ( epred1_0
=> a_select3(q_init,pv30,pv28) = init ),
inference(apply_def,[status(thm)],[c_0_2,c_0_1]) ).
fof(c_0_5,plain,
! [X72,X73,X74,X75,X76,X77,X78] :
( ( ~ epred1_0
| a_select2(sigmaold_init,X78) = init
| ~ leq(X78,n4)
| ~ leq(n0,X78)
| ~ gt(loopcounter,n1) )
& ( ~ epred1_0
| a_select2(rhoold_init,X77) = init
| ~ leq(X77,n4)
| ~ leq(n0,X77)
| ~ gt(loopcounter,n1) )
& ( ~ epred1_0
| a_select2(muold_init,X76) = init
| ~ leq(X76,n4)
| ~ leq(n0,X76)
| ~ gt(loopcounter,n1) )
& ( ~ epred1_0
| a_select3(center_init,X75,n0) = init
| ~ leq(X75,n4)
| ~ leq(n0,X75) )
& ( ~ epred1_0
| a_select2(rho_init,X74) = init
| ~ leq(X74,pred(pv28))
| ~ leq(n0,X74) )
& ( ~ epred1_0
| a_select3(q_init,X72,X73) = init
| ~ leq(X73,n4)
| ~ leq(n0,X73)
| ~ leq(X72,n135299)
| ~ leq(n0,X72) )
& ( ~ epred1_0
| leq(pv30,n135299) )
& ( ~ epred1_0
| leq(pv28,n4) )
& ( ~ epred1_0
| leq(n0,pv30) )
& ( ~ epred1_0
| leq(n0,pv28) ) ),
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_3])])])])]) ).
fof(c_0_6,negated_conjecture,
( a_select3(q_init,pv30,pv28) != init
& epred1_0 ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,plain,
( ~ epred1_0
| ~ leq(X2,n4)
| ~ leq(n0,X2)
| ~ leq(X1,n135299)
| ~ leq(n0,X1)
| a_select3(q_init,X1,X2) = init ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ epred1_0
| leq(pv28,n4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ epred1_0
| leq(pv30,n135299) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ epred1_0
| leq(n0,pv28) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ epred1_0
| leq(n0,pv30) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
a_select3(q_init,pv30,pv28) != init,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ leq(n0,X1)
| ~ leq(n0,X2)
| ~ leq(X1,n135299)
| ~ leq(X2,n4)
| a_select3(q_init,X1,X2) = init ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_15,plain,
leq(pv28,n4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])]) ).
cnf(c_0_16,plain,
leq(pv30,n135299),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8])]) ).
cnf(c_0_17,plain,
leq(n0,pv28),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8])]) ).
cnf(c_0_18,plain,
leq(n0,pv30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV175+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.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:36:21 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.14/0.51 % Version: 3.5.1
% 0.14/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.51 % Starting sh5l with 300s (1) cores
% 0.14/0.51 % new_bool_3 with pid 1855167 completed with status 0
% 0.14/0.51 % Result found by new_bool_3
% 0.14/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.51 % Search class: FGUSM-FFMM31-MFFFFFNN
% 0.14/0.51 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.14/0.51 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.51 % SubtermCWHack with pid 1855170 completed with status 0
% 0.14/0.51 % Result found by SubtermCWHack
% 0.14/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.51 % Search class: FGUSM-FFMM31-MFFFFFNN
% 0.14/0.51 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.14/0.51 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.51 % Preprocessing time : 0.003 s
% 0.14/0.51
% 0.14/0.51 % Proof found!
% 0.14/0.51 % SZS status Theorem
% 0.14/0.51 % SZS output start CNFRefutation
% See solution above
% 0.14/0.51 % Parsed axioms : 92
% 0.14/0.51 % Removed by relevancy pruning/SinE : 26
% 0.14/0.51 % Initial clauses : 80
% 0.14/0.51 % Removed in clause preprocessing : 0
% 0.14/0.51 % Initial clauses in saturation : 80
% 0.14/0.51 % Processed clauses : 374
% 0.14/0.51 % ...of these trivial : 6
% 0.14/0.51 % ...subsumed : 155
% 0.14/0.51 % ...remaining for further processing : 213
% 0.14/0.51 % Other redundant clauses eliminated : 0
% 0.14/0.51 % Clauses deleted for lack of memory : 0
% 0.14/0.51 % Backward-subsumed : 0
% 0.14/0.51 % Backward-rewritten : 7
% 0.14/0.51 % Generated clauses : 707
% 0.14/0.51 % ...of the previous two non-redundant : 513
% 0.14/0.51 % ...aggressively subsumed : 0
% 0.14/0.51 % Contextual simplify-reflections : 0
% 0.14/0.51 % Paramodulations : 705
% 0.14/0.51 % Factorizations : 2
% 0.14/0.51 % NegExts : 0
% 0.14/0.51 % Equation resolutions : 0
% 0.14/0.51 % Disequality decompositions : 0
% 0.14/0.51 % Total rewrite steps : 494
% 0.14/0.51 % ...of those cached : 420
% 0.14/0.51 % Propositional unsat checks : 0
% 0.14/0.51 % Propositional check models : 0
% 0.14/0.51 % Propositional check unsatisfiable : 0
% 0.14/0.51 % Propositional clauses : 0
% 0.14/0.51 % Propositional clauses after purity: 0
% 0.14/0.51 % Propositional unsat core size : 0
% 0.14/0.51 % Propositional preprocessing time : 0.000
% 0.14/0.51 % Propositional encoding time : 0.000
% 0.14/0.51 % Propositional solver time : 0.000
% 0.14/0.51 % Success case prop preproc time : 0.000
% 0.14/0.51 % Success case prop encoding time : 0.000
% 0.14/0.51 % Success case prop solver time : 0.000
% 0.14/0.51 % Current number of processed clauses : 206
% 0.14/0.51 % Positive orientable unit clauses : 105
% 0.14/0.51 % Positive unorientable unit clauses: 0
% 0.14/0.51 % Negative unit clauses : 59
% 0.14/0.51 % Non-unit-clauses : 42
% 0.14/0.51 % Current number of unprocessed clauses: 219
% 0.14/0.51 % ...number of literals in the above : 504
% 0.14/0.51 % Current number of archived formulas : 0
% 0.14/0.51 % Current number of archived clauses : 7
% 0.14/0.51 % Clause-clause subsumption calls (NU) : 213
% 0.14/0.51 % Rec. Clause-clause subsumption calls : 149
% 0.14/0.51 % Non-unit clause-clause subsumptions : 15
% 0.14/0.51 % Unit Clause-clause subsumption calls : 483
% 0.14/0.51 % Rewrite failures with RHS unbound : 0
% 0.14/0.51 % BW rewrite match attempts : 2
% 0.14/0.51 % BW rewrite match successes : 1
% 0.14/0.51 % Condensation attempts : 0
% 0.14/0.51 % Condensation successes : 0
% 0.14/0.51 % Termbank termtop insertions : 10013
% 0.14/0.51 % Search garbage collected termcells : 765
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.022 s
% 0.14/0.51 % System time : 0.005 s
% 0.14/0.51 % Total time : 0.027 s
% 0.14/0.51 % Maximum resident set size: 4008 pages
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.026 s
% 0.14/0.51 % System time : 0.013 s
% 0.14/0.51 % Total time : 0.039 s
% 0.14/0.51 % Maximum resident set size: 4864 pages
% 0.14/0.51 % E exiting
%------------------------------------------------------------------------------