%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRA119+1 : TPTP v9.3.1. Released v9.3.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 : n026.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 08:40:57 AM UTC 2026
% Result : Unsatisfiable 150.03s 150.38s
% Output : Proof 150.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(rsym,axiom,
! [X,Y] :
( r(Y,X)
| ~ r(X,Y) ),
file('theBenchmark.p',rsym) ).
fof(rn3cl,axiom,
! [X,Y,Z] :
( ~ r(Y,Z)
| ~ r(X,Z)
| ~ r(X,Y)
| Y = Z
| X = Z
| X = Y ),
file('theBenchmark.p',rn3cl) ).
fof(rn3acl,axiom,
! [X,Y,Z] :
( r(Y,Z)
| r(X,Z)
| r(X,Y)
| Y = Z
| X = Z
| X = Y ),
file('theBenchmark.p',rn3acl) ).
fof(f6ck,axiom,
f(f(f(f(f(f(c)))))) != f(c),
file('theBenchmark.p',f6ck) ).
fof(f62ck,axiom,
f(f(f(f(f(f(c)))))) != f(f(c)),
file('theBenchmark.p',f62ck) ).
fof(f63ck,axiom,
f(f(f(f(f(f(c)))))) != f(f(f(c))),
file('theBenchmark.p',f63ck) ).
fof(f64ck,axiom,
f(f(f(f(f(f(c)))))) != f(f(f(f(c)))),
file('theBenchmark.p',f64ck) ).
fof(f_1_1,plain,
! [X,Y] :
( r(Y,X)
| ~ r(X,Y) ),
inference(fof_nnf,[status(thm)],[rsym]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( r(U_0,U_1)
| ~ r(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_1,U_0] :
( r(U_0,U_1)
| ~ r(U_1,U_0) ),
inference(definitional_conversion,[status(esa)],[f_1_2]) ).
cnf(f_1_4,plain,
( r(U_0,U_1)
| ~ r(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [X,Y,Z] :
( ~ r(Y,Z)
| ~ r(X,Z)
| ~ r(X,Y)
| Y = Z
| X = Z
| X = Y ),
inference(fof_nnf,[status(thm)],[rn3cl]) ).
fof(f_2_2,plain,
! [U_4,U_3,U_2] :
( ~ r(U_3,U_2)
| ~ r(U_4,U_2)
| ~ r(U_4,U_3)
| U_3 = U_2
| U_4 = U_2
| U_4 = U_3 ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
! [U_4,U_3] :
( ! [U_2] :
( ~ r(U_3,U_2)
| ~ r(U_4,U_2)
| U_3 = U_2
| U_4 = U_2 )
| ~ r(U_4,U_3)
| U_4 = U_3 ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
! [U_4,U_3,U_2] :
( ~ r(U_3,U_2)
| ~ r(U_4,U_2)
| U_3 = U_2
| U_4 = U_2
| ~ r(U_4,U_3)
| U_4 = U_3 ),
inference(definitional_conversion,[status(esa)],[f_2_3]) ).
cnf(f_2_5,plain,
( ~ r(U_3,U_2)
| ~ r(U_4,U_2)
| U_3 = U_2
| U_4 = U_2
| ~ r(U_4,U_3)
| U_4 = U_3 ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
! [X,Y,Z] :
( r(Y,Z)
| r(X,Z)
| r(X,Y)
| Y = Z
| X = Z
| X = Y ),
inference(fof_nnf,[status(thm)],[rn3acl]) ).
fof(f_3_2,plain,
! [U_7,U_6,U_5] :
( r(U_6,U_5)
| r(U_7,U_5)
| r(U_7,U_6)
| U_6 = U_5
| U_7 = U_5
| U_7 = U_6 ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
! [U_7,U_6] :
( ! [U_5] :
( r(U_6,U_5)
| r(U_7,U_5)
| U_6 = U_5
| U_7 = U_5 )
| r(U_7,U_6)
| U_7 = U_6 ),
inference(miniscope,[status(thm)],[f_3_2]) ).
fof(f_3_4,plain,
! [U_5,U_7,U_6] :
( r(U_6,U_5)
| r(U_7,U_5)
| U_6 = U_5
| U_7 = U_5
| r(U_7,U_6)
| U_7 = U_6 ),
inference(definitional_conversion,[status(esa)],[f_3_3]) ).
cnf(f_3_5,plain,
( r(U_6,U_5)
| r(U_7,U_5)
| U_6 = U_5
| U_7 = U_5
| r(U_7,U_6)
| U_7 = U_6 ),
inference(clausify,[status(thm)],[f_3_4]) ).
fof(f_4_1,plain,
f(f(f(f(f(f(c)))))) != f(c),
inference(fof_nnf,[status(thm)],[f6ck]) ).
fof(f_4_2,plain,
f(f(f(f(f(f(c)))))) != f(c),
inference(definitional_conversion,[status(esa)],[f_4_1]) ).
cnf(f_4_3,plain,
f(f(f(f(f(f(c)))))) != f(c),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,plain,
f(f(f(f(f(f(c)))))) != f(f(c)),
inference(fof_nnf,[status(thm)],[f62ck]) ).
fof(f_5_2,plain,
f(f(f(f(f(f(c)))))) != f(f(c)),
inference(definitional_conversion,[status(esa)],[f_5_1]) ).
cnf(f_5_3,plain,
f(f(f(f(f(f(c)))))) != f(f(c)),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,plain,
f(f(f(f(f(f(c)))))) != f(f(f(c))),
inference(fof_nnf,[status(thm)],[f63ck]) ).
fof(f_6_2,plain,
f(f(f(f(f(f(c)))))) != f(f(f(c))),
inference(definitional_conversion,[status(esa)],[f_6_1]) ).
cnf(f_6_3,plain,
f(f(f(f(f(f(c)))))) != f(f(f(c))),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,plain,
f(f(f(f(f(f(c)))))) != f(f(f(f(c)))),
inference(fof_nnf,[status(thm)],[f64ck]) ).
fof(f_7_2,plain,
f(f(f(f(f(f(c)))))) != f(f(f(f(c)))),
inference(definitional_conversion,[status(esa)],[f_7_1]) ).
cnf(f_7_3,plain,
f(f(f(f(f(f(c)))))) != f(f(f(f(c)))),
inference(clausify,[status(thm)],[f_7_2]) ).
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,
( f(Eq_x_0) = f(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( r(Eq_y_0,Eq_y_1)
| ~ r(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 : GRA119+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03 This is a FOF_UNS_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.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 08:26:21 UTC 2026
% 0.09/0.37 % CPUTime :
% 150.03/150.38 % SZS status Unsatisfiable for theBenchmark
% 150.03/150.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------