%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN922+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 : n018.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.09s 0.39s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 153 ( 61 ~; 52 |; 38 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 92 ( 24 sgn 48 !; 16 ?)
% 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)
| ~ p(sK1) )
& ! [U_7] : q(U_7)
& ! [U_6] : p(U_6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,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) )
| ( ( ~ q(sK2)
| ~ p(sK1) )
& ! [U_7] : q(U_7)
& ! [U_6] : p(U_6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ( ? [U_9] : ~ q(U_9)
| ~ p(sK3) )
& ! [U_4] : q(U_4)
& ! [U_3] : p(U_3) )
| ( ( ~ q(sK2)
| ~ p(sK1) )
& ! [U_7] : q(U_7)
& ! [U_6] : p(U_6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_8,sK3)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ( ~ q(sK4)
| ~ p(sK3) )
& ! [U_4] : q(U_4)
& ! [U_3] : p(U_3) )
| ( ( ~ q(sK2)
| ~ p(sK1) )
& ! [U_7] : q(U_7)
& ! [U_6] : p(U_6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_9,sK4)],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ! [U_4,U_3] :
( ~ q(sK4)
| ~ p(sK3)
| ~ sP1(U_4,U_3) )
& ! [U_4,U_3] :
( q(U_4)
| ~ sP1(U_4,U_3) )
& ! [U_4,U_3] :
( p(U_3)
| ~ sP1(U_4,U_3) )
& ! [U_6,U_7] :
( ~ q(sK2)
| ~ p(sK1)
| ~ sP0(U_6,U_7) )
& ! [U_6,U_7] :
( q(U_7)
| ~ sP0(U_6,U_7) )
& ! [U_6,U_7] :
( p(U_6)
| ~ sP0(U_6,U_7) )
& ! [U_4,U_3,U_6,U_7] :
( sP1(U_4,U_3)
| sP0(U_6,U_7) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( sP1(U_4,U_3)
| sP0(U_6,U_7) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( p(U_6)
| ~ sP0(U_6,U_7) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_12,negated_conjecture,
( q(U_7)
| ~ sP0(U_6,U_7) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_13,negated_conjecture,
( ~ q(sK2)
| ~ p(sK1)
| ~ sP0(U_6,U_7) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_14,negated_conjecture,
( p(U_3)
| ~ sP1(U_4,U_3) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_15,negated_conjecture,
( q(U_4)
| ~ sP1(U_4,U_3) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_16,negated_conjecture,
( ~ q(sK4)
| ~ p(sK3)
| ~ sP1(U_4,U_3) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(t1,plain,
( ~ p(sK1)
| ~ q(sK2)
| ~ sP0(U_92,U_93) ),
inference(start,[status(thm),parent(0:0)],[f_1_13]) ).
cnf(t2,plain,
( sP1(sK4,sK3)
| sP0(U_92,U_93) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_10]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ p(sK3)
| ~ q(sK4)
| ~ sP1(sK4,sK3) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_16]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ sP1(sK4,sK3)
| q(sK4) ),
inference(extension,[status(thm),parent(t4:2)],[f_1_15]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
$false,
inference(reduction,[status(thm),parent(t6:2)],[t6:2,t2:2]) ).
cnf(t9,plain,
( ~ sP1(sK4,sK3)
| p(sK3) ),
inference(extension,[status(thm),parent(t4:3)],[f_1_14]) ).
cnf(t10,plain,
$false,
inference(connection,[status(thm),parent(t9:1)],[t9:1,t4:3]) ).
cnf(t11,plain,
$false,
inference(reduction,[status(thm),parent(t9:2)],[t9:2,t2:2]) ).
cnf(t12,plain,
( ~ sP1(sK2,U_107)
| q(sK2) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_15]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t1:2]) ).
cnf(t14,plain,
( sP0(U_108,sK2)
| sP1(sK2,U_107) ),
inference(extension,[status(thm),parent(t12:2)],[f_1_10]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( q(sK2)
| ~ sP0(U_108,sK2) ),
inference(extension,[status(thm),parent(t14:2)],[f_1_12]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
$false,
inference(reduction,[status(thm),parent(t16:2)],[t16:2,t1:2]) ).
cnf(t19,plain,
( ~ sP1(U_114,sK1)
| p(sK1) ),
inference(extension,[status(thm),parent(t1:3)],[f_1_14]) ).
cnf(t20,plain,
$false,
inference(connection,[status(thm),parent(t19:1)],[t19:1,t1:3]) ).
cnf(t21,plain,
( sP0(sK1,U_117)
| sP1(U_114,sK1) ),
inference(extension,[status(thm),parent(t19:2)],[f_1_10]) ).
cnf(t22,plain,
$false,
inference(connection,[status(thm),parent(t21:1)],[t21:1,t19:2]) ).
cnf(t23,plain,
( p(sK1)
| ~ sP0(sK1,U_117) ),
inference(extension,[status(thm),parent(t21:2)],[f_1_11]) ).
cnf(t24,plain,
$false,
inference(connection,[status(thm),parent(t23:1)],[t23:1,t21:2]) ).
cnf(t25,plain,
$false,
inference(reduction,[status(thm),parent(t23:2)],[t23:2,t1:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN922+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % 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.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 07:29:12 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.39 % SZS status Theorem for theBenchmark
% 0.09/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------