%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV171+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 03:12:25 PM UTC 2026
% Result : Theorem 7.66s 1.46s
% Output : Proof 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 21 unt; 0 def)
% Number of atoms : 168 ( 51 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 200 ( 58 ~; 44 |; 72 &)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 21 con; 0-4 aty)
% Number of variables : 42 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [I] :
( ( leq(I,n4)
& leq(n0,I) )
=> a_select2(sigmaold_init,I) = init ) )
& ( gt(loopcounter,n1)
=> ! [H] :
( ( leq(H,n4)
& leq(n0,H) )
=> a_select2(rhoold_init,H) = init ) )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(G,n4)
& leq(n0,G) )
=> a_select2(muold_init,G) = init ) )
& ! [F] :
( ( leq(F,n4)
& leq(n0,F) )
=> a_select3(center_init,F,n0) = init )
& ! [E] :
( ( leq(E,n4)
& leq(n0,E) )
=> a_select2(sigma_init,E) = init )
& ! [D] :
( ( leq(D,n4)
& leq(n0,D) )
=> a_select2(mu_init,D) = init )
& ! [C] :
( ( leq(C,n4)
& 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(pv54,n4)
& leq(pv52,n4)
& leq(pv10,n135299)
& leq(n0,pv54)
& leq(n0,pv52)
& leq(n0,pv10) )
=> a_select2(sigma_init,pv52) = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0031) ).
fof(f52_neg,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [I] :
( ( leq(I,n4)
& leq(n0,I) )
=> a_select2(sigmaold_init,I) = init ) )
& ( gt(loopcounter,n1)
=> ! [H] :
( ( leq(H,n4)
& leq(n0,H) )
=> a_select2(rhoold_init,H) = init ) )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(G,n4)
& leq(n0,G) )
=> a_select2(muold_init,G) = init ) )
& ! [F] :
( ( leq(F,n4)
& leq(n0,F) )
=> a_select3(center_init,F,n0) = init )
& ! [E] :
( ( leq(E,n4)
& leq(n0,E) )
=> a_select2(sigma_init,E) = init )
& ! [D] :
( ( leq(D,n4)
& leq(n0,D) )
=> a_select2(mu_init,D) = init )
& ! [C] :
( ( leq(C,n4)
& 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(pv54,n4)
& leq(pv52,n4)
& leq(pv10,n135299)
& leq(n0,pv54)
& leq(n0,pv52)
& leq(n0,pv10) )
=> a_select2(sigma_init,pv52) = init ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( a_select2(sigma_init,pv52) != init
& ( ! [I] :
( a_select2(sigmaold_init,I) = init
| ~ leq(I,n4)
| ~ leq(n0,I) )
| ~ gt(loopcounter,n1) )
& ( ! [H] :
( a_select2(rhoold_init,H) = init
| ~ leq(H,n4)
| ~ leq(n0,H) )
| ~ gt(loopcounter,n1) )
& ( ! [G] :
( a_select2(muold_init,G) = init
| ~ leq(G,n4)
| ~ leq(n0,G) )
| ~ gt(loopcounter,n1) )
& ! [F] :
( a_select3(center_init,F,n0) = init
| ~ leq(F,n4)
| ~ leq(n0,F) )
& ! [E] :
( a_select2(sigma_init,E) = init
| ~ leq(E,n4)
| ~ leq(n0,E) )
& ! [D] :
( a_select2(mu_init,D) = init
| ~ leq(D,n4)
| ~ leq(n0,D) )
& ! [C] :
( a_select2(rho_init,C) = init
| ~ leq(C,n4)
| ~ leq(n0,C) )
& ! [A] :
( ! [B] :
( a_select3(q_init,A,B) = init
| ~ leq(B,n4)
| ~ leq(n0,B) )
| ~ leq(A,n135299)
| ~ leq(n0,A) )
& leq(pv54,n4)
& leq(pv52,n4)
& leq(pv10,n135299)
& leq(n0,pv54)
& leq(n0,pv52)
& leq(n0,pv10) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
! [A,B,C,D,E,F,G,H,I] :
( a_select2(sigma_init,pv52) != init
& ( a_select2(sigmaold_init,I) = init
| ~ leq(I,n4)
| ~ leq(n0,I)
| ~ gt(loopcounter,n1) )
& ( a_select2(rhoold_init,H) = init
| ~ leq(H,n4)
| ~ leq(n0,H)
| ~ gt(loopcounter,n1) )
& ( a_select2(muold_init,G) = init
| ~ leq(G,n4)
| ~ leq(n0,G)
| ~ gt(loopcounter,n1) )
& ( a_select3(center_init,F,n0) = init
| ~ leq(F,n4)
| ~ leq(n0,F) )
& ( a_select2(sigma_init,E) = init
| ~ leq(E,n4)
| ~ leq(n0,E) )
& ( a_select2(mu_init,D) = init
| ~ leq(D,n4)
| ~ leq(n0,D) )
& ( a_select2(rho_init,C) = init
| ~ leq(C,n4)
| ~ leq(n0,C) )
& ( a_select3(q_init,A,B) = init
| ~ leq(B,n4)
| ~ leq(n0,B)
| ~ leq(A,n135299)
| ~ leq(n0,A) )
& leq(pv54,n4)
& leq(pv52,n4)
& leq(pv10,n135299)
& leq(n0,pv54)
& leq(n0,pv52)
& leq(n0,pv10) ),
inference(skolemisation,[status(esa)],[f52_nnf]) ).
cnf(c264,plain,
( a_select2(sigma_init,X4) = init
| ~ leq(X4,n4)
| ~ leq(n0,X4) ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi262,negated_conjecture,
ifeq(leq(n0,X0),trueq,ifeq(leq(X0,n4),trueq,a_select2(sigma_init,X0),init),init) = init,
inference(equality_encoding,[status(esa)],[c264]) ).
cnf(c256,plain,
leq(n0,pv52),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi254,negated_conjecture,
leq(n0,pv52) = trueq,
inference(equality_encoding,[status(esa)],[c256]) ).
cnf(c259,plain,
leq(pv52,n4),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi257,negated_conjecture,
leq(pv52,n4) = trueq,
inference(equality_encoding,[status(esa)],[c259]) ).
cnf(h1193,plain,
a_select2(sigma_init,pv52) = init,
inference(hyper_resolution,[status(thm)],[hi262,hi254,hi257]) ).
cnf(c269,plain,
a_select2(sigma_init,pv52) != init,
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi308,negated_conjecture,
ifeq(a_select2(sigma_init,pv52),init,false,trueq) = trueq,
inference(equality_encoding,[status(esa)],[c269]) ).
cnf(t0,plain,
trueq = false,
inference(hyper_resolution,[status(thm)],[hi308,h1193]) ).
cnf(t989,plain,
false = trueq,
inference(orient,[status(thm)],[t0]) ).
fof(f2,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f2_nnf,plain,
! [X] : ~ gt(X,X),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] : ~ gt(X,X),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
fof(f51,axiom,
def != use,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',defuse) ).
fof(f51_nnf,plain,
def != use,
inference(nnf_transformation,[status(thm)],[f51]) ).
fof(f51_sk,plain,
def != use,
inference(skolemisation,[status(esa)],[f51_nnf]) ).
cnf(c254,plain,
def != use,
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(goal_0,negated_conjecture,
trueq != false,
inference(equality_encoding,[status(esa)],[c2,c254,c269]) ).
cnf(g0_0,plain,
trueq != trueq,
inference(rw,[status(thm)],[goal_0,t989]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV171+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 18:40:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.66/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.66/1.46 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------