%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN385+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n016.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:34:34 PM UTC 2026
% Result : Theorem 3.24s 0.84s
% Output : Proof 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 28 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 2 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 20 ( 9 sgn 4 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
? [X] :
! [Y] :
( big_p(X)
=> ( big_p(Y)
| big_q(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2137) ).
fof(f0_neg,negated_conjecture,
~ ? [X] :
! [Y] :
( big_p(X)
=> ( big_p(Y)
| big_q(X) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
! [X] :
? [Y] :
( ~ big_p(Y)
& ~ big_q(X)
& big_p(X) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ~ big_p(sk0(X))
& ~ big_q(X)
& big_p(X) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c2,plain,
~ big_p(sk0(X0)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t3,plain,
ifeq(big_p(sk0(X1)),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t5,plain,
ifeq(big_p(sk0(X1)),true,false,true) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(c0,plain,
big_p(X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
big_p(X1) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t7,plain,
big_p(X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t11,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t5,t7]) ).
cnf(t1,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t4,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t1]) ).
cnf(t12,plain,
false = true,
inference(step,[status(thm)],[t11,t4]) ).
cnf(t8,plain,
false = true,
inference(rw,[status(thm)],[t12]) ).
cnf(t9,plain,
false = true,
inference(orient,[status(thm)],[t8]) ).
cnf(c1,plain,
~ big_q(X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1,c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t9]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN385+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 01:07:43 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.24/0.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.24/0.84 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------