%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN939+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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.14s 0.40s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 46 ( 21 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 131 ( 54 ~; 45 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 55 ( 6 sgn 30 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [C,B] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( q(X)
& ( r(Y)
=> ( r(C)
& r(B) ) )
& ( p(f(Y))
=> p(X) ) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ! [C,B] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( q(X)
& ( r(Y)
=> ( r(C)
& r(B) ) )
& ( p(f(Y))
=> p(X) ) ) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
? [C,B] :
( ! [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_4)
| ~ r(U_3) )
& 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_1] :
( ( ( ~ r(U_4)
| ~ r(U_3) )
& r(U_1) )
| ( ~ p(U_2)
& p(f(U_1)) ) )
| ~ 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_1] :
( ( ( ~ r(sK1)
| ~ r(U_3) )
& r(U_1) )
| ( ~ p(U_2)
& p(f(U_1)) ) )
| ~ 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_1] :
( ( ( ~ r(sK1)
| ~ r(sK2) )
& r(U_1) )
| ( ~ p(U_2)
& p(f(U_1)) ) )
| ~ 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_1] :
( ~ r(sK1)
| ~ r(sK2)
| ~ sP1(U_1) )
& ! [U_1] :
( r(U_1)
| ~ sP1(U_1) )
& ! [U_2,U_1] :
( ~ p(U_2)
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( p(f(U_1))
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( sP1(U_1)
| sP0(U_2,U_1)
| ~ 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_1)
| sP0(U_2,U_1)
| ~ q(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_10,negated_conjecture,
( p(f(U_1))
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_11,negated_conjecture,
( ~ p(U_2)
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_12,negated_conjecture,
( r(U_1)
| ~ sP1(U_1) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_13,negated_conjecture,
( ~ r(sK1)
| ~ r(sK2)
| ~ sP1(U_1) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
( ~ r(sK2)
| ~ r(sK1)
| ~ sP1(U_55) ),
inference(start,[status(thm),parent(0:0)],[f_1_13]) ).
cnf(t2,plain,
( sP0(f(U_55),U_55)
| ~ q(f(U_55))
| sP1(U_55) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_9]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
q(f(U_55)),
inference(extension,[status(thm),parent(t2:2)],[f_1_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ p(f(U_55))
| ~ sP0(f(U_55),U_55) ),
inference(extension,[status(thm),parent(t2:3)],[f_1_11]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ sP0(f(U_55),U_55)
| p(f(U_55)) ),
inference(extension,[status(thm),parent(t6:2)],[f_1_10]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
$false,
inference(reduction,[status(thm),parent(t8:2)],[t8:2,t2:3]) ).
cnf(t11,plain,
( ~ sP1(sK1)
| r(sK1) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_12]) ).
cnf(t12,plain,
$false,
inference(connection,[status(thm),parent(t11:1)],[t11:1,t1:2]) ).
cnf(t13,plain,
( sP0(f(sK1),sK1)
| ~ q(f(sK1))
| sP1(sK1) ),
inference(extension,[status(thm),parent(t11:2)],[f_1_9]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t11:2]) ).
cnf(t15,plain,
q(f(sK1)),
inference(extension,[status(thm),parent(t13:2)],[f_1_8]) ).
cnf(t16,plain,
$false,
inference(connection,[status(thm),parent(t15:1)],[t15:1,t13:2]) ).
cnf(t17,plain,
( ~ p(f(sK1))
| ~ sP0(f(sK1),sK1) ),
inference(extension,[status(thm),parent(t13:3)],[f_1_11]) ).
cnf(t18,plain,
$false,
inference(connection,[status(thm),parent(t17:1)],[t17:1,t13:3]) ).
cnf(t19,plain,
( ~ sP0(f(sK1),sK1)
| p(f(sK1)) ),
inference(extension,[status(thm),parent(t17:2)],[f_1_10]) ).
cnf(t20,plain,
$false,
inference(connection,[status(thm),parent(t19:1)],[t19:1,t17:2]) ).
cnf(t21,plain,
$false,
inference(reduction,[status(thm),parent(t19:2)],[t19:2,t13:3]) ).
cnf(t22,plain,
( ~ sP1(sK2)
| r(sK2) ),
inference(extension,[status(thm),parent(t1:3)],[f_1_12]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t1:3]) ).
cnf(t24,plain,
( sP0(f(sK2),sK2)
| ~ q(f(sK2))
| sP1(sK2) ),
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(sK2)),
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,
( ~ p(f(sK2))
| ~ sP0(f(sK2),sK2) ),
inference(extension,[status(thm),parent(t24:3)],[f_1_11]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t24:3]) ).
cnf(t30,plain,
( ~ sP0(f(sK2),sK2)
| p(f(sK2)) ),
inference(extension,[status(thm),parent(t28:2)],[f_1_10]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).
cnf(t32,plain,
$false,
inference(reduction,[status(thm),parent(t30:2)],[t30:2,t24:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN939+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 07:30:44 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------