%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN385+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 : n007.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.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(x2137,conjecture,
? [X] :
! [Y] :
( big_p(X)
=> ( big_p(Y)
| big_q(X) ) ),
file('theBenchmark.p',x2137) ).
fof(f_1_1,negated_conjecture,
~ ? [X] :
! [Y] :
( big_p(X)
=> ( big_p(Y)
| big_q(X) ) ),
inference(negate,[status(cth)],[x2137]) ).
fof(f_1_2,negated_conjecture,
! [X] :
? [Y] :
( ~ big_p(Y)
& ~ big_q(X)
& big_p(X) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_1] :
? [U_0] :
( ~ big_p(U_0)
& ~ big_q(U_1)
& big_p(U_1) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ! [U_3] : ~ big_q(U_3)
& ? [U_0] : ~ big_p(U_0)
& ! [U_2] : big_p(U_2) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_3] : ~ big_q(U_3)
& ~ big_p(sK1)
& ! [U_2] : big_p(U_2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_3] : ~ big_q(U_3)
& ~ big_p(sK1)
& ! [U_2] : big_p(U_2) ),
inference(definitional_conversion,[status(esa)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
big_p(U_2),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
~ big_p(sK1),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_9,negated_conjecture,
~ big_q(U_3),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN385+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.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 06:28:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------