%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN058+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 : 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.13s 0.37s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel28_1,axiom,
! [X] :
( big_p(X)
=> ! [Z] : big_q(Z) ),
file('theBenchmark.p',pel28_1) ).
fof(pel28_2,axiom,
( ! [X] :
( big_r(X)
| big_q(X) )
=> ? [X1] :
( big_s(X1)
& big_q(X1) ) ),
file('theBenchmark.p',pel28_2) ).
fof(pel28_3,axiom,
( ? [X] : big_s(X)
=> ! [X1] :
( big_f(X1)
=> big_g(X1) ) ),
file('theBenchmark.p',pel28_3) ).
fof(pel28,conjecture,
! [X] :
( ( big_f(X)
& big_p(X) )
=> big_g(X) ),
file('theBenchmark.p',pel28) ).
fof(f_1_1,plain,
! [X] :
( ! [Z] : big_q(Z)
| ~ big_p(X) ),
inference(fof_nnf,[status(thm)],[pel28_1]) ).
fof(f_1_2,plain,
! [U_1] :
( ! [U_0] : big_q(U_0)
| ~ big_p(U_1) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_1] : ~ big_p(U_1)
| ! [U_0] : big_q(U_0) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ big_p(U_1)
| big_q(U_0) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
( ? [X1] :
( big_s(X1)
& big_q(X1) )
| ? [X] :
( ~ big_r(X)
& ~ big_q(X) ) ),
inference(fof_nnf,[status(thm)],[pel28_2]) ).
fof(f_2_2,plain,
( ? [U_3] :
( big_s(U_3)
& big_q(U_3) )
| ? [U_2] :
( ~ big_r(U_2)
& ~ big_q(U_2) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ? [U_3] :
( big_s(U_3)
& big_q(U_3) )
| ( ~ big_r(sK1)
& ~ big_q(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_2_2]) ).
fof(f_2_4,plain,
( ( big_s(sK2)
& big_q(sK2) )
| ( ~ big_r(sK1)
& ~ big_q(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2)],[f_2_3]) ).
cnf(f_2_5,plain,
( big_q(sK2)
| ~ big_q(sK1) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_6,plain,
( big_s(sK2)
| ~ big_q(sK1) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_7,plain,
( big_q(sK2)
| ~ big_r(sK1) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_8,plain,
( big_s(sK2)
| ~ big_r(sK1) ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
( ! [X1] :
( big_g(X1)
| ~ big_f(X1) )
| ! [X] : ~ big_s(X) ),
inference(fof_nnf,[status(thm)],[pel28_3]) ).
fof(f_3_2,plain,
( ! [U_5] :
( big_g(U_5)
| ~ big_f(U_5) )
| ! [U_4] : ~ big_s(U_4) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( big_g(U_5)
| ~ big_f(U_5)
| ~ big_s(U_4) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,negated_conjecture,
~ ! [X] :
( ( big_f(X)
& big_p(X) )
=> big_g(X) ),
inference(negate,[status(cth)],[pel28]) ).
fof(f_4_2,negated_conjecture,
? [X] :
( ~ big_g(X)
& big_f(X)
& big_p(X) ),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
? [U_6] :
( ~ big_g(U_6)
& big_f(U_6)
& big_p(U_6) ),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
( ~ big_g(sK3)
& big_f(sK3)
& big_p(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3)],[f_4_3]) ).
fof(f_4_5,negated_conjecture,
( ~ big_g(sK3)
& big_f(sK3)
& big_p(sK3) ),
inference(definitional_conversion,[status(esa)],[f_4_4]) ).
cnf(f_4_6,negated_conjecture,
big_p(sK3),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_7,negated_conjecture,
big_f(sK3),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_8,negated_conjecture,
~ big_g(sK3),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN058+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.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 06:23:51 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------