%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN056+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 : 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 : Thu Sep 24 09:09:20 AM UTC 2026
% Result : Theorem 0.15s 5.61s
% Output : Proof 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel26_1,axiom,
( ? [X] : big_p(X)
<=> ? [Y] : big_q(Y) ),
file('theBenchmark.p',pel26_1) ).
fof(pel26_2,axiom,
! [X,Y] :
( ( big_q(Y)
& big_p(X) )
=> ( big_r(X)
<=> big_s(Y) ) ),
file('theBenchmark.p',pel26_2) ).
fof(pel26,conjecture,
( ! [X] :
( big_p(X)
=> big_r(X) )
<=> ! [Y] :
( big_q(Y)
=> big_s(Y) ) ),
file('theBenchmark.p',pel26) ).
fof(f_1_1,plain,
( ( ? [X] : big_p(X)
| ! [Y] : ~ big_q(Y) )
& ( ? [Y] : big_q(Y)
| ! [X] : ~ big_p(X) ) ),
inference(fof_nnf,[status(thm)],[pel26_1]) ).
fof(f_1_2,plain,
( ( ? [U_3] : big_p(U_3)
| ! [U_2] : ~ big_q(U_2) )
& ( ? [U_1] : big_q(U_1)
| ! [U_0] : ~ big_p(U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ( ? [U_3] : big_p(U_3)
| ! [U_2] : ~ big_q(U_2) )
& ( big_q(sK1)
| ! [U_0] : ~ big_p(U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_2]) ).
fof(f_1_4,plain,
( ( big_p(sK2)
| ! [U_2] : ~ big_q(U_2) )
& ( big_q(sK1)
| ! [U_0] : ~ big_p(U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2)],[f_1_3]) ).
cnf(f_1_5,plain,
( big_q(sK1)
| ~ big_p(U_0) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_6,plain,
( big_p(sK2)
| ~ big_q(U_2) ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_2_1,plain,
! [X,Y] :
( ( ( big_r(X)
| ~ big_s(Y) )
& ( big_s(Y)
| ~ big_r(X) ) )
| ~ big_q(Y)
| ~ big_p(X) ),
inference(fof_nnf,[status(thm)],[pel26_2]) ).
fof(f_2_2,plain,
! [U_5,U_4] :
( ( ( big_r(U_5)
| ~ big_s(U_4) )
& ( big_s(U_4)
| ~ big_r(U_5) ) )
| ~ big_q(U_4)
| ~ big_p(U_5) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( big_s(U_4)
| ~ big_r(U_5)
| ~ big_q(U_4)
| ~ big_p(U_5) ),
inference(clausify,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( big_r(U_5)
| ~ big_s(U_4)
| ~ big_q(U_4)
| ~ big_p(U_5) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,negated_conjecture,
~ ( ! [X] :
( big_p(X)
=> big_r(X) )
<=> ! [Y] :
( big_q(Y)
=> big_s(Y) ) ),
inference(negate,[status(cth)],[pel26]) ).
fof(f_3_2,negated_conjecture,
( ( ? [X] :
( ~ big_r(X)
& big_p(X) )
& ! [Y] :
( big_s(Y)
| ~ big_q(Y) ) )
| ( ? [Y] :
( ~ big_s(Y)
& big_q(Y) )
& ! [X] :
( big_r(X)
| ~ big_p(X) ) ) ),
inference(fof_nnf,[status(thm)],[f_3_1]) ).
fof(f_3_3,negated_conjecture,
( ( ? [U_9] :
( ~ big_r(U_9)
& big_p(U_9) )
& ! [U_8] :
( big_s(U_8)
| ~ big_q(U_8) ) )
| ( ? [U_7] :
( ~ big_s(U_7)
& big_q(U_7) )
& ! [U_6] :
( big_r(U_6)
| ~ big_p(U_6) ) ) ),
inference(variable_rename,[status(thm)],[f_3_2]) ).
fof(f_3_4,negated_conjecture,
( ( ? [U_9] :
( ~ big_r(U_9)
& big_p(U_9) )
& ! [U_8] :
( big_s(U_8)
| ~ big_q(U_8) ) )
| ( ~ big_s(sK3)
& big_q(sK3)
& ! [U_6] :
( big_r(U_6)
| ~ big_p(U_6) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_7,sK3)],[f_3_3]) ).
fof(f_3_5,negated_conjecture,
( ( ~ big_r(sK4)
& big_p(sK4)
& ! [U_8] :
( big_s(U_8)
| ~ big_q(U_8) ) )
| ( ~ big_s(sK3)
& big_q(sK3)
& ! [U_6] :
( big_r(U_6)
| ~ big_p(U_6) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_9,sK4)],[f_3_4]) ).
fof(f_3_6,negated_conjecture,
( ! [U_8] :
( ~ big_r(sK4)
| ~ sP1(U_8) )
& ! [U_8] :
( big_p(sK4)
| ~ sP1(U_8) )
& ! [U_8] :
( big_s(U_8)
| ~ big_q(U_8)
| ~ sP1(U_8) )
& ! [U_6] :
( ~ big_s(sK3)
| ~ sP0(U_6) )
& ! [U_6] :
( big_q(sK3)
| ~ sP0(U_6) )
& ! [U_6] :
( big_r(U_6)
| ~ big_p(U_6)
| ~ sP0(U_6) )
& ! [U_6,U_8] :
( sP1(U_8)
| sP0(U_6) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_3_5]) ).
cnf(f_3_7,negated_conjecture,
( sP1(U_8)
| sP0(U_6) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_8,negated_conjecture,
( big_r(U_6)
| ~ big_p(U_6)
| ~ sP0(U_6) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_9,negated_conjecture,
( big_q(sK3)
| ~ sP0(U_6) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_10,negated_conjecture,
( ~ big_s(sK3)
| ~ sP0(U_6) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_11,negated_conjecture,
( big_s(U_8)
| ~ big_q(U_8)
| ~ sP1(U_8) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_12,negated_conjecture,
( big_p(sK4)
| ~ sP1(U_8) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_13,negated_conjecture,
( ~ big_r(sK4)
| ~ sP1(U_8) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN056+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/5.58 % Computer : n014.cluster.edu
% 0.11/5.58 % Model : x86_64 x86_64
% 0.11/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.58 % Memory : 8046.5625MB
% 0.11/5.58 % OS : Linux 6.8.0-71-generic
% 0.11/5.58 % CPULimit : 300
% 0.11/5.58 % WCLimit : 300
% 0.11/5.58 % DateTime : Sun Sep 20 06:23:56 UTC 2026
% 0.11/5.58 % CPUTime :
% 0.15/5.61 % SZS status Theorem for theBenchmark
% 0.15/5.61 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------