%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN066+1 : TPTP v9.3.1. Bugfixed v3.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 : 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:23 AM UTC 2026
% Result : Theorem 0.11s 5.39s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel37_1,axiom,
! [Z] :
? [W] :
! [X] :
? [Y] :
( ( big_p(Y,W)
=> ? [U] : big_q(U,W) )
& big_p(Y,Z)
& ( big_p(X,Z)
=> big_p(Y,W) ) ),
file('theBenchmark.p',pel37_1) ).
fof(pel37_2,axiom,
! [X,Z] :
( ~ big_p(X,Z)
=> ? [Y] : big_q(Y,Z) ),
file('theBenchmark.p',pel37_2) ).
fof(pel37_3,axiom,
( ? [X,Y] : big_q(X,Y)
=> ! [Z] : big_r(Z,Z) ),
file('theBenchmark.p',pel37_3) ).
fof(pel37,conjecture,
! [X] :
? [Y] : big_r(X,Y),
file('theBenchmark.p',pel37) ).
fof(f_1_1,plain,
! [Z] :
? [W] :
! [X] :
? [Y] :
( ( ? [U] : big_q(U,W)
| ~ big_p(Y,W) )
& big_p(Y,Z)
& ( big_p(Y,W)
| ~ big_p(X,Z) ) ),
inference(fof_nnf,[status(thm)],[pel37_1]) ).
fof(f_1_2,plain,
! [U_4] :
? [U_3] :
! [U_2] :
? [U_1] :
( ( ? [U_0] : big_q(U_0,U_3)
| ~ big_p(U_1,U_3) )
& big_p(U_1,U_4)
& ( big_p(U_1,U_3)
| ~ big_p(U_2,U_4) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_4,U_2] :
? [U_1] :
( ( ? [U_0] : big_q(U_0,sK1(U_4))
| ~ big_p(U_1,sK1(U_4)) )
& big_p(U_1,U_4)
& ( big_p(U_1,sK1(U_4))
| ~ big_p(U_2,U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1(U_4))],[f_1_2]) ).
fof(f_1_4,plain,
! [U_4,U_2] :
( ( ? [U_0] : big_q(U_0,sK1(U_4))
| ~ big_p(sK2(U_4,U_2),sK1(U_4)) )
& big_p(sK2(U_4,U_2),U_4)
& ( big_p(sK2(U_4,U_2),sK1(U_4))
| ~ big_p(U_2,U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2(U_4,U_2))],[f_1_3]) ).
fof(f_1_5,plain,
! [U_4,U_2] :
( ( big_q(sK3(U_4,U_2),sK1(U_4))
| ~ big_p(sK2(U_4,U_2),sK1(U_4)) )
& big_p(sK2(U_4,U_2),U_4)
& ( big_p(sK2(U_4,U_2),sK1(U_4))
| ~ big_p(U_2,U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_0,sK3(U_4,U_2))],[f_1_4]) ).
cnf(f_1_6,plain,
( big_p(sK2(U_4,U_2),sK1(U_4))
| ~ big_p(U_2,U_4) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,plain,
big_p(sK2(U_4,U_2),U_4),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,plain,
( big_q(sK3(U_4,U_2),sK1(U_4))
| ~ big_p(sK2(U_4,U_2),sK1(U_4)) ),
inference(clausify,[status(thm)],[f_1_5]) ).
fof(f_2_1,plain,
! [X,Z] :
( ? [Y] : big_q(Y,Z)
| big_p(X,Z) ),
inference(fof_nnf,[status(thm)],[pel37_2]) ).
fof(f_2_2,plain,
! [U_7,U_6] :
( ? [U_5] : big_q(U_5,U_6)
| big_p(U_7,U_6) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
! [U_7,U_6] :
( big_q(sK4(U_7,U_6),U_6)
| big_p(U_7,U_6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_5,sK4(U_7,U_6))],[f_2_2]) ).
cnf(f_2_4,plain,
( big_q(sK4(U_7,U_6),U_6)
| big_p(U_7,U_6) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
( ! [Z] : big_r(Z,Z)
| ! [X,Y] : ~ big_q(X,Y) ),
inference(fof_nnf,[status(thm)],[pel37_3]) ).
fof(f_3_2,plain,
( ! [U_10] : big_r(U_10,U_10)
| ! [U_9,U_8] : ~ big_q(U_9,U_8) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( big_r(U_10,U_10)
| ~ big_q(U_9,U_8) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,negated_conjecture,
~ ! [X] :
? [Y] : big_r(X,Y),
inference(negate,[status(cth)],[pel37]) ).
fof(f_4_2,negated_conjecture,
? [X] :
! [Y] : ~ big_r(X,Y),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
? [U_12] :
! [U_11] : ~ big_r(U_12,U_11),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
! [U_11] : ~ big_r(sK5,U_11),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_12,sK5)],[f_4_3]) ).
fof(f_4_5,negated_conjecture,
! [U_11] : ~ big_r(sK5,U_11),
inference(definitional_conversion,[status(esa)],[f_4_4]) ).
cnf(f_4_6,negated_conjecture,
~ big_r(sK5,U_11),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN066+1 : TPTP v9.3.1. Bugfixed v3.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.11/5.36 % Computer : n002.cluster.edu
% 0.11/5.36 % Model : x86_64 x86_64
% 0.11/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.36 % Memory : 8046.5625MB
% 0.11/5.36 % OS : Linux 6.8.0-71-generic
% 0.11/5.36 % CPULimit : 300
% 0.11/5.36 % WCLimit : 300
% 0.11/5.36 % DateTime : Sun Sep 20 06:26:08 UTC 2026
% 0.11/5.37 % CPUTime :
% 0.11/5.39 % SZS status Theorem for theBenchmark
% 0.11/5.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------