%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV048+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 : n017.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:07 PM UTC 2026
% Result : Theorem 31.19s 9.45s
% Output : Proof 31.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 76 ( 38 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 83 ( 32 ~; 23 |; 22 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 10 con; 0-3 aty)
% Number of variables : 4 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f38,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f38_nnf,plain,
! [X] : minus(X,n1) = pred(X),
inference(nnf_transformation,[status(thm)],[f38]) ).
fof(f38_sk,plain,
! [X] : minus(X,n1) = pred(X),
inference(skolemisation,[status(esa)],[f38_nnf]) ).
cnf(c234,plain,
minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(esa)],[f38_sk]) ).
fof(f52,conjecture,
( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).
fof(f52_neg,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ( ( ~ true
& n0 = pv78 )
| ( ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
& n0 != pv78 ) )
& leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
( ( ( ~ true
& n0 = pv78 )
| ( ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
& n0 != pv78 ) )
& leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
inference(skolemisation,[status(esa)],[f52_nnf]) ).
cnf(c260,plain,
( n0 = pv78
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p310,plain,
( n0 = pv78
| ~ leq(pv35,pred(n5))
| ~ leq(n0,pv35)
| pv78 != sum(n0,pred(n135300),a_select3(q,pv79,pv35))
| n0 != n0 ),
inference(superposition,[status(thm)],[c234,c260]) ).
cnf(p311,plain,
( n0 = pv78
| ~ leq(pv35,pred(n5))
| ~ leq(n0,pv35)
| pv78 != sum(n0,pred(n135300),a_select3(q,pv79,pv35)) ),
inference(equality_resolution,[status(thm)],[p310]) ).
cnf(c255,plain,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p308,plain,
pv78 = sum(n0,pred(n135300),a_select3(q,pv79,pv35)),
inference(superposition,[status(thm)],[c234,c255]) ).
cnf(p312,plain,
( n0 = pv78
| ~ leq(pv35,pred(n5))
| ~ leq(n0,pv35) ),
inference(resolution,[status(thm)],[p311,p308]) ).
cnf(c256,plain,
leq(n0,pv35),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p313,plain,
( n0 = pv78
| ~ leq(pv35,pred(n5)) ),
inference(resolution,[status(thm)],[p312,c256]) ).
cnf(c257,plain,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p309,plain,
leq(pv35,pred(n5)),
inference(superposition,[status(thm)],[c234,c257]) ).
cnf(p314,plain,
n0 = pv78,
inference(resolution,[status(thm)],[p313,p309]) ).
cnf(c259,plain,
( ~ true
| n0 != pv78 ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p315,plain,
~ true,
inference(resolution,[status(thm)],[p314,c259]) ).
fof(f50,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).
fof(f50_nnf,plain,
true,
inference(nnf_transformation,[status(thm)],[f50]) ).
cnf(c253,plain,
true,
inference(cnf_transformation,[status(esa)],[f50_nnf]) ).
cnf(p317,plain,
$false,
inference(resolution,[status(thm)],[p315,c253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV048+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/5.37 % Computer : n017.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Thu Sep 24 18:20:08 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 31.19/9.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.19/9.45 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------