%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV175+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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 : Sun Sep 27 09:06:58 AM UTC 2026
% Result : Theorem 15.02s 7.58s
% Output : CNFRefutation 15.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 77 ( 20 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 76 ( 12 ~; 10 |; 32 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 18 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0051,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(G,n4)
& leq(n0,G) )
=> a_select2(sigmaold_init,G) = init ) )
& ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(F,n4)
& leq(n0,F) )
=> a_select2(rhoold_init,F) = init ) )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(E,n4)
& leq(n0,E) )
=> a_select2(muold_init,E) = init ) )
& ! [D] :
( ( leq(D,n4)
& leq(n0,D) )
=> a_select3(center_init,D,n0) = init )
& ! [C] :
( ( leq(C,pred(pv28))
& leq(n0,C) )
=> a_select2(rho_init,C) = init )
& ! [A] :
( ( leq(A,n135299)
& leq(n0,A) )
=> ! [B] :
( ( leq(B,n4)
& leq(n0,B) )
=> a_select3(q_init,A,B) = init ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) )
=> a_select3(q_init,pv30,pv28) = init ),
file('theBenchmark.p',cl5_nebula_init_0051) ).
fof(cl5_nebula_init_0051_neg,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(G,n4)
& leq(n0,G) )
=> a_select2(sigmaold_init,G) = init ) )
& ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(F,n4)
& leq(n0,F) )
=> a_select2(rhoold_init,F) = init ) )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(E,n4)
& leq(n0,E) )
=> a_select2(muold_init,E) = init ) )
& ! [D] :
( ( leq(D,n4)
& leq(n0,D) )
=> a_select3(center_init,D,n0) = init )
& ! [C] :
( ( leq(C,pred(pv28))
& leq(n0,C) )
=> a_select2(rho_init,C) = init )
& ! [A] :
( ( leq(A,n135299)
& leq(n0,A) )
=> ! [B] :
( ( leq(B,n4)
& leq(n0,B) )
=> a_select3(q_init,A,B) = 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]) ).
cnf(c_374,negated_conjecture,
leq(n0,pv28),
inference(clausify,[status(thm)],[cl5_nebula_init_0051_neg]) ).
cnf(c_375,negated_conjecture,
leq(n0,pv30),
inference(clausify,[status(thm)],[cl5_nebula_init_0051_neg]) ).
cnf(c_376,negated_conjecture,
leq(pv28,n4),
inference(clausify,[status(thm)],[cl5_nebula_init_0051_neg]) ).
cnf(c_377,negated_conjecture,
leq(pv30,n135299),
inference(clausify,[status(thm)],[cl5_nebula_init_0051_neg]) ).
cnf(c_378,negated_conjecture,
( a_select3(q_init,A,B) = init
| ~ leq(B,n4)
| ~ leq(n0,B)
| ~ leq(A,n135299)
| ~ leq(n0,A) ),
inference(clausify,[status(thm)],[cl5_nebula_init_0051_neg]) ).
cnf(c_385,negated_conjecture,
a_select3(q_init,pv30,pv28) != init,
inference(clausify,[status(thm)],[cl5_nebula_init_0051_neg]) ).
cnf(c_2833,negated_conjecture,
( a_select3(q_init,pv30,A) = init
| ~ leq(A,n4)
| ~ leq(n0,A)
| ~ leq(pv30,n135299) ),
inference(resolve,[status(thm)],[c_378,c_375]) ).
cnf(c_2834,negated_conjecture,
( a_select3(q_init,pv30,A) = init
| ~ leq(A,n4)
| ~ leq(n0,A) ),
inference(resolve,[status(thm)],[c_2833,c_377]) ).
cnf(c_2835,negated_conjecture,
( a_select3(q_init,pv30,pv28) = init
| ~ leq(pv28,n4) ),
inference(resolve,[status(thm)],[c_2834,c_374]) ).
cnf(c_2836,negated_conjecture,
a_select3(q_init,pv30,pv28) = init,
inference(resolve,[status(thm)],[c_2835,c_376]) ).
cnf(c_2832,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_385,c_2836]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV175+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.56 % Computer : n016.cluster.edu
% 0.09/5.56 % Model : x86_64 x86_64
% 0.09/5.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.56 % Memory : 8046.5625MB
% 0.09/5.56 % OS : Linux 6.8.0-71-generic
% 0.09/5.56 % CPULimit : 300
% 0.09/5.56 % WCLimit : 300
% 0.09/5.56 % DateTime : Sat Sep 26 13:22:52 UTC 2026
% 0.09/5.56 % CPUTime :
% 0.09/5.56 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.56 % Process 958546 was started by sandbox on n016,
% 0.09/5.56 % Sat Sep 26 13:22:52 2026
% 0.09/5.56 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/5.62
% 0.14/5.62 % From the command line: assign(max_seconds, 300).
% 15.02/7.58
% 15.02/7.58 % SZS status Theorem for theBenchmark
% 15.02/7.58
% 15.02/7.58 % Proof 1 at 1.76 (+ 0.16) seconds.
% 15.02/7.58 % Length of proof is 8.
% 15.02/7.58 % Level of proof is 2.
% 15.02/7.58 % Maximum clause weight is 28.000.
% 15.02/7.58 % Given clauses 287.
% 15.02/7.58
% 15.02/7.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------