%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN049+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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 : Thu Sep 24 09:09:18 AM UTC 2026
% Result : Theorem 0.11s 0.60s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 8 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 2 sgn 14 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel19,conjecture,
? [X] :
! [Y,Z] :
( ( big_p(Y)
=> big_q(Z) )
=> ( big_p(X)
=> big_q(X) ) ),
file('theBenchmark.p',pel19) ).
fof(f_1_1,negated_conjecture,
~ ? [X] :
! [Y,Z] :
( ( big_p(Y)
=> big_q(Z) )
=> ( big_p(X)
=> big_q(X) ) ),
inference(negate,[status(cth)],[pel19]) ).
fof(f_1_2,negated_conjecture,
! [X] :
? [Y,Z] :
( ~ big_q(X)
& big_p(X)
& ( big_q(Z)
| ~ big_p(Y) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_2] :
? [U_1,U_0] :
( ~ big_q(U_2)
& big_p(U_2)
& ( big_q(U_0)
| ~ big_p(U_1) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ! [U_4] : ~ big_q(U_4)
& ! [U_3] : big_p(U_3)
& ( ? [U_1] : ~ big_p(U_1)
| ? [U_0] : big_q(U_0) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_4] : ~ big_q(U_4)
& ! [U_3] : big_p(U_3)
& ( ? [U_1] : ~ big_p(U_1)
| big_q(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_4] : ~ big_q(U_4)
& ! [U_3] : big_p(U_3)
& ( ~ big_p(sK2)
| big_q(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_4] : ~ big_q(U_4)
& ! [U_3] : big_p(U_3)
& ( ~ big_p(sK2)
| big_q(sK1) ) ),
inference(definitional_conversion,[status(esa)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( ~ big_p(sK2)
| big_q(sK1) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
big_p(U_3),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_10,negated_conjecture,
~ big_q(U_4),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
~ big_q(sK1),
inference(start,[status(thm),parent(0:0)],[f_1_10]) ).
cnf(t2,plain,
( ~ big_p(sK2)
| big_q(sK1) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_8]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
big_p(sK2),
inference(extension,[status(thm),parent(t2:2)],[f_1_9]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN049+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.57 % Computer : n002.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Sun Sep 20 06:25:48 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.60 % SZS status Theorem for theBenchmark
% 0.11/0.60 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------