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