%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN332+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 : n012.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 3.05s 3.38s
% Output : Proof 3.05s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_14_4,conjecture,
? [X,Y] :
! [Z] :
( ( ( big_f(X,Z)
& ~ ( big_f(Y,X)
& big_f(X,Y) ) )
| ( ~ big_f(X,Z)
& big_f(Y,X)
& big_f(X,Y) ) )
=> ( ( big_f(X,Z)
<=> big_f(Z,X) )
=> ( ( big_f(X,Z)
<=> big_f(Y,Z) )
=> ( ( ( big_f(Y,X)
=> big_f(X,Y) )
<=> big_f(Z,Z) )
=> ( ( big_f(X,Y)
<=> big_f(Y,X) )
<=> big_f(Z,Y) ) ) ) ) ),
file('theBenchmark.p',church_46_14_4) ).
fof(f_1_1,negated_conjecture,
~ ? [X,Y] :
! [Z] :
( ( ( big_f(X,Z)
& ~ ( big_f(Y,X)
& big_f(X,Y) ) )
| ( ~ big_f(X,Z)
& big_f(Y,X)
& big_f(X,Y) ) )
=> ( ( big_f(X,Z)
<=> big_f(Z,X) )
=> ( ( big_f(X,Z)
<=> big_f(Y,Z) )
=> ( ( ( big_f(Y,X)
=> big_f(X,Y) )
<=> big_f(Z,Z) )
=> ( ( big_f(X,Y)
<=> big_f(Y,X) )
<=> big_f(Z,Y) ) ) ) ) ),
inference(negate,[status(cth)],[church_46_14_4]) ).
fof(f_1_2,negated_conjecture,
! [X,Y] :
? [Z] :
( ( ( ( ( ~ big_f(X,Y)
& big_f(Y,X) )
| ( ~ big_f(Y,X)
& big_f(X,Y) ) )
& big_f(Z,Y) )
| ( ~ big_f(Z,Y)
& ( big_f(X,Y)
| ~ big_f(Y,X) )
& ( big_f(Y,X)
| ~ big_f(X,Y) ) ) )
& ( big_f(X,Y)
| ~ big_f(Y,X)
| ~ big_f(Z,Z) )
& ( big_f(Z,Z)
| ( ~ big_f(X,Y)
& big_f(Y,X) ) )
& ( big_f(X,Z)
| ~ big_f(Y,Z) )
& ( big_f(Y,Z)
| ~ big_f(X,Z) )
& ( big_f(X,Z)
| ~ big_f(Z,X) )
& ( big_f(Z,X)
| ~ big_f(X,Z) )
& ( ( big_f(X,Z)
& ( ~ big_f(Y,X)
| ~ big_f(X,Y) ) )
| ( ~ big_f(X,Z)
& big_f(Y,X)
& 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_f(U_2,U_1)
& big_f(U_1,U_2) )
| ( ~ big_f(U_1,U_2)
& big_f(U_2,U_1) ) )
& big_f(U_0,U_1) )
| ( ~ big_f(U_0,U_1)
& ( big_f(U_2,U_1)
| ~ big_f(U_1,U_2) )
& ( big_f(U_1,U_2)
| ~ big_f(U_2,U_1) ) ) )
& ( big_f(U_2,U_1)
| ~ big_f(U_1,U_2)
| ~ big_f(U_0,U_0) )
& ( big_f(U_0,U_0)
| ( ~ big_f(U_2,U_1)
& big_f(U_1,U_2) ) )
& ( big_f(U_2,U_0)
| ~ big_f(U_1,U_0) )
& ( big_f(U_1,U_0)
| ~ big_f(U_2,U_0) )
& ( big_f(U_2,U_0)
| ~ big_f(U_0,U_2) )
& ( big_f(U_0,U_2)
| ~ big_f(U_2,U_0) )
& ( ( big_f(U_2,U_0)
& ( ~ big_f(U_1,U_2)
| ~ big_f(U_2,U_1) ) )
| ( ~ big_f(U_2,U_0)
& big_f(U_1,U_2)
& big_f(U_2,U_1) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
! [U_2,U_1] :
( ( ( ( ( ~ big_f(U_2,U_1)
& big_f(U_1,U_2) )
| ( ~ big_f(U_1,U_2)
& big_f(U_2,U_1) ) )
& big_f(sK1(U_2,U_1),U_1) )
| ( ~ big_f(sK1(U_2,U_1),U_1)
& ( big_f(U_2,U_1)
| ~ big_f(U_1,U_2) )
& ( big_f(U_1,U_2)
| ~ big_f(U_2,U_1) ) ) )
& ( big_f(U_2,U_1)
| ~ big_f(U_1,U_2)
| ~ big_f(sK1(U_2,U_1),sK1(U_2,U_1)) )
& ( big_f(sK1(U_2,U_1),sK1(U_2,U_1))
| ( ~ big_f(U_2,U_1)
& big_f(U_1,U_2) ) )
& ( big_f(U_2,sK1(U_2,U_1))
| ~ big_f(U_1,sK1(U_2,U_1)) )
& ( big_f(U_1,sK1(U_2,U_1))
| ~ big_f(U_2,sK1(U_2,U_1)) )
& ( big_f(U_2,sK1(U_2,U_1))
| ~ big_f(sK1(U_2,U_1),U_2) )
& ( big_f(sK1(U_2,U_1),U_2)
| ~ big_f(U_2,sK1(U_2,U_1)) )
& ( ( big_f(U_2,sK1(U_2,U_1))
& ( ~ big_f(U_1,U_2)
| ~ big_f(U_2,U_1) ) )
| ( ~ big_f(U_2,sK1(U_2,U_1))
& big_f(U_1,U_2)
& big_f(U_2,U_1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_2,U_1))],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_2,U_1] :
( ~ big_f(U_2,U_1)
| ~ sP5(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_1,U_2)
| ~ sP5(U_2,U_1) )
& ! [U_2,U_1] :
( ~ big_f(U_1,U_2)
| ~ sP4(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_2,U_1)
| ~ sP4(U_2,U_1) )
& ! [U_2,U_1] :
( sP5(U_2,U_1)
| sP4(U_2,U_1)
| ~ sP6(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(sK1(U_2,U_1),U_1)
| ~ sP6(U_2,U_1) )
& ! [U_2,U_1] :
( ~ big_f(sK1(U_2,U_1),U_1)
| ~ sP3(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_2,U_1)
| ~ big_f(U_1,U_2)
| ~ sP3(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_1,U_2)
| ~ big_f(U_2,U_1)
| ~ sP3(U_2,U_1) )
& ! [U_2,U_1] :
( ~ big_f(U_2,U_1)
| ~ sP2(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_1,U_2)
| ~ sP2(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_2,sK1(U_2,U_1))
| ~ sP1(U_2,U_1) )
& ! [U_2,U_1] :
( ~ big_f(U_1,U_2)
| ~ big_f(U_2,U_1)
| ~ sP1(U_2,U_1) )
& ! [U_2,U_1] :
( ~ big_f(U_2,sK1(U_2,U_1))
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_1,U_2)
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_2,U_1)
| ~ sP0(U_2,U_1) )
& ! [U_2,U_1] :
( sP6(U_2,U_1)
| sP3(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_2,U_1)
| ~ big_f(U_1,U_2)
| ~ big_f(sK1(U_2,U_1),sK1(U_2,U_1)) )
& ! [U_2,U_1] :
( big_f(sK1(U_2,U_1),sK1(U_2,U_1))
| sP2(U_2,U_1) )
& ! [U_2,U_1] :
( big_f(U_2,sK1(U_2,U_1))
| ~ big_f(U_1,sK1(U_2,U_1)) )
& ! [U_2,U_1] :
( big_f(U_1,sK1(U_2,U_1))
| ~ big_f(U_2,sK1(U_2,U_1)) )
& ! [U_2,U_1] :
( big_f(U_2,sK1(U_2,U_1))
| ~ big_f(sK1(U_2,U_1),U_2) )
& ! [U_2,U_1] :
( big_f(sK1(U_2,U_1),U_2)
| ~ big_f(U_2,sK1(U_2,U_1)) )
& ! [U_2,U_1] :
( sP1(U_2,U_1)
| sP0(U_2,U_1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3,sP4,sP5,sP6])],[f_1_4]) ).
cnf(f_1_6,negated_conjecture,
( sP1(U_2,U_1)
| sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( big_f(sK1(U_2,U_1),U_2)
| ~ big_f(U_2,sK1(U_2,U_1)) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,negated_conjecture,
( big_f(U_2,sK1(U_2,U_1))
| ~ big_f(sK1(U_2,U_1),U_2) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,negated_conjecture,
( big_f(U_1,sK1(U_2,U_1))
| ~ big_f(U_2,sK1(U_2,U_1)) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_10,negated_conjecture,
( big_f(U_2,sK1(U_2,U_1))
| ~ big_f(U_1,sK1(U_2,U_1)) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_11,negated_conjecture,
( big_f(sK1(U_2,U_1),sK1(U_2,U_1))
| sP2(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_12,negated_conjecture,
( big_f(U_2,U_1)
| ~ big_f(U_1,U_2)
| ~ big_f(sK1(U_2,U_1),sK1(U_2,U_1)) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_13,negated_conjecture,
( sP6(U_2,U_1)
| sP3(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_14,negated_conjecture,
( big_f(U_2,U_1)
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_15,negated_conjecture,
( big_f(U_1,U_2)
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_16,negated_conjecture,
( ~ big_f(U_2,sK1(U_2,U_1))
| ~ sP0(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_17,negated_conjecture,
( ~ big_f(U_1,U_2)
| ~ big_f(U_2,U_1)
| ~ sP1(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_18,negated_conjecture,
( big_f(U_2,sK1(U_2,U_1))
| ~ sP1(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_19,negated_conjecture,
( big_f(U_1,U_2)
| ~ sP2(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_20,negated_conjecture,
( ~ big_f(U_2,U_1)
| ~ sP2(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_21,negated_conjecture,
( big_f(U_1,U_2)
| ~ big_f(U_2,U_1)
| ~ sP3(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_22,negated_conjecture,
( big_f(U_2,U_1)
| ~ big_f(U_1,U_2)
| ~ sP3(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_23,negated_conjecture,
( ~ big_f(sK1(U_2,U_1),U_1)
| ~ sP3(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_24,negated_conjecture,
( big_f(sK1(U_2,U_1),U_1)
| ~ sP6(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_25,negated_conjecture,
( sP5(U_2,U_1)
| sP4(U_2,U_1)
| ~ sP6(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_26,negated_conjecture,
( big_f(U_2,U_1)
| ~ sP4(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_27,negated_conjecture,
( ~ big_f(U_1,U_2)
| ~ sP4(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_28,negated_conjecture,
( big_f(U_1,U_2)
| ~ sP5(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_29,negated_conjecture,
( ~ big_f(U_2,U_1)
| ~ sP5(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN332+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sun Sep 20 06:29:07 UTC 2026
% 0.03/0.29 % CPUTime :
% 3.05/3.38 % SZS status Theorem for theBenchmark
% 3.05/3.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------