%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN379+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 : n014.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 2.53s 0.77s
% Output : Proof 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 23 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 10 ~; 0 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 31 ( 11 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] : big_p(X)
=> ? [Y] :
( ! [X,Z] : big_q(X,Y,Z)
=> ~ ! [Z] :
( ~ big_q(Y,Y,Z)
& big_p(Z) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2131) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] : big_p(X)
=> ? [Y] :
( ! [X,Z] : big_q(X,Y,Z)
=> ~ ! [Z] :
( ~ big_q(Y,Y,Z)
& big_p(Z) ) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ! [Y] :
( ! [Z] :
( ~ big_q(Y,Y,Z)
& big_p(Z) )
& ! [X,Z] : big_q(X,Y,Z) )
& ! [X] : big_p(X) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y,Z] :
( ~ big_q(Y,Y,Z)
& big_p(Z)
& big_q(X,Y,Z)
& big_p(X) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c1,plain,
big_q(X0,X1,X2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
big_q(X1,X2,X3) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t4,plain,
big_q(X1,X2,X3) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(c3,plain,
~ big_q(X1,X1,X2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
big_q(X1,X1,X2) != true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t4]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN379+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.36 % Computer : n014.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 01:02:03 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.53/0.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/0.77 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------