%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN415+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 : n016.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:18 AM UTC 2026
% Result : Theorem 0.22s 0.52s
% Output : Proof 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(kalish317,conjecture,
( ( ! [Y,Z] :
( ( f(Z)
& f(Y) )
=> Y = Z )
& ? [X] : f(X) )
<=> ? [U] :
( ! [V] :
( f(V)
=> U = V )
& f(U) ) ),
file('theBenchmark.p',kalish317) ).
fof(f_1_1,negated_conjecture,
~ ( ( ! [Y,Z] :
( ( f(Z)
& f(Y) )
=> Y = Z )
& ? [X] : f(X) )
<=> ? [U] :
( ! [V] :
( f(V)
=> U = V )
& f(U) ) ),
inference(negate,[status(cth)],[kalish317]) ).
fof(f_1_2,negated_conjecture,
( ( ( ? [Y,Z] :
( Y != Z
& f(Z)
& f(Y) )
| ! [X] : ~ f(X) )
& ? [U] :
( ! [V] :
( U = V
| ~ f(V) )
& f(U) ) )
| ( ! [U] :
( ? [V] :
( U != V
& f(V) )
| ~ f(U) )
& ! [Y,Z] :
( Y = Z
| ~ f(Z)
| ~ f(Y) )
& ? [X] : f(X) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ( ? [U_9,U_8] :
( U_9 != U_8
& f(U_8)
& f(U_9) )
| ! [U_7] : ~ f(U_7) )
& ? [U_6] :
( ! [U_5] :
( U_6 = U_5
| ~ f(U_5) )
& f(U_6) ) )
| ( ! [U_4] :
( ? [U_3] :
( U_4 != U_3
& f(U_3) )
| ~ f(U_4) )
& ! [U_2,U_1] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2) )
& ? [U_0] : f(U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ( ? [U_9,U_8] :
( U_9 != U_8
& f(U_8)
& f(U_9) )
| ! [U_7] : ~ f(U_7) )
& ? [U_6] :
( ! [U_5] :
( U_6 = U_5
| ~ f(U_5) )
& f(U_6) ) )
| ( ! [U_4] :
( ? [U_3] :
( U_4 != U_3
& f(U_3) )
| ~ f(U_4) )
& ! [U_2,U_1] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2) )
& f(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ( ? [U_9,U_8] :
( U_9 != U_8
& f(U_8)
& f(U_9) )
| ! [U_7] : ~ f(U_7) )
& ? [U_6] :
( ! [U_5] :
( U_6 = U_5
| ~ f(U_5) )
& f(U_6) ) )
| ( ! [U_4] :
( ( U_4 != sK2(U_4)
& f(sK2(U_4)) )
| ~ f(U_4) )
& ! [U_2,U_1] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2) )
& f(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2(U_4))],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ( ? [U_9,U_8] :
( U_9 != U_8
& f(U_8)
& f(U_9) )
| ! [U_7] : ~ f(U_7) )
& ! [U_5] :
( sK3 = U_5
| ~ f(U_5) )
& f(sK3) )
| ( ! [U_4] :
( ( U_4 != sK2(U_4)
& f(sK2(U_4)) )
| ~ f(U_4) )
& ! [U_2,U_1] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2) )
& f(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ( ? [U_8] :
( sK4 != U_8
& f(U_8)
& f(sK4) )
| ! [U_7] : ~ f(U_7) )
& ! [U_5] :
( sK3 = U_5
| ~ f(U_5) )
& f(sK3) )
| ( ! [U_4] :
( ( U_4 != sK2(U_4)
& f(sK2(U_4)) )
| ~ f(U_4) )
& ! [U_2,U_1] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2) )
& f(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_9,sK4)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ( ( sK4 != sK5
& f(sK5)
& f(sK4) )
| ! [U_7] : ~ f(U_7) )
& ! [U_5] :
( sK3 = U_5
| ~ f(U_5) )
& f(sK3) )
| ( ! [U_4] :
( ( U_4 != sK2(U_4)
& f(sK2(U_4)) )
| ~ f(U_4) )
& ! [U_2,U_1] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2) )
& f(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_8,sK5)],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ( sK4 != sK5
| ~ sP2 )
& ( f(sK5)
| ~ sP2 )
& ( f(sK4)
| ~ sP2 )
& ! [U_7,U_5] :
( sP2
| ~ f(U_7)
| ~ sP3(U_7,U_5) )
& ! [U_7,U_5] :
( sK3 = U_5
| ~ f(U_5)
| ~ sP3(U_7,U_5) )
& ! [U_7,U_5] :
( f(sK3)
| ~ sP3(U_7,U_5) )
& ! [U_4] :
( U_4 != sK2(U_4)
| ~ sP0(U_4) )
& ! [U_4] :
( f(sK2(U_4))
| ~ sP0(U_4) )
& ! [U_4,U_1,U_2] :
( sP0(U_4)
| ~ f(U_4)
| ~ sP1(U_4,U_1,U_2) )
& ! [U_4,U_1,U_2] :
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2)
| ~ sP1(U_4,U_1,U_2) )
& ! [U_4,U_1,U_2] :
( f(sK1)
| ~ sP1(U_4,U_1,U_2) )
& ! [U_4,U_7,U_1,U_5,U_2] :
( sP3(U_7,U_5)
| sP1(U_4,U_1,U_2) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3])],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( sP3(U_7,U_5)
| sP1(U_4,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( f(sK1)
| ~ sP1(U_4,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_12,negated_conjecture,
( U_2 = U_1
| ~ f(U_1)
| ~ f(U_2)
| ~ sP1(U_4,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_13,negated_conjecture,
( sP0(U_4)
| ~ f(U_4)
| ~ sP1(U_4,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_14,negated_conjecture,
( f(sK2(U_4))
| ~ sP0(U_4) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_15,negated_conjecture,
( U_4 != sK2(U_4)
| ~ sP0(U_4) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_16,negated_conjecture,
( f(sK3)
| ~ sP3(U_7,U_5) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_17,negated_conjecture,
( sK3 = U_5
| ~ f(U_5)
| ~ sP3(U_7,U_5) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_18,negated_conjecture,
( sP2
| ~ f(U_7)
| ~ sP3(U_7,U_5) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_19,negated_conjecture,
( f(sK4)
| ~ sP2 ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_20,negated_conjecture,
( f(sK5)
| ~ sP2 ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_21,negated_conjecture,
( sK4 != sK5
| ~ sP2 ),
inference(clausify,[status(thm)],[f_1_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,
( sK2(Eq_x_0) = sK2(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( f(Eq_y_0)
| ~ f(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_6,axiom,
( sP0(Eq_y_0)
| ~ sP0(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,axiom,
( sP1(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP1(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_8,axiom,
( sP3(Eq_y_0,Eq_y_1)
| ~ sP3(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 : SYN415+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.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 06:37:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.22/0.52 % SZS status Theorem for theBenchmark
% 0.22/0.52 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------