%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN378+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 : n020.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:33 PM UTC 2026
% Result : Theorem 5.15s 1.12s
% Output : Proof 5.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 14 unt; 0 def)
% Number of atoms : 30 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 8 ~; 2 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn 6 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] : big_p(X)
=> ( ? [Z] :
( big_p(Z)
=> big_q(Z) )
| ~ ? [Y] : big_q(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2130) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] : big_p(X)
=> ( ? [Z] :
( big_p(Z)
=> big_q(Z) )
| ~ ? [Y] : big_q(Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ! [Z] :
( ~ big_q(Z)
& big_p(Z) )
& ? [Y] : big_q(Y)
& ! [X] : big_p(X) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Z] :
( ~ big_q(Z)
& big_p(Z)
& big_q(sk0)
& big_p(X) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c3,plain,
~ big_q(X2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t4,plain,
eq(big_q(X1),true) = efalse,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t8,plain,
eq(big_q(X1),true) = efalse,
inference(orient,[status(thm)],[t4]) ).
cnf(c1,plain,
big_q(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
big_q(sk0) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t6,plain,
big_q(sk0) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t9,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t8,t6]) ).
cnf(t3,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t7,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t3]) ).
cnf(t13,plain,
efalse = etrue,
inference(step,[status(thm)],[t9,t7]) ).
cnf(t10,plain,
efalse = etrue,
inference(orient,[status(thm)],[t13]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t10]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN378+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/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 01:03:03 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.15/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.15/1.12 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------