%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV187+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:27 PM UTC 2026
% Result : Theorem 8.15s 6.59s
% Output : Proof 8.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 23 unt; 0 def)
% Number of atoms : 123 ( 40 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 142 ( 47 ~; 33 |; 40 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 16 con; 0-4 aty)
% Number of variables : 33 ( 0 sgn 29 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(F,n4)
& leq(n0,F) )
=> a_select2(sigmaold_init,F) = init ) )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(E,n4)
& leq(n0,E) )
=> a_select2(rhoold_init,E) = init ) )
& ( gt(loopcounter,n1)
=> ! [D] :
( ( leq(D,n4)
& leq(n0,D) )
=> a_select2(muold_init,D) = init ) )
& ! [C] :
( ( leq(C,n4)
& leq(n0,C) )
=> a_select3(center_init,C,n0) = init )
& ! [A] :
( ( leq(A,n135299)
& leq(n0,A) )
=> ! [B] :
( ( leq(B,n4)
& leq(n0,B) )
=> a_select3(q_init,A,B) = init ) )
& gt(loopcounter,n1) )
=> ! [G] :
( ( leq(G,n4)
& leq(n0,G) )
=> a_select2(sigmaold_init,G) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0111) ).
fof(f52_neg,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(F,n4)
& leq(n0,F) )
=> a_select2(sigmaold_init,F) = init ) )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(E,n4)
& leq(n0,E) )
=> a_select2(rhoold_init,E) = init ) )
& ( gt(loopcounter,n1)
=> ! [D] :
( ( leq(D,n4)
& leq(n0,D) )
=> a_select2(muold_init,D) = init ) )
& ! [C] :
( ( leq(C,n4)
& leq(n0,C) )
=> a_select3(center_init,C,n0) = init )
& ! [A] :
( ( leq(A,n135299)
& leq(n0,A) )
=> ! [B] :
( ( leq(B,n4)
& leq(n0,B) )
=> a_select3(q_init,A,B) = init ) )
& gt(loopcounter,n1) )
=> ! [G] :
( ( leq(G,n4)
& leq(n0,G) )
=> a_select2(sigmaold_init,G) = init ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ? [G] :
( a_select2(sigmaold_init,G) != init
& leq(G,n4)
& leq(n0,G) )
& ( ! [F] :
( a_select2(sigmaold_init,F) = init
| ~ leq(F,n4)
| ~ leq(n0,F) )
| ~ gt(loopcounter,n1) )
& ( ! [E] :
( a_select2(rhoold_init,E) = init
| ~ leq(E,n4)
| ~ leq(n0,E) )
| ~ gt(loopcounter,n1) )
& ( ! [D] :
( a_select2(muold_init,D) = init
| ~ leq(D,n4)
| ~ leq(n0,D) )
| ~ gt(loopcounter,n1) )
& ! [C] :
( a_select3(center_init,C,n0) = 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) )
& gt(loopcounter,n1) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
! [A,B,C,D,E,F] :
( a_select2(sigmaold_init,sk27) != init
& leq(sk27,n4)
& leq(n0,sk27)
& ( a_select2(sigmaold_init,F) = init
| ~ leq(F,n4)
| ~ leq(n0,F)
| ~ gt(loopcounter,n1) )
& ( a_select2(rhoold_init,E) = init
| ~ leq(E,n4)
| ~ leq(n0,E)
| ~ gt(loopcounter,n1) )
& ( a_select2(muold_init,D) = init
| ~ leq(D,n4)
| ~ leq(n0,D)
| ~ gt(loopcounter,n1) )
& ( a_select3(center_init,C,n0) = 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) )
& gt(loopcounter,n1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk27])],[f52_nnf]) ).
cnf(c260,plain,
( a_select2(sigmaold_init,X5) = init
| ~ leq(X5,n4)
| ~ leq(n0,X5)
| ~ gt(loopcounter,n1) ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi258,negated_conjecture,
ifeq(gt(loopcounter,n1),trueq,ifeq(leq(n0,X0),trueq,ifeq(leq(X0,n4),trueq,a_select2(sigmaold_init,X0),init),init),init) = init,
inference(equality_encoding,[status(esa)],[c260]) ).
cnf(c255,plain,
gt(loopcounter,n1),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi253,negated_conjecture,
gt(loopcounter,n1) = trueq,
inference(equality_encoding,[status(esa)],[c255]) ).
cnf(c261,plain,
leq(n0,sk27),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi259,negated_conjecture,
leq(n0,sk27) = trueq,
inference(equality_encoding,[status(esa)],[c261]) ).
cnf(c262,plain,
leq(sk27,n4),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi260,negated_conjecture,
leq(sk27,n4) = trueq,
inference(equality_encoding,[status(esa)],[c262]) ).
cnf(h347,plain,
a_select2(sigmaold_init,sk27) = init,
inference(hyper_resolution,[status(thm)],[hi258,hi253,hi259,hi260]) ).
cnf(c263,plain,
a_select2(sigmaold_init,sk27) != init,
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi302,negated_conjecture,
ifeq(a_select2(sigmaold_init,sk27),init,false,trueq) = trueq,
inference(equality_encoding,[status(esa)],[c263]) ).
cnf(t0,plain,
trueq = false,
inference(hyper_resolution,[status(thm)],[hi302,h347]) ).
cnf(t952,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,c263]) ).
cnf(g0_0,plain,
trueq != trueq,
inference(rw,[status(thm)],[goal_0,t952]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV187+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/5.39 % Computer : n019.cluster.edu
% 0.13/5.39 % Model : x86_64 x86_64
% 0.13/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.39 % Memory : 8046.5625MB
% 0.13/5.39 % OS : Linux 6.8.0-71-generic
% 0.13/5.39 % CPULimit : 300
% 0.13/5.39 % WCLimit : 300
% 0.13/5.39 % DateTime : Thu Sep 24 18:43:10 UTC 2026
% 0.13/5.39 % CPUTime :
% 0.13/5.39 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.15/6.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.15/6.59 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------