%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN060+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n015.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:33:39 PM UTC 2026
% Result : Theorem 0.14s 5.78s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 15 ~; 8 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 8 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] :
( ( big_g(X)
=> ~ big_i(X) )
=> ( big_h(X)
& big_f(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30_2) ).
fof(f1_nnf,plain,
! [X] :
( ( big_h(X)
& big_f(X) )
| ( big_i(X)
& big_g(X) ) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( ( big_h(X)
& big_f(X) )
| ( big_i(X)
& big_g(X) ) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c5,plain,
( big_h(X0)
| big_i(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
fof(f2,conjecture,
! [X] : big_i(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30) ).
fof(f2_neg,negated_conjecture,
~ ! [X] : big_i(X),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f2_nnf,plain,
? [X] : ~ big_i(X),
inference(nnf_transformation,[status(thm)],[f2_neg]) ).
fof(f2_sk,plain,
~ big_i(sk0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).
cnf(c6,plain,
~ big_i(sk0),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p11,plain,
big_h(sk0),
inference(resolution,[status(thm)],[c5,c6]) ).
cnf(c4,plain,
( big_f(X0)
| big_i(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p8,plain,
big_f(sk0),
inference(resolution,[status(thm)],[c4,c6]) ).
fof(f0,axiom,
! [X] :
( ( big_g(X)
| big_f(X) )
=> ~ big_h(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30_1) ).
fof(f0_nnf,plain,
! [X] :
( ~ big_h(X)
| ( ~ big_g(X)
& ~ big_f(X) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] :
( ~ big_h(X)
| ( ~ big_g(X)
& ~ big_f(X) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
~ big_h(sk0),
inference(resolution,[status(thm)],[p8,c0]) ).
cnf(p12,plain,
$false,
inference(resolution,[status(thm)],[p11,p9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN060+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.38 % Computer : n015.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Fri Sep 25 00:03:04 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/5.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.78 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------