%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN733+1 : TPTP v9.3.1. Released v2.5.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 : n008.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:59 AM UTC 2026
% Result : Theorem 0.10s 5.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(y2141,conjecture,
( ! [X] :
? [Y] :
( ( q(X)
| q(Y) )
& p(X) )
=> ? [Z] :
( q(Z)
& p(Z) ) ),
file('theBenchmark.p',y2141) ).
fof(f_1_1,negated_conjecture,
( ~ ? [Z] :
( q(Z)
& p(Z) )
& ! [X] :
? [Y] :
( ( q(X)
| q(Y) )
& p(X) ) ),
inference(negate,[status(cth)],[y2141]) ).
fof(f_1_2,negated_conjecture,
( ! [Z] :
( ~ q(Z)
| ~ p(Z) )
& ! [X] :
? [Y] :
( ( q(X)
| q(Y) )
& p(X) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ! [U_2] :
( ~ q(U_2)
| ~ p(U_2) )
& ! [U_1] :
? [U_0] :
( ( q(U_1)
| q(U_0) )
& p(U_1) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ! [U_2] :
( ~ q(U_2)
| ~ p(U_2) )
& ( ! [U_4] : q(U_4)
| ? [U_0] : q(U_0) )
& ! [U_3] : p(U_3) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_2] :
( ~ q(U_2)
| ~ p(U_2) )
& ( ! [U_4] : q(U_4)
| q(sK1) )
& ! [U_3] : p(U_3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_2] :
( ~ q(U_2)
| ~ p(U_2) )
& ! [U_4] :
( q(U_4)
| q(sK1) )
& ! [U_3] : p(U_3) ),
inference(definitional_conversion,[status(esa)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
p(U_3),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( q(U_4)
| q(sK1) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_9,negated_conjecture,
( ~ q(U_2)
| ~ p(U_2) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN733+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03 % 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/5.37 % Computer : n008.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sun Sep 20 07:08:29 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.39 % SZS status Theorem for theBenchmark
% 0.10/5.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------