%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN940+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 : n009.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:14 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 55 ( 27 unt; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 137 ( 57 ~; 48 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 98 ( 33 sgn 36 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [B,C] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( q(X)
& ( p(f(Y))
=> ( ( r(Y)
=> ( r(C)
& r(B) ) )
& p(X) ) ) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ! [B,C] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( q(X)
& ( p(f(Y))
=> ( ( r(Y)
=> ( r(C)
& r(B) ) )
& p(X) ) ) ) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
? [B,C] :
( ! [X,Y] :
( ~ q(X)
| ( ( ( ( ~ r(C)
| ~ r(B) )
& r(Y) )
| ~ p(X) )
& p(f(Y)) ) )
& ! [Z] : q(f(Z)) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
? [U_4,U_3] :
( ! [U_2,U_1] :
( ~ q(U_2)
| ( ( ( ( ~ r(U_3)
| ~ r(U_4) )
& r(U_1) )
| ~ p(U_2) )
& p(f(U_1)) ) )
& ! [U_0] : q(f(U_0)) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_4,U_3] :
! [U_2] :
( ( ( ( ! [U_6] : r(U_6)
& ( ~ r(U_3)
| ~ r(U_4) ) )
| ~ p(U_2) )
& ! [U_5] : p(f(U_5)) )
| ~ q(U_2) )
& ! [U_0] : q(f(U_0)) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_3] :
! [U_2] :
( ( ( ( ! [U_6] : r(U_6)
& ( ~ r(U_3)
| ~ r(sK1) ) )
| ~ p(U_2) )
& ! [U_5] : p(f(U_5)) )
| ~ q(U_2) )
& ! [U_0] : q(f(U_0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_4,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_2] :
( ( ( ( ! [U_6] : r(U_6)
& ( ~ r(sK2)
| ~ r(sK1) ) )
| ~ p(U_2) )
& ! [U_5] : p(f(U_5)) )
| ~ q(U_2) )
& ! [U_0] : q(f(U_0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_6] :
( r(U_6)
| ~ sP0(U_6) )
& ! [U_6] :
( ~ r(sK2)
| ~ r(sK1)
| ~ sP0(U_6) )
& ! [U_6,U_2,U_5] :
( sP0(U_6)
| ~ p(U_2)
| ~ sP1(U_6,U_2,U_5) )
& ! [U_6,U_2,U_5] :
( p(f(U_5))
| ~ sP1(U_6,U_2,U_5) )
& ! [U_6,U_2,U_5] :
( sP1(U_6,U_2,U_5)
| ~ q(U_2) )
& ! [U_0] : q(f(U_0)) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
q(f(U_0)),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
( sP1(U_6,U_2,U_5)
| ~ q(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_10,negated_conjecture,
( p(f(U_5))
| ~ sP1(U_6,U_2,U_5) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_11,negated_conjecture,
( sP0(U_6)
| ~ p(U_2)
| ~ sP1(U_6,U_2,U_5) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_12,negated_conjecture,
( ~ r(sK2)
| ~ r(sK1)
| ~ sP0(U_6) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_13,negated_conjecture,
( r(U_6)
| ~ sP0(U_6) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
( ~ r(sK1)
| ~ r(sK2)
| ~ sP0(U_80) ),
inference(start,[status(thm),parent(0:0)],[f_1_12]) ).
cnf(t2,plain,
( ~ p(f(U_88))
| ~ sP1(U_80,f(U_88),U_81)
| sP0(U_80) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_11]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ q(f(U_88))
| sP1(U_80,f(U_88),U_81) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_9]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
q(f(U_88)),
inference(extension,[status(thm),parent(t4:2)],[f_1_8]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ sP1(U_87,f(U_89),U_88)
| p(f(U_88)) ),
inference(extension,[status(thm),parent(t2:3)],[f_1_10]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
( ~ q(f(U_89))
| sP1(U_87,f(U_89),U_88) ),
inference(extension,[status(thm),parent(t8:2)],[f_1_9]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
q(f(U_89)),
inference(extension,[status(thm),parent(t10:2)],[f_1_8]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( ~ sP0(sK2)
| r(sK2) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_13]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t1:2]) ).
cnf(t16,plain,
( ~ p(f(U_103))
| ~ sP1(sK2,f(U_103),U_96)
| sP0(sK2) ),
inference(extension,[status(thm),parent(t14:2)],[f_1_11]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
( ~ q(f(U_103))
| sP1(sK2,f(U_103),U_96) ),
inference(extension,[status(thm),parent(t16:2)],[f_1_9]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
q(f(U_103)),
inference(extension,[status(thm),parent(t18:2)],[f_1_8]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
( ~ sP1(U_102,f(U_104),U_103)
| p(f(U_103)) ),
inference(extension,[status(thm),parent(t16:3)],[f_1_10]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t16:3]) ).
cnf(t24,plain,
( ~ q(f(U_104))
| sP1(U_102,f(U_104),U_103) ),
inference(extension,[status(thm),parent(t22:2)],[f_1_9]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).
cnf(t26,plain,
q(f(U_104)),
inference(extension,[status(thm),parent(t24:2)],[f_1_8]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).
cnf(t28,plain,
( ~ sP0(sK1)
| r(sK1) ),
inference(extension,[status(thm),parent(t1:3)],[f_1_13]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t1:3]) ).
cnf(t30,plain,
( ~ p(f(U_118))
| ~ sP1(sK1,f(U_118),U_111)
| sP0(sK1) ),
inference(extension,[status(thm),parent(t28:2)],[f_1_11]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).
cnf(t32,plain,
( ~ q(f(U_118))
| sP1(sK1,f(U_118),U_111) ),
inference(extension,[status(thm),parent(t30:2)],[f_1_9]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).
cnf(t34,plain,
q(f(U_118)),
inference(extension,[status(thm),parent(t32:2)],[f_1_8]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t32:2]) ).
cnf(t36,plain,
( ~ sP1(U_117,f(U_119),U_118)
| p(f(U_118)) ),
inference(extension,[status(thm),parent(t30:3)],[f_1_10]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t30:3]) ).
cnf(t38,plain,
( ~ q(f(U_119))
| sP1(U_117,f(U_119),U_118) ),
inference(extension,[status(thm),parent(t36:2)],[f_1_9]) ).
cnf(t39,plain,
$false,
inference(connection,[status(thm),parent(t38:1)],[t38:1,t36:2]) ).
cnf(t40,plain,
q(f(U_119)),
inference(extension,[status(thm),parent(t38:2)],[f_1_8]) ).
cnf(t41,plain,
$false,
inference(connection,[status(thm),parent(t40:1)],[t40:1,t38:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN940+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.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 07:29:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------