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