%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN921+1 : TPTP v9.3.1. Released v3.1.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 : n012.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:11:12 AM UTC 2026
% Result : Theorem 0.02s 0.31s
% Output : Proof 0.02s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
? [X] :
! [Y] :
( ( p(Y)
=> q(X) )
=> ( p(X)
=> q(X) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ? [X] :
! [Y] :
( ( p(Y)
=> q(X) )
=> ( p(X)
=> q(X) ) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
! [X] :
? [Y] :
( ~ q(X)
& p(X)
& ( q(X)
| ~ p(Y) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_1] :
? [U_0] :
( ~ q(U_1)
& p(U_1)
& ( q(U_1)
| ~ p(U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ! [U_3] : q(U_3)
| ? [U_0] : ~ p(U_0) )
& ! [U_5] : ~ q(U_5)
& ! [U_4] : p(U_4) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ! [U_3] : q(U_3)
| ~ p(sK1) )
& ! [U_5] : ~ q(U_5)
& ! [U_4] : p(U_4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_3] :
( q(U_3)
| ~ p(sK1) )
& ! [U_5] : ~ q(U_5)
& ! [U_4] : p(U_4) ),
inference(definitional_conversion,[status(esa)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
p(U_4),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
~ q(U_5),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_9,negated_conjecture,
( q(U_3)
| ~ p(sK1) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN921+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Sun Sep 20 07:26:52 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.31 % SZS status Theorem for theBenchmark
% 0.02/0.31 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------