%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN077+1 : TPTP v9.3.1. Released v2.0.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 : n014.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:09:25 AM UTC 2026
% Result : Theorem 61.35s 61.68s
% Output : Proof 61.79s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel54_1,axiom,
! [Y] :
? [Z] :
! [X] :
( big_f(X,Z)
<=> X = Y ),
file('theBenchmark.p',pel54_1) ).
fof(pel54,conjecture,
~ ? [W] :
! [X] :
( big_f(X,W)
<=> ! [U] :
( big_f(X,U)
=> ? [Y] :
( ~ ? [Z] :
( big_f(Z,Y)
& big_f(Z,U) )
& big_f(Y,U) ) ) ),
file('theBenchmark.p',pel54) ).
fof(f_1_1,plain,
! [Y] :
? [Z] :
! [X] :
( ( big_f(X,Z)
| X != Y )
& ( X = Y
| ~ big_f(X,Z) ) ),
inference(fof_nnf,[status(thm)],[pel54_1]) ).
fof(f_1_2,plain,
! [U_2] :
? [U_1] :
! [U_0] :
( ( big_f(U_0,U_1)
| U_0 != U_2 )
& ( U_0 = U_2
| ~ big_f(U_0,U_1) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_2] :
? [U_1] :
( ! [U_4] :
( big_f(U_4,U_1)
| U_4 != U_2 )
& ! [U_3] :
( U_3 = U_2
| ~ big_f(U_3,U_1) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
! [U_2] :
( ! [U_4] :
( big_f(U_4,sK1(U_2))
| U_4 != U_2 )
& ! [U_3] :
( U_3 = U_2
| ~ big_f(U_3,sK1(U_2)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1(U_2))],[f_1_3]) ).
fof(f_1_5,plain,
( ! [U_4,U_2] :
( big_f(U_4,sK1(U_2))
| U_4 != U_2 )
& ! [U_3,U_2] :
( U_3 = U_2
| ~ big_f(U_3,sK1(U_2)) ) ),
inference(definitional_conversion,[status(esa)],[f_1_4]) ).
cnf(f_1_6,plain,
( U_3 = U_2
| ~ big_f(U_3,sK1(U_2)) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,plain,
( big_f(U_4,sK1(U_2))
| U_4 != U_2 ),
inference(clausify,[status(thm)],[f_1_5]) ).
fof(f_2_1,negated_conjecture,
? [W] :
! [X] :
( big_f(X,W)
<=> ! [U] :
( big_f(X,U)
=> ? [Y] :
( ~ ? [Z] :
( big_f(Z,Y)
& big_f(Z,U) )
& big_f(Y,U) ) ) ),
inference(negate,[status(cth)],[pel54]) ).
fof(f_2_2,negated_conjecture,
? [W] :
! [X] :
( ( big_f(X,W)
| ? [U] :
( ! [Y] :
( ? [Z] :
( big_f(Z,Y)
& big_f(Z,U) )
| ~ big_f(Y,U) )
& big_f(X,U) ) )
& ( ! [U] :
( ? [Y] :
( ! [Z] :
( ~ big_f(Z,Y)
| ~ big_f(Z,U) )
& big_f(Y,U) )
| ~ big_f(X,U) )
| ~ big_f(X,W) ) ),
inference(fof_nnf,[status(thm)],[f_2_1]) ).
fof(f_2_3,negated_conjecture,
? [U_12] :
! [U_11] :
( ( big_f(U_11,U_12)
| ? [U_10] :
( ! [U_9] :
( ? [U_8] :
( big_f(U_8,U_9)
& big_f(U_8,U_10) )
| ~ big_f(U_9,U_10) )
& big_f(U_11,U_10) ) )
& ( ! [U_7] :
( ? [U_6] :
( ! [U_5] :
( ~ big_f(U_5,U_6)
| ~ big_f(U_5,U_7) )
& big_f(U_6,U_7) )
| ~ big_f(U_11,U_7) )
| ~ big_f(U_11,U_12) ) ),
inference(variable_rename,[status(thm)],[f_2_2]) ).
fof(f_2_4,negated_conjecture,
? [U_12] :
( ! [U_14] :
( big_f(U_14,U_12)
| ? [U_10] :
( ! [U_9] :
( ? [U_8] :
( big_f(U_8,U_9)
& big_f(U_8,U_10) )
| ~ big_f(U_9,U_10) )
& big_f(U_14,U_10) ) )
& ! [U_13] :
( ! [U_7] :
( ? [U_6] :
( ! [U_5] :
( ~ big_f(U_5,U_6)
| ~ big_f(U_5,U_7) )
& big_f(U_6,U_7) )
| ~ big_f(U_13,U_7) )
| ~ big_f(U_13,U_12) ) ),
inference(miniscope,[status(thm)],[f_2_3]) ).
fof(f_2_5,negated_conjecture,
( ! [U_14] :
( big_f(U_14,sK2)
| ? [U_10] :
( ! [U_9] :
( ? [U_8] :
( big_f(U_8,U_9)
& big_f(U_8,U_10) )
| ~ big_f(U_9,U_10) )
& big_f(U_14,U_10) ) )
& ! [U_13] :
( ! [U_7] :
( ? [U_6] :
( ! [U_5] :
( ~ big_f(U_5,U_6)
| ~ big_f(U_5,U_7) )
& big_f(U_6,U_7) )
| ~ big_f(U_13,U_7) )
| ~ big_f(U_13,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_12,sK2)],[f_2_4]) ).
fof(f_2_6,negated_conjecture,
( ! [U_14] :
( big_f(U_14,sK2)
| ? [U_10] :
( ! [U_9] :
( ? [U_8] :
( big_f(U_8,U_9)
& big_f(U_8,U_10) )
| ~ big_f(U_9,U_10) )
& big_f(U_14,U_10) ) )
& ! [U_13] :
( ! [U_7] :
( ( ! [U_5] :
( ~ big_f(U_5,sK3(U_13,U_7))
| ~ big_f(U_5,U_7) )
& big_f(sK3(U_13,U_7),U_7) )
| ~ big_f(U_13,U_7) )
| ~ big_f(U_13,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3(U_13,U_7))],[f_2_5]) ).
fof(f_2_7,negated_conjecture,
( ! [U_14] :
( big_f(U_14,sK2)
| ( ! [U_9] :
( ? [U_8] :
( big_f(U_8,U_9)
& big_f(U_8,sK4(U_14)) )
| ~ big_f(U_9,sK4(U_14)) )
& big_f(U_14,sK4(U_14)) ) )
& ! [U_13] :
( ! [U_7] :
( ( ! [U_5] :
( ~ big_f(U_5,sK3(U_13,U_7))
| ~ big_f(U_5,U_7) )
& big_f(sK3(U_13,U_7),U_7) )
| ~ big_f(U_13,U_7) )
| ~ big_f(U_13,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_10,sK4(U_14))],[f_2_6]) ).
fof(f_2_8,negated_conjecture,
( ! [U_14] :
( big_f(U_14,sK2)
| ( ! [U_9] :
( ( big_f(sK5(U_14,U_9),U_9)
& big_f(sK5(U_14,U_9),sK4(U_14)) )
| ~ big_f(U_9,sK4(U_14)) )
& big_f(U_14,sK4(U_14)) ) )
& ! [U_13] :
( ! [U_7] :
( ( ! [U_5] :
( ~ big_f(U_5,sK3(U_13,U_7))
| ~ big_f(U_5,U_7) )
& big_f(sK3(U_13,U_7),U_7) )
| ~ big_f(U_13,U_7) )
| ~ big_f(U_13,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_8,sK5(U_14,U_9))],[f_2_7]) ).
fof(f_2_9,negated_conjecture,
( ! [U_9,U_14] :
( big_f(sK5(U_14,U_9),U_9)
| ~ sP1(U_9,U_14) )
& ! [U_9,U_14] :
( big_f(sK5(U_14,U_9),sK4(U_14))
| ~ sP1(U_9,U_14) )
& ! [U_9,U_14] :
( sP1(U_9,U_14)
| ~ big_f(U_9,sK4(U_14))
| ~ sP2(U_9,U_14) )
& ! [U_9,U_14] :
( big_f(U_14,sK4(U_14))
| ~ sP2(U_9,U_14) )
& ! [U_5,U_7,U_13] :
( ~ big_f(U_5,sK3(U_13,U_7))
| ~ big_f(U_5,U_7)
| ~ sP0(U_5,U_7,U_13) )
& ! [U_5,U_7,U_13] :
( big_f(sK3(U_13,U_7),U_7)
| ~ sP0(U_5,U_7,U_13) )
& ! [U_9,U_14] :
( big_f(U_14,sK2)
| sP2(U_9,U_14) )
& ! [U_5,U_7,U_13] :
( sP0(U_5,U_7,U_13)
| ~ big_f(U_13,U_7)
| ~ big_f(U_13,sK2) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2])],[f_2_8]) ).
cnf(f_2_10,negated_conjecture,
( sP0(U_5,U_7,U_13)
| ~ big_f(U_13,U_7)
| ~ big_f(U_13,sK2) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_11,negated_conjecture,
( big_f(U_14,sK2)
| sP2(U_9,U_14) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_12,negated_conjecture,
( big_f(sK3(U_13,U_7),U_7)
| ~ sP0(U_5,U_7,U_13) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_13,negated_conjecture,
( ~ big_f(U_5,sK3(U_13,U_7))
| ~ big_f(U_5,U_7)
| ~ sP0(U_5,U_7,U_13) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_14,negated_conjecture,
( big_f(U_14,sK4(U_14))
| ~ sP2(U_9,U_14) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_15,negated_conjecture,
( sP1(U_9,U_14)
| ~ big_f(U_9,sK4(U_14))
| ~ sP2(U_9,U_14) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_16,negated_conjecture,
( big_f(sK5(U_14,U_9),sK4(U_14))
| ~ sP1(U_9,U_14) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_17,negated_conjecture,
( big_f(sK5(U_14,U_9),U_9)
| ~ sP1(U_9,U_14) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sK1(Eq_x_0) = sK1(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( sK3(Eq_x_0,Eq_x_1) = sK3(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( sK4(Eq_x_0) = sK4(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( sK5(Eq_x_0,Eq_x_1) = sK5(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( big_f(Eq_y_0,Eq_y_1)
| ~ big_f(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( sP0(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP0(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,axiom,
( sP1(Eq_y_0,Eq_y_1)
| ~ sP1(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_11,axiom,
( sP2(Eq_y_0,Eq_y_1)
| ~ sP2(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN077+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 06:24:06 UTC 2026
% 0.08/0.35 % CPUTime :
% 61.35/61.68 % SZS status Theorem for theBenchmark
% 61.35/61.68 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------