%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN924+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 : n010.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.03s 0.38s
% Output : Proof 0.03s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X] :
( q(X)
| p(X) )
<=> ( ? [X] : q(X)
| ? [X] : p(X) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ( ? [X] :
( q(X)
| p(X) )
<=> ( ? [X] : q(X)
| ? [X] : p(X) ) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
( ( ! [X] :
( ~ q(X)
& ~ p(X) )
& ( ? [X] : q(X)
| ? [X] : p(X) ) )
| ( ! [X] : ~ q(X)
& ! [X] : ~ p(X)
& ? [X] :
( q(X)
| p(X) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ! [U_5] :
( ~ q(U_5)
& ~ p(U_5) )
& ( ? [U_4] : q(U_4)
| ? [U_3] : p(U_3) ) )
| ( ! [U_2] : ~ q(U_2)
& ! [U_1] : ~ p(U_1)
& ? [U_0] :
( q(U_0)
| p(U_0) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ! [U_9] : ~ q(U_9)
& ! [U_8] : ~ p(U_8)
& ( ? [U_4] : q(U_4)
| ? [U_3] : p(U_3) ) )
| ( ! [U_2] : ~ q(U_2)
& ! [U_1] : ~ p(U_1)
& ( ? [U_7] : q(U_7)
| ? [U_6] : p(U_6) ) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ! [U_9] : ~ q(U_9)
& ! [U_8] : ~ p(U_8)
& ( ? [U_4] : q(U_4)
| ? [U_3] : p(U_3) ) )
| ( ! [U_2] : ~ q(U_2)
& ! [U_1] : ~ p(U_1)
& ( ? [U_7] : q(U_7)
| p(sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ! [U_9] : ~ q(U_9)
& ! [U_8] : ~ p(U_8)
& ( ? [U_4] : q(U_4)
| ? [U_3] : p(U_3) ) )
| ( ! [U_2] : ~ q(U_2)
& ! [U_1] : ~ p(U_1)
& ( q(sK2)
| p(sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_7,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ! [U_9] : ~ q(U_9)
& ! [U_8] : ~ p(U_8)
& ( ? [U_4] : q(U_4)
| p(sK3) ) )
| ( ! [U_2] : ~ q(U_2)
& ! [U_1] : ~ p(U_1)
& ( q(sK2)
| p(sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_3,sK3)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ! [U_9] : ~ q(U_9)
& ! [U_8] : ~ p(U_8)
& ( q(sK4)
| p(sK3) ) )
| ( ! [U_2] : ~ q(U_2)
& ! [U_1] : ~ p(U_1)
& ( q(sK2)
| p(sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_4,sK4)],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ! [U_9,U_8] :
( ~ q(U_9)
| ~ sP1(U_9,U_8) )
& ! [U_9,U_8] :
( ~ p(U_8)
| ~ sP1(U_9,U_8) )
& ! [U_9,U_8] :
( q(sK4)
| p(sK3)
| ~ sP1(U_9,U_8) )
& ! [U_2,U_1] :
( ~ q(U_2)
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( ~ p(U_1)
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( q(sK2)
| p(sK1)
| ~ sP0(U_2,U_1) )
& ! [U_9,U_2,U_1,U_8] :
( sP1(U_9,U_8)
| sP0(U_2,U_1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( sP1(U_9,U_8)
| sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( q(sK2)
| p(sK1)
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_12,negated_conjecture,
( ~ p(U_1)
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_13,negated_conjecture,
( ~ q(U_2)
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_14,negated_conjecture,
( q(sK4)
| p(sK3)
| ~ sP1(U_9,U_8) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_15,negated_conjecture,
( ~ p(U_8)
| ~ sP1(U_9,U_8) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_16,negated_conjecture,
( ~ q(U_9)
| ~ sP1(U_9,U_8) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN924+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.10/0.35 % Computer : n010.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Sun Sep 20 07:29:08 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.38 % SZS status Theorem for theBenchmark
% 0.03/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------