%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN384+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 : n006.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:14 AM UTC 2026
% Result : Theorem 0.09s 5.39s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 0 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 2 sgn 20 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2136,conjecture,
! [Z] :
? [X,Y] :
! [U] :
( big_p(X,Y,Z)
=> big_p(U,X,X) ),
file('theBenchmark.p',x2136) ).
fof(f_1_1,negated_conjecture,
~ ! [Z] :
? [X,Y] :
! [U] :
( big_p(X,Y,Z)
=> big_p(U,X,X) ),
inference(negate,[status(cth)],[x2136]) ).
fof(f_1_2,negated_conjecture,
? [Z] :
! [X,Y] :
? [U] :
( ~ big_p(U,X,X)
& big_p(X,Y,Z) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
? [U_3] :
! [U_2,U_1] :
? [U_0] :
( ~ big_p(U_0,U_2,U_2)
& big_p(U_2,U_1,U_3) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_3] :
! [U_5,U_1] : big_p(U_5,U_1,U_3)
& ! [U_4] :
? [U_0] : ~ big_p(U_0,U_4,U_4) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_3] :
! [U_5,U_1] : big_p(U_5,U_1,U_3)
& ! [U_4] : ~ big_p(sK1(U_4),U_4,U_4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_4))],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_5,U_1] : big_p(U_5,U_1,sK2)
& ! [U_4] : ~ big_p(sK1(U_4),U_4,U_4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_1,U_5] : big_p(U_5,U_1,sK2)
& ! [U_4] : ~ big_p(sK1(U_4),U_4,U_4) ),
inference(definitional_conversion,[status(esa)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
~ big_p(sK1(U_4),U_4,U_4),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
big_p(U_5,U_1,sK2),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
~ big_p(sK1(sK2),sK2,sK2),
inference(start,[status(thm),parent(0:0)],[f_1_8]) ).
cnf(t2,plain,
big_p(sK1(sK2),sK2,sK2),
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]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN384+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.09/5.37 % Computer : n006.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sun Sep 20 06:30:33 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.39 % SZS status Theorem for theBenchmark
% 0.09/5.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------