%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN325+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 : 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:10:02 AM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 18 |; 16 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 28 ( 3 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_9_2,conjecture,
? [X] :
! [Y] :
( ( ( big_f(X,X)
=> big_f(Y,Y) )
=> ( big_g(X)
& big_f(X,Y) ) )
=> big_g(Y) ),
file('theBenchmark.p',church_46_9_2) ).
fof(f_1_1,negated_conjecture,
~ ? [X] :
! [Y] :
( ( ( big_f(X,X)
=> big_f(Y,Y) )
=> ( big_g(X)
& big_f(X,Y) ) )
=> big_g(Y) ),
inference(negate,[status(cth)],[church_46_9_2]) ).
fof(f_1_2,negated_conjecture,
! [X] :
? [Y] :
( ~ big_g(Y)
& ( ( big_g(X)
& big_f(X,Y) )
| ( ~ big_f(Y,Y)
& big_f(X,X) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_1] :
? [U_0] :
( ~ big_g(U_0)
& ( ( big_g(U_1)
& big_f(U_1,U_0) )
| ( ~ big_f(U_0,U_0)
& big_f(U_1,U_1) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
! [U_1] :
( ~ big_g(sK1(U_1))
& ( ( big_g(U_1)
& big_f(U_1,sK1(U_1)) )
| ( ~ big_f(sK1(U_1),sK1(U_1))
& big_f(U_1,U_1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_1))],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_1] :
( big_g(U_1)
| ~ sP1(U_1) )
& ! [U_1] :
( big_f(U_1,sK1(U_1))
| ~ sP1(U_1) )
& ! [U_1] :
( ~ big_f(sK1(U_1),sK1(U_1))
| ~ sP0(U_1) )
& ! [U_1] :
( big_f(U_1,U_1)
| ~ sP0(U_1) )
& ! [U_1] : ~ big_g(sK1(U_1))
& ! [U_1] :
( sP1(U_1)
| sP0(U_1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_4]) ).
cnf(f_1_6,negated_conjecture,
( sP1(U_1)
| sP0(U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
~ big_g(sK1(U_1)),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,negated_conjecture,
( big_f(U_1,U_1)
| ~ sP0(U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,negated_conjecture,
( ~ big_f(sK1(U_1),sK1(U_1))
| ~ sP0(U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_11,negated_conjecture,
( big_g(U_1)
| ~ sP1(U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(t1,plain,
( ~ big_f(sK1(sK1(U_35)),sK1(sK1(U_35)))
| ~ sP0(sK1(U_35)) ),
inference(start,[status(thm),parent(0:0)],[f_1_9]) ).
cnf(t2,plain,
( sP1(sK1(U_35))
| sP0(sK1(U_35)) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( big_g(sK1(U_35))
| ~ sP1(sK1(U_35)) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_11]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ big_g(sK1(U_35)),
inference(extension,[status(thm),parent(t4:2)],[f_1_7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ sP0(sK1(sK1(U_35)))
| big_f(sK1(sK1(U_35)),sK1(sK1(U_35))) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_8]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t1:2]) ).
cnf(t10,plain,
( sP1(sK1(sK1(U_35)))
| sP0(sK1(sK1(U_35))) ),
inference(extension,[status(thm),parent(t8:2)],[f_1_6]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( big_g(sK1(sK1(U_35)))
| ~ sP1(sK1(sK1(U_35))) ),
inference(extension,[status(thm),parent(t10:2)],[f_1_11]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
~ big_g(sK1(sK1(U_35))),
inference(extension,[status(thm),parent(t12:2)],[f_1_7]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN325+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.08/0.36 % Computer : n009.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 06:28:42 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------