%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV041+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.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:11:56 PM UTC 2026
% Result : Theorem 58.11s 8.85s
% Output : Proof 58.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 63 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 19 ~; 12 |; 21 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-3 aty)
% Number of variables : 31 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X,Y,Z] :
( ( leq(Y,Z)
& leq(X,Y) )
=> leq(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f4_nnf,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
fof(f52,conjecture,
( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [A] :
( ( leq(A,n2)
& leq(n0,A) )
=> ! [B] :
( ( leq(B,minus(n0,n1))
& leq(n0,B) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),B,A) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).
fof(f52_neg,negated_conjecture,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [A] :
( ( leq(A,n2)
& leq(n0,A) )
=> ! [B] :
( ( leq(B,minus(n0,n1))
& leq(n0,B) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),B,A) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ? [A] :
( ? [B] :
( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),B,A) != init
& leq(B,minus(n0,n1))
& leq(n0,B) )
& leq(A,n2)
& leq(n0,A) )
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sk28,sk27) != init
& leq(sk28,minus(n0,n1))
& leq(n0,sk28)
& leq(sk27,n2)
& leq(n0,sk27)
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk27,sk28])],[f52_nnf]) ).
cnf(c259,plain,
leq(n0,sk28),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p318,plain,
( leq(n0,X0)
| ~ leq(sk28,X0) ),
inference(resolution,[status(thm)],[c4,c259]) ).
cnf(c260,plain,
leq(sk28,minus(n0,n1)),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p14047,plain,
leq(n0,tptp_minus_1),
inference(resolution,[status(thm)],[p318,c260]) ).
fof(f12,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f12_nnf,plain,
! [X,Y] :
( ( ~ gt(succ(Y),X)
| leq(X,Y) )
& ( gt(succ(Y),X)
| ~ leq(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [X,Y] :
( ( ~ gt(succ(Y),X)
| leq(X,Y) )
& ( gt(succ(Y),X)
| ~ leq(X,Y) ) ),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c15,plain,
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p14055,plain,
gt(n0,n0),
inference(resolution,[status(thm)],[p14047,c15]) ).
fof(f2,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/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]) ).
cnf(p14189,plain,
$false,
inference(resolution,[status(thm)],[p14055,c2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV041+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 18:24:51 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 58.11/8.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 58.11/8.85 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------