%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN333+1 : TPTP v9.3.1. Released v2.0.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 : n020.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:10:04 AM UTC 2026
% Result : Theorem 0.11s 0.39s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 18 unt; 0 def)
% Number of atoms : 116 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 132 ( 53 ~; 42 |; 33 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 3 sgn 36 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_14_5,conjecture,
? [X,Y] :
! [Z] :
( big_f(X,Y)
=> ( ( ( big_g(X,Y)
& big_f(X,Y) )
=> ( big_g(Z,Z)
& big_g(X,Z) ) )
& big_f(Z,Z)
& big_f(Y,Z) ) ),
file('theBenchmark.p',church_46_14_5) ).
fof(f_1_1,negated_conjecture,
~ ? [X,Y] :
! [Z] :
( big_f(X,Y)
=> ( ( ( big_g(X,Y)
& big_f(X,Y) )
=> ( big_g(Z,Z)
& big_g(X,Z) ) )
& big_f(Z,Z)
& big_f(Y,Z) ) ),
inference(negate,[status(cth)],[church_46_14_5]) ).
fof(f_1_2,negated_conjecture,
! [X,Y] :
? [Z] :
( ( ( ( ~ big_g(Z,Z)
| ~ big_g(X,Z) )
& big_g(X,Y)
& big_f(X,Y) )
| ~ big_f(Z,Z)
| ~ big_f(Y,Z) )
& big_f(X,Y) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_2,U_1] :
? [U_0] :
( ( ( ( ~ big_g(U_0,U_0)
| ~ big_g(U_2,U_0) )
& big_g(U_2,U_1)
& big_f(U_2,U_1) )
| ~ big_f(U_0,U_0)
| ~ big_f(U_1,U_0) )
& big_f(U_2,U_1) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ! [U_11,U_9] :
( ( ( ? [U_7] : ~ big_g(U_7,U_7)
| ? [U_6] : ~ big_g(U_11,U_6) )
& big_g(U_11,U_9)
& big_f(U_11,U_9) )
| ? [U_3] : ~ big_f(U_9,U_3) )
| ? [U_4] : ~ big_f(U_4,U_4) )
& ! [U_10,U_8] : big_f(U_10,U_8) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ! [U_11,U_9] :
( ( ( ? [U_7] : ~ big_g(U_7,U_7)
| ? [U_6] : ~ big_g(U_11,U_6) )
& big_g(U_11,U_9)
& big_f(U_11,U_9) )
| ? [U_3] : ~ big_f(U_9,U_3) )
| ~ big_f(sK1,sK1) )
& ! [U_10,U_8] : big_f(U_10,U_8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_4,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ! [U_11,U_9] :
( ( ( ? [U_7] : ~ big_g(U_7,U_7)
| ? [U_6] : ~ big_g(U_11,U_6) )
& big_g(U_11,U_9)
& big_f(U_11,U_9) )
| ~ big_f(U_9,sK2(U_11,U_9)) )
| ~ big_f(sK1,sK1) )
& ! [U_10,U_8] : big_f(U_10,U_8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2(U_11,U_9))],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ! [U_11,U_9] :
( ( ( ? [U_7] : ~ big_g(U_7,U_7)
| ~ big_g(U_11,sK3(U_11,U_9)) )
& big_g(U_11,U_9)
& big_f(U_11,U_9) )
| ~ big_f(U_9,sK2(U_11,U_9)) )
| ~ big_f(sK1,sK1) )
& ! [U_10,U_8] : big_f(U_10,U_8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3(U_11,U_9))],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ! [U_11,U_9] :
( ( ( ~ big_g(sK4(U_11,U_9),sK4(U_11,U_9))
| ~ big_g(U_11,sK3(U_11,U_9)) )
& big_g(U_11,U_9)
& big_f(U_11,U_9) )
| ~ big_f(U_9,sK2(U_11,U_9)) )
| ~ big_f(sK1,sK1) )
& ! [U_10,U_8] : big_f(U_10,U_8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_7,sK4(U_11,U_9))],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ! [U_11,U_9] :
( ~ big_g(sK4(U_11,U_9),sK4(U_11,U_9))
| ~ big_g(U_11,sK3(U_11,U_9))
| ~ sP0(U_11,U_9) )
& ! [U_11,U_9] :
( big_g(U_11,U_9)
| ~ sP0(U_11,U_9) )
& ! [U_11,U_9] :
( big_f(U_11,U_9)
| ~ sP0(U_11,U_9) )
& ! [U_11,U_9] :
( sP0(U_11,U_9)
| ~ big_f(U_9,sK2(U_11,U_9))
| ~ big_f(sK1,sK1) )
& ! [U_8,U_10] : big_f(U_10,U_8) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
big_f(U_10,U_8),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( sP0(U_11,U_9)
| ~ big_f(U_9,sK2(U_11,U_9))
| ~ big_f(sK1,sK1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_13,negated_conjecture,
( big_g(U_11,U_9)
| ~ sP0(U_11,U_9) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_14,negated_conjecture,
( ~ big_g(sK4(U_11,U_9),sK4(U_11,U_9))
| ~ big_g(U_11,sK3(U_11,U_9))
| ~ sP0(U_11,U_9) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(t1,plain,
( ~ big_g(U_85,sK3(U_85,U_72))
| ~ big_g(sK4(U_85,U_72),sK4(U_85,U_72))
| ~ sP0(U_85,U_72) ),
inference(start,[status(thm),parent(0:0)],[f_1_14]) ).
cnf(t2,plain,
( ~ big_f(U_72,sK2(U_85,U_72))
| ~ big_f(sK1,sK1)
| sP0(U_85,U_72) ),
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,
big_f(sK1,sK1),
inference(extension,[status(thm),parent(t2:2)],[f_1_10]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
big_f(U_72,sK2(U_85,U_72)),
inference(extension,[status(thm),parent(t2:3)],[f_1_10]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ sP0(sK4(U_85,U_72),sK4(U_85,U_72))
| big_g(sK4(U_85,U_72),sK4(U_85,U_72)) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_13]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t1:2]) ).
cnf(t10,plain,
( ~ big_f(sK4(U_85,U_72),sK2(sK4(U_85,U_72),sK4(U_85,U_72)))
| ~ big_f(sK1,sK1)
| sP0(sK4(U_85,U_72),sK4(U_85,U_72)) ),
inference(extension,[status(thm),parent(t8:2)],[f_1_11]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
big_f(sK1,sK1),
inference(extension,[status(thm),parent(t10:2)],[f_1_10]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
big_f(sK4(U_85,U_72),sK2(sK4(U_85,U_72),sK4(U_85,U_72))),
inference(extension,[status(thm),parent(t10:3)],[f_1_10]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).
cnf(t16,plain,
( ~ sP0(U_85,sK3(U_85,U_72))
| big_g(U_85,sK3(U_85,U_72)) ),
inference(extension,[status(thm),parent(t1:3)],[f_1_13]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t1:3]) ).
cnf(t18,plain,
( ~ big_f(sK3(U_85,U_72),sK2(U_85,sK3(U_85,U_72)))
| ~ big_f(sK1,sK1)
| sP0(U_85,sK3(U_85,U_72)) ),
inference(extension,[status(thm),parent(t16:2)],[f_1_11]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
big_f(sK1,sK1),
inference(extension,[status(thm),parent(t18:2)],[f_1_10]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
big_f(sK3(U_85,U_72),sK2(U_85,sK3(U_85,U_72))),
inference(extension,[status(thm),parent(t18:3)],[f_1_10]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN333+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 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.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 06:30:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.39 % SZS status Theorem for theBenchmark
% 0.11/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------