%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN341+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 : n013.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:06 AM UTC 2026
% Result : Theorem 0.11s 0.38s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 0 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 38 ( 1 sgn 21 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_15_6,conjecture,
? [X1] :
! [X2] :
? [X3] :
! [X4] :
( big_f(X1,X2,X3)
=> big_f(X2,X3,X4) ),
file('theBenchmark.p',church_46_15_6) ).
fof(f_1_1,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( big_f(X1,X2,X3)
=> big_f(X2,X3,X4) ),
inference(negate,[status(cth)],[church_46_15_6]) ).
fof(f_1_2,negated_conjecture,
! [X1] :
? [X2] :
! [X3] :
? [X4] :
( ~ big_f(X2,X3,X4)
& big_f(X1,X2,X3) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_3] :
? [U_2] :
! [U_1] :
? [U_0] :
( ~ big_f(U_2,U_1,U_0)
& big_f(U_3,U_2,U_1) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
! [U_3] :
? [U_2] :
( ! [U_5] :
? [U_0] : ~ big_f(U_2,U_5,U_0)
& ! [U_4] : big_f(U_3,U_2,U_4) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
! [U_3] :
( ! [U_5] :
? [U_0] : ~ big_f(sK1(U_3),U_5,U_0)
& ! [U_4] : big_f(U_3,sK1(U_3),U_4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1(U_3))],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
! [U_3] :
( ! [U_5] : ~ big_f(sK1(U_3),U_5,sK2(U_3,U_5))
& ! [U_4] : big_f(U_3,sK1(U_3),U_4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_0,sK2(U_3,U_5))],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_3,U_5] : ~ big_f(sK1(U_3),U_5,sK2(U_3,U_5))
& ! [U_3,U_4] : big_f(U_3,sK1(U_3),U_4) ),
inference(definitional_conversion,[status(esa)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
big_f(U_3,sK1(U_3),U_4),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
~ big_f(sK1(U_3),U_5,sK2(U_3,U_5)),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
~ big_f(sK1(U_26),sK1(sK1(U_26)),sK2(U_26,sK1(sK1(U_26)))),
inference(start,[status(thm),parent(0:0)],[f_1_9]) ).
cnf(t2,plain,
big_f(sK1(U_26),sK1(sK1(U_26)),sK2(U_26,sK1(sK1(U_26)))),
inference(extension,[status(thm),parent(t1:1)],[f_1_8]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN341+1 : TPTP v9.3.1. Released v2.0.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.11/0.36 % Computer : n013.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:28:35 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.38 % SZS status Theorem for theBenchmark
% 0.11/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------