↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : PUZ164-2 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n005.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 : Tue Sep 29 12:31:01 PM UTC 2026

% Result   : Unsatisfiable 12.94s 2.07s
% Output   : CNFRefutation 14.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :   15
% Syntax   : Number of clauses     :  258 ( 258 unt;   0 nHn;  13 RR)
%            Number of literals    :  258 ( 257 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-5 aty)
%            Number of variables   : 1159 ( 316 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
    reach(X,X,g,empty) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(c2,axiom,
    g = edge('0',s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).

cnf(c3,plain,
    reach('0','0',g,empty) = reach('0','0',edge('0',s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty),
    inference(congruence,[status(thm)],[c2]) ).

cnf(c4,axiom,
    if_reach_1(true,X2,Y,edge(U,V,I),H) = if_reach_2(eq(Y,V),X2,Y,edge(U,V,I),H),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule11) ).

cnf(c5,plain,
    if_reach_1(true,X5,X7,edge(X4,X6,X3),X2) = if_reach_2(eq(X7,X6),X5,X7,edge(X4,X6,X3),X2),
    inference(substitution,[status(thm)],[c4]) ).

cnf(c6,plain,
    if_reach_2(eq(X7,X6),X5,X7,edge(X4,X6,X3),X2) = if_reach_1(true,X5,X7,edge(X4,X6,X3),X2),
    inference(symmetry,[status(thm)],[c5]) ).

cnf(c7,axiom,
    eq('0','0') = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).

cnf(c8,plain,
    true = eq('0','0'),
    inference(symmetry,[status(thm)],[c7]) ).

cnf(c9,plain,
    if_reach_1(true,X5,X7,edge(X4,X6,X3),X2) = if_reach_1(eq('0','0'),X5,X7,edge(X4,X6,X3),X2),
    inference(congruence,[status(thm)],[c8]) ).

cnf(c10,plain,
    if_reach_2(eq(X7,X6),X5,X7,edge(X4,X6,X3),X2) = if_reach_1(eq('0','0'),X5,X7,edge(X4,X6,X3),X2),
    inference(transitivity,[status(thm)],[c6,c9]) ).

cnf(c11,plain,
    if_reach_2(eq('0',s(X4)),X6,'0',edge(X5,s(X4),X3),X2) = if_reach_1(eq('0','0'),X6,'0',edge(X5,s(X4),X3),X2),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c12,plain,
    if_reach_1(eq('0','0'),X6,'0',edge(X5,s(X4),X3),X2) = if_reach_2(eq('0',s(X4)),X6,'0',edge(X5,s(X4),X3),X2),
    inference(symmetry,[status(thm)],[c11]) ).

cnf(c13,axiom,
    eq('0',s(X2)) = false,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).

cnf(c14,plain,
    if_reach_2(eq('0',s(X4)),X6,'0',edge(X5,s(X4),X3),X2) = if_reach_2(false,X6,'0',edge(X5,s(X4),X3),X2),
    inference(congruence,[status(thm)],[c13]) ).

cnf(c15,plain,
    if_reach_1(eq('0','0'),X6,'0',edge(X5,s(X4),X3),X2) = if_reach_2(false,X6,'0',edge(X5,s(X4),X3),X2),
    inference(transitivity,[status(thm)],[c12,c14]) ).

cnf(c16,plain,
    if_reach_1(eq('0','0'),s(s(s(s(X7)))),'0',edge(X6,s(X5),edge(s('0'),X4,edge(s(s('0')),X3,edge(s(s(s('0'))),X2,empty)))),X8) = if_reach_2(false,s(s(s(s(X7)))),'0',edge(X6,s(X5),edge(s('0'),X4,edge(s(s('0')),X3,edge(s(s(s('0'))),X2,empty)))),X8),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c17,axiom,
    if_reach_2(false,X2,Y2,edge(U2,V2,I2),H2) = or(reach(X2,Y2,I2,H2),reach(V2,Y2,union(I2,H2),empty)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule13) ).

cnf(c18,plain,
    if_reach_2(false,s(s(s(s(X8)))),X7,edge(X6,X5,edge(s('0'),X4,edge(s(s('0')),X3,edge(s(s(s('0'))),X2,empty)))),X9) = or(reach(s(s(s(s(X8)))),X7,edge(s('0'),X4,edge(s(s('0')),X3,edge(s(s(s('0'))),X2,empty))),X9),reach(X5,X7,union(edge(s('0'),X4,edge(s(s('0')),X3,edge(s(s(s('0'))),X2,empty))),X9),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c19,axiom,
    eq(s(X2),s(Y2)) = eq(X2,Y2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule4) ).

cnf(c20,plain,
    eq(s(X3),s(X2)) = eq(X3,X2),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c21,plain,
    eq(X3,X2) = eq(s(X3),s(X2)),
    inference(symmetry,[status(thm)],[c20]) ).

cnf(c22,plain,
    if_reach_1(eq(X7,X6),s(X7),X5,edge(s(X6),X4,X3),X2) = if_reach_1(eq(s(X7),s(X6)),s(X7),X5,edge(s(X6),X4,X3),X2),
    inference(congruence,[status(thm)],[c21]) ).

cnf(c23,axiom,
    reach(X2,Y2,edge(U2,V2,I2),H2) = if_reach_1(eq(X2,U2),X2,Y2,edge(U2,V2,I2),H2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule10) ).

cnf(c24,plain,
    reach(s(X7),X5,edge(s(X6),X4,X3),X2) = if_reach_1(eq(s(X7),s(X6)),s(X7),X5,edge(s(X6),X4,X3),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c25,plain,
    if_reach_1(eq(s(X7),s(X6)),s(X7),X5,edge(s(X6),X4,X3),X2) = reach(s(X7),X5,edge(s(X6),X4,X3),X2),
    inference(symmetry,[status(thm)],[c24]) ).

cnf(c26,plain,
    if_reach_1(eq(X7,X6),s(X7),X5,edge(s(X6),X4,X3),X2) = reach(s(X7),X5,edge(s(X6),X4,X3),X2),
    inference(transitivity,[status(thm)],[c22,c25]) ).

cnf(c27,plain,
    if_reach_1(eq(s(s(s(X7))),'0'),s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = reach(s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),
    inference(substitution,[status(thm)],[c26]) ).

cnf(c28,plain,
    reach(s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = if_reach_1(eq(s(s(s(X7))),'0'),s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),
    inference(symmetry,[status(thm)],[c27]) ).

cnf(c29,axiom,
    eq(s(X2),'0') = false,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule3) ).

cnf(c30,plain,
    eq(s(s(s(X2))),'0') = false,
    inference(substitution,[status(thm)],[c29]) ).

cnf(c31,plain,
    if_reach_1(eq(s(s(s(X7))),'0'),s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = if_reach_1(false,s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),
    inference(congruence,[status(thm)],[c30]) ).

cnf(c32,axiom,
    if_reach_1(false,X2,Y2,edge(U2,V2,I2),H2) = reach(X2,Y2,I2,edge(U2,V2,H2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule14) ).

cnf(c33,plain,
    if_reach_1(false,s(s(s(s(X8)))),X7,edge(X6,X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = reach(s(s(s(s(X8)))),X7,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),edge(X6,X5,X2)),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c34,plain,
    if_reach_1(eq(s(s(s(X6))),s('0')),s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2) = reach(s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2),
    inference(substitution,[status(thm)],[c26]) ).

cnf(c35,plain,
    reach(s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2) = if_reach_1(eq(s(s(s(X6))),s('0')),s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2),
    inference(symmetry,[status(thm)],[c34]) ).

cnf(c36,plain,
    eq(s(s(X2)),s('0')) = eq(s(X2),'0'),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c37,plain,
    eq(s(s(X2)),s('0')) = false,
    inference(transitivity,[status(thm)],[c36,c29]) ).

cnf(c38,plain,
    eq(s(s(s(X2))),s('0')) = false,
    inference(substitution,[status(thm)],[c37]) ).

cnf(c39,plain,
    if_reach_1(eq(s(s(s(X6))),s('0')),s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2) = if_reach_1(false,s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2),
    inference(congruence,[status(thm)],[c38]) ).

cnf(c40,plain,
    if_reach_1(false,s(s(s(s(X7)))),X6,edge(X5,X4,edge(s(s(s('0'))),X3,empty)),X2) = reach(s(s(s(s(X7)))),X6,edge(s(s(s('0'))),X3,empty),edge(X5,X4,X2)),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c41,plain,
    if_reach_1(eq(s(s(s(X5))),s(s('0'))),s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2) = reach(s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2),
    inference(substitution,[status(thm)],[c26]) ).

cnf(c42,plain,
    reach(s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2) = if_reach_1(eq(s(s(s(X5))),s(s('0'))),s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2),
    inference(symmetry,[status(thm)],[c41]) ).

cnf(c43,plain,
    eq(s(s(s(X2))),s(s('0'))) = eq(s(s(X2)),s('0')),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c44,plain,
    eq(s(s(s(X2))),s(s('0'))) = false,
    inference(transitivity,[status(thm)],[c43,c37]) ).

cnf(c45,plain,
    if_reach_1(eq(s(s(s(X5))),s(s('0'))),s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2) = if_reach_1(false,s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2),
    inference(congruence,[status(thm)],[c44]) ).

cnf(c46,plain,
    if_reach_1(false,X6,X5,edge(X4,X3,empty),X2) = reach(X6,X5,empty,edge(X4,X3,X2)),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c47,axiom,
    reach(X2,Y2,empty,H2) = false,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule9) ).

cnf(c48,plain,
    reach(X6,X5,empty,edge(X4,X3,X2)) = false,
    inference(substitution,[status(thm)],[c47]) ).

cnf(c49,plain,
    if_reach_1(false,X6,X5,edge(X4,X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c46,c48]) ).

cnf(c50,plain,
    if_reach_1(false,s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2) = false,
    inference(substitution,[status(thm)],[c49]) ).

cnf(c51,plain,
    if_reach_1(eq(s(s(s(X5))),s(s('0'))),s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c45,c50]) ).

cnf(c52,plain,
    reach(s(s(s(s(X5)))),X4,edge(s(s(s('0'))),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c42,c51]) ).

cnf(c53,plain,
    reach(s(s(s(s(X7)))),X6,edge(s(s(s('0'))),X3,empty),edge(X5,X4,X2)) = false,
    inference(substitution,[status(thm)],[c52]) ).

cnf(c54,plain,
    if_reach_1(false,s(s(s(s(X7)))),X6,edge(X5,X4,edge(s(s(s('0'))),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c40,c53]) ).

cnf(c55,plain,
    if_reach_1(false,s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2) = false,
    inference(substitution,[status(thm)],[c54]) ).

cnf(c56,plain,
    if_reach_1(eq(s(s(s(X6))),s('0')),s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c39,c55]) ).

cnf(c57,plain,
    reach(s(s(s(s(X6)))),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c35,c56]) ).

cnf(c58,plain,
    reach(s(s(s(s(X8)))),X7,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)),edge(X6,X5,X2)) = false,
    inference(substitution,[status(thm)],[c57]) ).

cnf(c59,plain,
    if_reach_1(false,s(s(s(s(X8)))),X7,edge(X6,X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = false,
    inference(transitivity,[status(thm)],[c33,c58]) ).

cnf(c60,plain,
    if_reach_1(false,s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = false,
    inference(substitution,[status(thm)],[c59]) ).

cnf(c61,plain,
    if_reach_1(eq(s(s(s(X7))),'0'),s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = false,
    inference(transitivity,[status(thm)],[c31,c60]) ).

cnf(c62,plain,
    reach(s(s(s(s(X7)))),X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = false,
    inference(transitivity,[status(thm)],[c28,c61]) ).

cnf(c63,plain,
    or(reach(s(s(s(s(X8)))),X7,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty)) = or(false,reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty)),
    inference(congruence,[status(thm)],[c62]) ).

cnf(c64,axiom,
    or(false,Y2) = Y2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule6) ).

cnf(c65,plain,
    or(false,reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty)) = reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty),
    inference(substitution,[status(thm)],[c64]) ).

cnf(c66,plain,
    or(reach(s(s(s(s(X8)))),X7,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty)) = reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty),
    inference(transitivity,[status(thm)],[c63,c65]) ).

cnf(c67,plain,
    if_reach_2(false,s(s(s(s(X9)))),X8,edge(X7,X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2) = reach(X6,X8,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty),
    inference(transitivity,[status(thm)],[c18,c66]) ).

cnf(c68,plain,
    if_reach_2(false,s(s(s(s(X8)))),'0',edge(X7,s(X6),edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2) = reach(s(X6),'0',union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty),
    inference(substitution,[status(thm)],[c67]) ).

cnf(c69,plain,
    if_reach_2(false,'0',X9,edge(X8,X7,edge(s(X6),X5,edge(s(X4),X3,edge(s(X2),X11,empty)))),X10) = or(reach('0',X9,edge(s(X6),X5,edge(s(X4),X3,edge(s(X2),X11,empty))),X10),reach(X7,X9,union(edge(s(X6),X5,edge(s(X4),X3,edge(s(X2),X11,empty))),X10),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c70,plain,
    false = eq('0',s(X2)),
    inference(symmetry,[status(thm)],[c13]) ).

cnf(c71,plain,
    if_reach_1(false,'0',X6,edge(s(X5),X4,X3),X2) = if_reach_1(eq('0',s(X5)),'0',X6,edge(s(X5),X4,X3),X2),
    inference(congruence,[status(thm)],[c70]) ).

cnf(c72,plain,
    reach('0',X6,edge(s(X5),X4,X3),X2) = if_reach_1(eq('0',s(X5)),'0',X6,edge(s(X5),X4,X3),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c73,plain,
    if_reach_1(eq('0',s(X5)),'0',X6,edge(s(X5),X4,X3),X2) = reach('0',X6,edge(s(X5),X4,X3),X2),
    inference(symmetry,[status(thm)],[c72]) ).

cnf(c74,plain,
    if_reach_1(false,'0',X6,edge(s(X5),X4,X3),X2) = reach('0',X6,edge(s(X5),X4,X3),X2),
    inference(transitivity,[status(thm)],[c71,c73]) ).

cnf(c75,plain,
    if_reach_1(false,'0',X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = reach('0',X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),
    inference(substitution,[status(thm)],[c74]) ).

cnf(c76,plain,
    reach('0',X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = if_reach_1(false,'0',X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),
    inference(symmetry,[status(thm)],[c75]) ).

cnf(c77,plain,
    if_reach_1(false,'0',X9,edge(X8,X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = reach('0',X9,edge(s(X6),X5,edge(s(X4),X3,empty)),edge(X8,X7,X2)),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c78,plain,
    if_reach_1(false,'0',X7,edge(s(X6),X5,edge(s(X4),X3,empty)),X2) = reach('0',X7,edge(s(X6),X5,edge(s(X4),X3,empty)),X2),
    inference(substitution,[status(thm)],[c74]) ).

cnf(c79,plain,
    reach('0',X7,edge(s(X6),X5,edge(s(X4),X3,empty)),X2) = if_reach_1(false,'0',X7,edge(s(X6),X5,edge(s(X4),X3,empty)),X2),
    inference(symmetry,[status(thm)],[c78]) ).

cnf(c80,plain,
    if_reach_1(false,'0',X7,edge(X6,X5,edge(s(X4),X3,empty)),X2) = reach('0',X7,edge(s(X4),X3,empty),edge(X6,X5,X2)),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c81,plain,
    reach('0',X5,edge(s(X4),X3,empty),X2) = if_reach_1(eq('0',s(X4)),'0',X5,edge(s(X4),X3,empty),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c82,plain,
    if_reach_1(eq('0',s(X4)),'0',X5,edge(s(X4),X3,empty),X2) = if_reach_1(false,'0',X5,edge(s(X4),X3,empty),X2),
    inference(congruence,[status(thm)],[c13]) ).

cnf(c83,plain,
    if_reach_1(false,'0',X5,edge(s(X4),X3,empty),X2) = false,
    inference(substitution,[status(thm)],[c49]) ).

cnf(c84,plain,
    if_reach_1(eq('0',s(X4)),'0',X5,edge(s(X4),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c82,c83]) ).

cnf(c85,plain,
    reach('0',X5,edge(s(X4),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c81,c84]) ).

cnf(c86,plain,
    reach('0',X7,edge(s(X4),X3,empty),edge(X6,X5,X2)) = false,
    inference(substitution,[status(thm)],[c85]) ).

cnf(c87,plain,
    if_reach_1(false,'0',X7,edge(X6,X5,edge(s(X4),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c80,c86]) ).

cnf(c88,plain,
    if_reach_1(false,'0',X7,edge(s(X6),X5,edge(s(X4),X3,empty)),X2) = false,
    inference(substitution,[status(thm)],[c87]) ).

cnf(c89,plain,
    reach('0',X7,edge(s(X6),X5,edge(s(X4),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c79,c88]) ).

cnf(c90,plain,
    reach('0',X9,edge(s(X6),X5,edge(s(X4),X3,empty)),edge(X8,X7,X2)) = false,
    inference(substitution,[status(thm)],[c89]) ).

cnf(c91,plain,
    if_reach_1(false,'0',X9,edge(X8,X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = false,
    inference(transitivity,[status(thm)],[c77,c90]) ).

cnf(c92,plain,
    if_reach_1(false,'0',X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = false,
    inference(substitution,[status(thm)],[c91]) ).

cnf(c93,plain,
    reach('0',X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = false,
    inference(transitivity,[status(thm)],[c76,c92]) ).

cnf(c94,plain,
    or(reach('0',X10,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),reach(X9,X10,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty)) = or(false,reach(X9,X10,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty)),
    inference(congruence,[status(thm)],[c93]) ).

cnf(c95,plain,
    or(false,reach(X9,X10,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty)) = reach(X9,X10,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty),
    inference(substitution,[status(thm)],[c64]) ).

cnf(c96,plain,
    or(reach('0',X10,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),reach(X9,X10,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty)) = reach(X9,X10,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty),
    inference(transitivity,[status(thm)],[c94,c95]) ).

cnf(c97,plain,
    if_reach_2(false,'0',X11,edge(X10,X9,edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty)))),X2) = reach(X9,X11,union(edge(s(X8),X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2),empty),
    inference(transitivity,[status(thm)],[c69,c96]) ).

cnf(c98,plain,
    if_reach_2(false,'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3) = reach(s(X7),'0',union(edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty))),X3),empty),
    inference(substitution,[status(thm)],[c97]) ).

cnf(c99,plain,
    reach(s(X7),'0',union(edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty))),X3),empty) = if_reach_2(false,'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3),
    inference(symmetry,[status(thm)],[c98]) ).

cnf(c100,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3) = if_reach_2(false,'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c101,plain,
    if_reach_2(false,'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3) = if_reach_1(eq('0','0'),'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3),
    inference(symmetry,[status(thm)],[c100]) ).

cnf(c102,plain,
    if_reach_2(eq('0',s(X5)),X6,'0',edge(X2,s(X5),X4),X3) = if_reach_1(eq('0','0'),X6,'0',edge(X2,s(X5),X4),X3),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c103,plain,
    if_reach_1(eq('0','0'),X6,'0',edge(X2,s(X5),X4),X3) = if_reach_2(eq('0',s(X5)),X6,'0',edge(X2,s(X5),X4),X3),
    inference(symmetry,[status(thm)],[c102]) ).

cnf(c104,plain,
    if_reach_2(eq('0',s(X5)),X6,'0',edge(X2,s(X5),X4),X3) = if_reach_2(false,X6,'0',edge(X2,s(X5),X4),X3),
    inference(congruence,[status(thm)],[c13]) ).

cnf(c105,plain,
    if_reach_2(false,X7,X6,edge(X2,X5,X4),X3) = or(reach(X7,X6,X4,X3),reach(X5,X6,union(X4,X3),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c106,plain,
    if_reach_2(false,X7,X6,edge(X5,X4,X3),X2) = or(reach(X7,X6,X3,X2),reach(X4,X6,union(X3,X2),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c107,plain,
    or(reach(X7,X6,X3,X2),reach(X4,X6,union(X3,X2),empty)) = if_reach_2(false,X7,X6,edge(X5,X4,X3),X2),
    inference(symmetry,[status(thm)],[c106]) ).

cnf(c108,plain,
    if_reach_2(false,X8,X7,edge(X2,X5,X4),X3) = if_reach_2(false,X8,X7,edge(X6,X5,X4),X3),
    inference(transitivity,[status(thm)],[c105,c107]) ).

cnf(c109,plain,
    if_reach_2(false,X7,'0',edge(X2,s(X5),X4),X3) = if_reach_2(false,X7,'0',edge(X6,s(X5),X4),X3),
    inference(substitution,[status(thm)],[c108]) ).

cnf(c110,plain,
    false = eq('0',s(X2)),
    inference(symmetry,[status(thm)],[c13]) ).

cnf(c111,plain,
    if_reach_2(false,X6,'0',edge(X5,s(X4),X3),X2) = if_reach_2(eq('0',s(X4)),X6,'0',edge(X5,s(X4),X3),X2),
    inference(congruence,[status(thm)],[c110]) ).

cnf(c112,plain,
    if_reach_2(eq('0',s(X4)),X6,'0',edge(X5,s(X4),X3),X2) = if_reach_1(eq('0','0'),X6,'0',edge(X5,s(X4),X3),X2),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c113,plain,
    if_reach_2(false,X6,'0',edge(X5,s(X4),X3),X2) = if_reach_1(eq('0','0'),X6,'0',edge(X5,s(X4),X3),X2),
    inference(transitivity,[status(thm)],[c111,c112]) ).

cnf(c114,plain,
    if_reach_2(false,X7,'0',edge(X2,s(X5),X4),X3) = if_reach_1(eq('0','0'),X7,'0',edge(X6,s(X5),X4),X3),
    inference(transitivity,[status(thm)],[c109,c113]) ).

cnf(c115,plain,
    if_reach_2(eq('0',s(X5)),X7,'0',edge(X2,s(X5),X4),X3) = if_reach_1(eq('0','0'),X7,'0',edge(X6,s(X5),X4),X3),
    inference(transitivity,[status(thm)],[c104,c114]) ).

cnf(c116,plain,
    if_reach_1(eq('0','0'),X7,'0',edge(X2,s(X5),X4),X3) = if_reach_1(eq('0','0'),X7,'0',edge(X6,s(X5),X4),X3),
    inference(transitivity,[status(thm)],[c103,c115]) ).

cnf(c117,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X5,s(X4),X3),X2) = if_reach_1(eq('0','0'),'0','0',edge('0',s(X4),X3),X2),
    inference(substitution,[status(thm)],[c116]) ).

cnf(c118,plain,
    reach('0','0',edge('0',s(X4),X3),X2) = if_reach_1(eq('0','0'),'0','0',edge('0',s(X4),X3),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c119,plain,
    if_reach_1(eq('0','0'),'0','0',edge('0',s(X4),X3),X2) = reach('0','0',edge('0',s(X4),X3),X2),
    inference(symmetry,[status(thm)],[c118]) ).

cnf(c120,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X5,s(X4),X3),X2) = reach('0','0',edge('0',s(X4),X3),X2),
    inference(transitivity,[status(thm)],[c117,c119]) ).

cnf(c121,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3) = reach('0','0',edge('0',s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3),
    inference(substitution,[status(thm)],[c120]) ).

cnf(c122,plain,
    if_reach_2(false,'0','0',edge(X2,s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3) = reach('0','0',edge('0',s(X7),edge(s('0'),X6,edge(s(s('0')),X5,edge(s(s(s('0'))),X4,empty)))),X3),
    inference(transitivity,[status(thm)],[c101,c121]) ).

cnf(c123,plain,
    reach(s(X6),'0',union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty) = reach('0','0',edge('0',s(X6),edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2),
    inference(transitivity,[status(thm)],[c99,c122]) ).

cnf(c124,plain,
    if_reach_2(false,s(s(s(s(X8)))),'0',edge(X7,s(X6),edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2) = reach('0','0',edge('0',s(X6),edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2),
    inference(transitivity,[status(thm)],[c68,c123]) ).

cnf(c125,plain,
    if_reach_1(eq('0','0'),s(s(s(s(X8)))),'0',edge(X7,s(X6),edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2) = reach('0','0',edge('0',s(X6),edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2),
    inference(transitivity,[status(thm)],[c16,c124]) ).

cnf(c126,plain,
    if_reach_1(eq('0','0'),s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = reach('0','0',edge('0',s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty),
    inference(substitution,[status(thm)],[c125]) ).

cnf(c127,plain,
    reach('0','0',edge('0',s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = if_reach_1(eq('0','0'),s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty),
    inference(symmetry,[status(thm)],[c126]) ).

cnf(c128,plain,
    if_reach_1(eq('0','0'),s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = if_reach_2(false,s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c129,axiom,
    union(edge(X2,Y2,I2),H2) = edge(X2,Y2,union(I2,H2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule8) ).

cnf(c130,plain,
    union(edge(X8,X7,edge(X6,X5,edge(X4,X3,empty))),X2) = edge(X8,X7,union(edge(X6,X5,edge(X4,X3,empty)),X2)),
    inference(substitution,[status(thm)],[c129]) ).

cnf(c131,plain,
    union(edge(X6,X5,edge(X4,X3,empty)),X2) = edge(X6,X5,union(edge(X4,X3,empty),X2)),
    inference(substitution,[status(thm)],[c129]) ).

cnf(c132,plain,
    union(edge(X4,X3,empty),X2) = edge(X4,X3,union(empty,X2)),
    inference(substitution,[status(thm)],[c129]) ).

cnf(c133,axiom,
    union(empty,H2) = H2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule7) ).

cnf(c134,plain,
    union(empty,X2) = X2,
    inference(substitution,[status(thm)],[c133]) ).

cnf(c135,plain,
    edge(X4,X3,union(empty,X2)) = edge(X4,X3,X2),
    inference(congruence,[status(thm)],[c134]) ).

cnf(c136,plain,
    union(edge(X4,X3,empty),X2) = edge(X4,X3,X2),
    inference(transitivity,[status(thm)],[c132,c135]) ).

cnf(c137,plain,
    edge(X6,X5,union(edge(X4,X3,empty),X2)) = edge(X6,X5,edge(X4,X3,X2)),
    inference(congruence,[status(thm)],[c136]) ).

cnf(c138,plain,
    union(edge(X6,X5,edge(X4,X3,empty)),X2) = edge(X6,X5,edge(X4,X3,X2)),
    inference(transitivity,[status(thm)],[c131,c137]) ).

cnf(c139,plain,
    edge(X8,X7,union(edge(X6,X5,edge(X4,X3,empty)),X2)) = edge(X8,X7,edge(X6,X5,edge(X4,X3,X2))),
    inference(congruence,[status(thm)],[c138]) ).

cnf(c140,plain,
    union(edge(X8,X7,edge(X6,X5,edge(X4,X3,empty))),X2) = edge(X8,X7,edge(X6,X5,edge(X4,X3,X2))),
    inference(transitivity,[status(thm)],[c130,c139]) ).

cnf(c141,plain,
    union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2) = edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,X2))),
    inference(substitution,[status(thm)],[c140]) ).

cnf(c142,plain,
    reach(X6,X7,union(edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty))),X2),empty) = reach(X6,X7,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,X2))),empty),
    inference(congruence,[status(thm)],[c141]) ).

cnf(c143,plain,
    if_reach_2(false,s(s(s(s(X9)))),X8,edge(X7,X6,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,empty)))),X2) = reach(X6,X8,edge(s('0'),X5,edge(s(s('0')),X4,edge(s(s(s('0'))),X3,X2))),empty),
    inference(transitivity,[status(thm)],[c67,c142]) ).

cnf(c144,plain,
    if_reach_2(false,s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = reach(s('0'),'0',edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty),
    inference(substitution,[status(thm)],[c143]) ).

cnf(c145,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X8,s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2) = if_reach_2(false,'0','0',edge(X8,s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c146,plain,
    if_reach_2(false,'0',X9,edge(X8,X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = or(reach('0',X9,edge(s(X6),X5,edge(s(X4),X3,empty)),X2),reach(X7,X9,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c147,plain,
    or(reach('0',X8,edge(s(X6),X5,edge(s(X4),X3,empty)),X2),reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty)) = or(false,reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty)),
    inference(congruence,[status(thm)],[c89]) ).

cnf(c148,plain,
    or(false,reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty)) = reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty),
    inference(substitution,[status(thm)],[c64]) ).

cnf(c149,plain,
    or(reach('0',X8,edge(s(X6),X5,edge(s(X4),X3,empty)),X2),reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty)) = reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty),
    inference(transitivity,[status(thm)],[c147,c148]) ).

cnf(c150,plain,
    if_reach_2(false,'0',X9,edge(X8,X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = reach(X7,X9,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty),
    inference(transitivity,[status(thm)],[c146,c149]) ).

cnf(c151,plain,
    if_reach_2(false,'0','0',edge(X8,s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2) = reach(s(X7),'0',union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty),
    inference(substitution,[status(thm)],[c150]) ).

cnf(c152,plain,
    if_reach_2(false,s('0'),X9,edge(X8,X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2) = or(reach(s('0'),X9,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),reach(X7,X9,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c153,plain,
    eq(s('0'),s(s(X2))) = eq('0',s(X2)),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c154,plain,
    eq(s('0'),s(s(X2))) = false,
    inference(transitivity,[status(thm)],[c153,c13]) ).

cnf(c155,plain,
    false = eq(s('0'),s(s(X2))),
    inference(symmetry,[status(thm)],[c154]) ).

cnf(c156,plain,
    if_reach_1(false,s('0'),X6,edge(s(s(X5)),X4,X3),X2) = if_reach_1(eq(s('0'),s(s(X5))),s('0'),X6,edge(s(s(X5)),X4,X3),X2),
    inference(congruence,[status(thm)],[c155]) ).

cnf(c157,plain,
    reach(s('0'),X6,edge(s(s(X5)),X4,X3),X2) = if_reach_1(eq(s('0'),s(s(X5))),s('0'),X6,edge(s(s(X5)),X4,X3),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c158,plain,
    if_reach_1(eq(s('0'),s(s(X5))),s('0'),X6,edge(s(s(X5)),X4,X3),X2) = reach(s('0'),X6,edge(s(s(X5)),X4,X3),X2),
    inference(symmetry,[status(thm)],[c157]) ).

cnf(c159,plain,
    if_reach_1(false,s('0'),X6,edge(s(s(X5)),X4,X3),X2) = reach(s('0'),X6,edge(s(s(X5)),X4,X3),X2),
    inference(transitivity,[status(thm)],[c156,c158]) ).

cnf(c160,plain,
    if_reach_1(false,s('0'),X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2) = reach(s('0'),X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),
    inference(substitution,[status(thm)],[c159]) ).

cnf(c161,plain,
    reach(s('0'),X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2) = if_reach_1(false,s('0'),X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),
    inference(symmetry,[status(thm)],[c160]) ).

cnf(c162,plain,
    if_reach_1(false,s('0'),X7,edge(X6,X5,edge(s(s(X4)),X3,empty)),X2) = reach(s('0'),X7,edge(s(s(X4)),X3,empty),edge(X6,X5,X2)),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c163,plain,
    reach(s('0'),X5,edge(s(s(X4)),X3,empty),X2) = if_reach_1(eq(s('0'),s(s(X4))),s('0'),X5,edge(s(s(X4)),X3,empty),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c164,plain,
    if_reach_1(eq(s('0'),s(s(X4))),s('0'),X5,edge(s(s(X4)),X3,empty),X2) = if_reach_1(false,s('0'),X5,edge(s(s(X4)),X3,empty),X2),
    inference(congruence,[status(thm)],[c154]) ).

cnf(c165,plain,
    if_reach_1(false,s('0'),X5,edge(s(s(X4)),X3,empty),X2) = false,
    inference(substitution,[status(thm)],[c49]) ).

cnf(c166,plain,
    if_reach_1(eq(s('0'),s(s(X4))),s('0'),X5,edge(s(s(X4)),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c164,c165]) ).

cnf(c167,plain,
    reach(s('0'),X5,edge(s(s(X4)),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c163,c166]) ).

cnf(c168,plain,
    reach(s('0'),X7,edge(s(s(X4)),X3,empty),edge(X6,X5,X2)) = false,
    inference(substitution,[status(thm)],[c167]) ).

cnf(c169,plain,
    if_reach_1(false,s('0'),X7,edge(X6,X5,edge(s(s(X4)),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c162,c168]) ).

cnf(c170,plain,
    if_reach_1(false,s('0'),X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2) = false,
    inference(substitution,[status(thm)],[c169]) ).

cnf(c171,plain,
    reach(s('0'),X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2) = false,
    inference(transitivity,[status(thm)],[c161,c170]) ).

cnf(c172,plain,
    or(reach(s('0'),X8,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),reach(X7,X8,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty)) = or(false,reach(X7,X8,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty)),
    inference(congruence,[status(thm)],[c171]) ).

cnf(c173,plain,
    or(false,reach(X7,X8,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty)) = reach(X7,X8,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty),
    inference(substitution,[status(thm)],[c64]) ).

cnf(c174,plain,
    or(reach(s('0'),X8,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),reach(X7,X8,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty)) = reach(X7,X8,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty),
    inference(transitivity,[status(thm)],[c172,c173]) ).

cnf(c175,plain,
    if_reach_2(false,s('0'),X9,edge(X8,X7,edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2) = reach(X7,X9,union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty),
    inference(transitivity,[status(thm)],[c152,c174]) ).

cnf(c176,plain,
    if_reach_2(false,s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3) = reach(s(X8),'0',union(edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty)),X3),empty),
    inference(substitution,[status(thm)],[c175]) ).

cnf(c177,plain,
    reach(s(X8),'0',union(edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty)),X3),empty) = if_reach_2(false,s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3),
    inference(symmetry,[status(thm)],[c176]) ).

cnf(c178,plain,
    if_reach_1(eq('0','0'),s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3) = if_reach_2(false,s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c179,plain,
    if_reach_2(false,s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3) = if_reach_1(eq('0','0'),s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3),
    inference(symmetry,[status(thm)],[c178]) ).

cnf(c180,plain,
    if_reach_1(eq('0','0'),s('0'),'0',edge(X5,s(X4),X3),X2) = if_reach_1(eq('0','0'),s('0'),'0',edge(s('0'),s(X4),X3),X2),
    inference(substitution,[status(thm)],[c116]) ).

cnf(c181,plain,
    if_reach_1(eq('0','0'),s('0'),'0',edge(s('0'),s(X4),X3),X2) = reach(s('0'),'0',edge(s('0'),s(X4),X3),X2),
    inference(substitution,[status(thm)],[c26]) ).

cnf(c182,plain,
    if_reach_1(eq('0','0'),s('0'),'0',edge(X5,s(X4),X3),X2) = reach(s('0'),'0',edge(s('0'),s(X4),X3),X2),
    inference(transitivity,[status(thm)],[c180,c181]) ).

cnf(c183,plain,
    if_reach_1(eq('0','0'),s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3) = reach(s('0'),'0',edge(s('0'),s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3),
    inference(substitution,[status(thm)],[c182]) ).

cnf(c184,plain,
    if_reach_2(false,s('0'),'0',edge(X2,s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3) = reach(s('0'),'0',edge(s('0'),s(X8),edge(s(s(X7)),X6,edge(s(s(X5)),X4,empty))),X3),
    inference(transitivity,[status(thm)],[c179,c183]) ).

cnf(c185,plain,
    reach(s(X7),'0',union(edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty)),X2),empty) = reach(s('0'),'0',edge(s('0'),s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2),
    inference(transitivity,[status(thm)],[c177,c184]) ).

cnf(c186,plain,
    if_reach_2(false,'0','0',edge(X8,s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2) = reach(s('0'),'0',edge(s('0'),s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2),
    inference(transitivity,[status(thm)],[c151,c185]) ).

cnf(c187,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X8,s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2) = reach(s('0'),'0',edge(s('0'),s(X7),edge(s(s(X6)),X5,edge(s(s(X4)),X3,empty))),X2),
    inference(transitivity,[status(thm)],[c145,c186]) ).

cnf(c188,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = reach(s('0'),'0',edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty),
    inference(substitution,[status(thm)],[c187]) ).

cnf(c189,plain,
    reach(s('0'),'0',edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = if_reach_1(eq('0','0'),'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty),
    inference(symmetry,[status(thm)],[c188]) ).

cnf(c190,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = if_reach_2(false,'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c191,plain,
    union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2) = edge(s(X6),X5,edge(s(X4),X3,X2)),
    inference(substitution,[status(thm)],[c138]) ).

cnf(c192,plain,
    reach(X7,X8,union(edge(s(X6),X5,edge(s(X4),X3,empty)),X2),empty) = reach(X7,X8,edge(s(X6),X5,edge(s(X4),X3,X2)),empty),
    inference(congruence,[status(thm)],[c191]) ).

cnf(c193,plain,
    if_reach_2(false,'0',X9,edge(X8,X7,edge(s(X6),X5,edge(s(X4),X3,empty))),X2) = reach(X7,X9,edge(s(X6),X5,edge(s(X4),X3,X2)),empty),
    inference(transitivity,[status(thm)],[c150,c192]) ).

cnf(c194,plain,
    if_reach_2(false,'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = reach(s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),empty),
    inference(substitution,[status(thm)],[c193]) ).

cnf(c195,plain,
    eq(s(s(X3)),s(s(X2))) = eq(s(X3),s(X2)),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c196,plain,
    eq(s(X3),s(X2)) = eq(X3,X2),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c197,plain,
    eq(s(s(X3)),s(s(X2))) = eq(X3,X2),
    inference(transitivity,[status(thm)],[c195,c196]) ).

cnf(c198,plain,
    eq(X3,X2) = eq(s(s(X3)),s(s(X2))),
    inference(symmetry,[status(thm)],[c197]) ).

cnf(c199,plain,
    if_reach_1(eq(X7,X6),s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2) = if_reach_1(eq(s(s(X7)),s(s(X6))),s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2),
    inference(congruence,[status(thm)],[c198]) ).

cnf(c200,plain,
    reach(s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2) = if_reach_1(eq(s(s(X7)),s(s(X6))),s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c201,plain,
    if_reach_1(eq(s(s(X7)),s(s(X6))),s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2) = reach(s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2),
    inference(symmetry,[status(thm)],[c200]) ).

cnf(c202,plain,
    if_reach_1(eq(X7,X6),s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2) = reach(s(s(X7)),X5,edge(s(s(X6)),X4,X3),X2),
    inference(transitivity,[status(thm)],[c199,c201]) ).

cnf(c203,plain,
    if_reach_1(eq('0','0'),s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2) = reach(s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2),
    inference(substitution,[status(thm)],[c202]) ).

cnf(c204,plain,
    reach(s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2) = if_reach_1(eq('0','0'),s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2),
    inference(symmetry,[status(thm)],[c203]) ).

cnf(c205,plain,
    if_reach_1(eq('0','0'),X4,'0',edge(X2,s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X3) = if_reach_2(false,X4,'0',edge(X2,s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X3),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c206,plain,
    if_reach_2(false,X4,'0',edge(X2,s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X3) = or(reach(X4,'0',edge(s(s(s('0'))),'0',empty),X3),reach(s(s(s('0'))),'0',union(edge(s(s(s('0'))),'0',empty),X3),empty)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c207,plain,
    union(edge(s(s(s('0'))),'0',empty),X2) = edge(s(s(s('0'))),'0',X2),
    inference(substitution,[status(thm)],[c136]) ).

cnf(c208,plain,
    reach(s(s(s('0'))),'0',union(edge(s(s(s('0'))),'0',empty),X3),X2) = reach(s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2),
    inference(congruence,[status(thm)],[c207]) ).

cnf(c209,plain,
    eq(s(s(s(X3))),s(s(s(X2)))) = eq(s(s(X3)),s(s(X2))),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c210,plain,
    eq(s(s(s(X3))),s(s(s(X2)))) = eq(X3,X2),
    inference(transitivity,[status(thm)],[c209,c197]) ).

cnf(c211,plain,
    eq(X3,X2) = eq(s(s(s(X3))),s(s(s(X2)))),
    inference(symmetry,[status(thm)],[c210]) ).

cnf(c212,plain,
    if_reach_1(eq(X7,X6),s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2) = if_reach_1(eq(s(s(s(X7))),s(s(s(X6)))),s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2),
    inference(congruence,[status(thm)],[c211]) ).

cnf(c213,plain,
    reach(s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2) = if_reach_1(eq(s(s(s(X7))),s(s(s(X6)))),s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c214,plain,
    if_reach_1(eq(s(s(s(X7))),s(s(s(X6)))),s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2) = reach(s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2),
    inference(symmetry,[status(thm)],[c213]) ).

cnf(c215,plain,
    if_reach_1(eq(X7,X6),s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2) = reach(s(s(s(X7))),X5,edge(s(s(s(X6))),X4,X3),X2),
    inference(transitivity,[status(thm)],[c212,c214]) ).

cnf(c216,plain,
    if_reach_1(eq('0','0'),s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2) = reach(s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2),
    inference(substitution,[status(thm)],[c215]) ).

cnf(c217,plain,
    reach(s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2) = if_reach_1(eq('0','0'),s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2),
    inference(symmetry,[status(thm)],[c216]) ).

cnf(c218,plain,
    if_reach_2(eq('0','0'),X5,'0',edge(X4,'0',X3),X2) = if_reach_1(eq('0','0'),X5,'0',edge(X4,'0',X3),X2),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c219,plain,
    if_reach_1(eq('0','0'),X5,'0',edge(X4,'0',X3),X2) = if_reach_2(eq('0','0'),X5,'0',edge(X4,'0',X3),X2),
    inference(symmetry,[status(thm)],[c218]) ).

cnf(c220,plain,
    if_reach_2(eq('0','0'),X7,X6,edge(X5,X4,X3),X2) = if_reach_2(true,X7,X6,edge(X5,X4,X3),X2),
    inference(congruence,[status(thm)],[c7]) ).

cnf(c221,axiom,
    if_reach_2(true,X2,Y2,edge(U2,V2,I2),H2) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule12) ).

cnf(c222,plain,
    if_reach_2(true,X7,X6,edge(X5,X4,X3),X2) = true,
    inference(substitution,[status(thm)],[c221]) ).

cnf(c223,plain,
    true = eq('0','0'),
    inference(symmetry,[status(thm)],[c7]) ).

cnf(c224,plain,
    if_reach_2(true,X7,X6,edge(X5,X4,X3),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c222,c223]) ).

cnf(c225,plain,
    if_reach_2(eq('0','0'),X7,X6,edge(X5,X4,X3),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c220,c224]) ).

cnf(c226,plain,
    if_reach_2(eq('0','0'),X5,'0',edge(X4,'0',X3),X2) = eq('0','0'),
    inference(substitution,[status(thm)],[c225]) ).

cnf(c227,plain,
    if_reach_1(eq('0','0'),X5,'0',edge(X4,'0',X3),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c219,c226]) ).

cnf(c228,plain,
    if_reach_1(eq('0','0'),s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2) = eq('0','0'),
    inference(substitution,[status(thm)],[c227]) ).

cnf(c229,plain,
    reach(s(s(s('0'))),'0',edge(s(s(s('0'))),'0',X3),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c217,c228]) ).

cnf(c230,plain,
    reach(s(s(s('0'))),'0',union(edge(s(s(s('0'))),'0',empty),X3),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c208,c229]) ).

cnf(c231,plain,
    reach(s(s(s('0'))),'0',union(edge(s(s(s('0'))),'0',empty),X2),empty) = eq('0','0'),
    inference(substitution,[status(thm)],[c230]) ).

cnf(c232,plain,
    or(reach(X3,'0',edge(s(s(s('0'))),'0',empty),X2),reach(s(s(s('0'))),'0',union(edge(s(s(s('0'))),'0',empty),X2),empty)) = or(reach(X3,'0',edge(s(s(s('0'))),'0',empty),X2),eq('0','0')),
    inference(congruence,[status(thm)],[c231]) ).

cnf(c233,plain,
    if_reach_2(false,X4,'0',edge(X2,s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X3) = or(reach(X4,'0',edge(s(s(s('0'))),'0',empty),X3),eq('0','0')),
    inference(transitivity,[status(thm)],[c206,c232]) ).

cnf(c234,plain,
    if_reach_1(eq('0','0'),X4,'0',edge(X2,s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X3) = or(reach(X4,'0',edge(s(s(s('0'))),'0',empty),X3),eq('0','0')),
    inference(transitivity,[status(thm)],[c205,c233]) ).

cnf(c235,plain,
    if_reach_1(eq('0','0'),s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2) = or(reach(s(s('0')),'0',edge(s(s(s('0'))),'0',empty),X2),eq('0','0')),
    inference(substitution,[status(thm)],[c234]) ).

cnf(c236,plain,
    reach(s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2) = if_reach_1(eq(s(s('0')),s(s(s(X4)))),s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2),
    inference(substitution,[status(thm)],[c23]) ).

cnf(c237,plain,
    eq(s(s('0')),s(s(s(X2)))) = eq(s('0'),s(s(X2))),
    inference(substitution,[status(thm)],[c19]) ).

cnf(c238,plain,
    eq(s(s('0')),s(s(s(X2)))) = false,
    inference(transitivity,[status(thm)],[c237,c154]) ).

cnf(c239,plain,
    if_reach_1(eq(s(s('0')),s(s(s(X4)))),s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2) = if_reach_1(false,s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2),
    inference(congruence,[status(thm)],[c238]) ).

cnf(c240,plain,
    if_reach_1(false,s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2) = false,
    inference(substitution,[status(thm)],[c49]) ).

cnf(c241,plain,
    if_reach_1(eq(s(s('0')),s(s(s(X4)))),s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c239,c240]) ).

cnf(c242,plain,
    reach(s(s('0')),X5,edge(s(s(s(X4))),X3,empty),X2) = false,
    inference(transitivity,[status(thm)],[c236,c241]) ).

cnf(c243,plain,
    reach(s(s('0')),'0',edge(s(s(s('0'))),'0',empty),X2) = false,
    inference(substitution,[status(thm)],[c242]) ).

cnf(c244,plain,
    or(reach(s(s('0')),'0',edge(s(s(s('0'))),'0',empty),X2),eq('0','0')) = or(false,eq('0','0')),
    inference(congruence,[status(thm)],[c243]) ).

cnf(c245,plain,
    or(false,eq('0','0')) = eq('0','0'),
    inference(substitution,[status(thm)],[c64]) ).

cnf(c246,plain,
    or(reach(s(s('0')),'0',edge(s(s(s('0'))),'0',empty),X2),eq('0','0')) = eq('0','0'),
    inference(transitivity,[status(thm)],[c244,c245]) ).

cnf(c247,plain,
    if_reach_1(eq('0','0'),s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c235,c246]) ).

cnf(c248,plain,
    reach(s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),X2) = eq('0','0'),
    inference(transitivity,[status(thm)],[c204,c247]) ).

cnf(c249,plain,
    reach(s(s('0')),'0',edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)),empty) = eq('0','0'),
    inference(substitution,[status(thm)],[c248]) ).

cnf(c250,plain,
    if_reach_2(false,'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = eq('0','0'),
    inference(transitivity,[status(thm)],[c194,c249]) ).

cnf(c251,plain,
    if_reach_1(eq('0','0'),'0','0',edge(X2,s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = eq('0','0'),
    inference(transitivity,[status(thm)],[c190,c250]) ).

cnf(c252,plain,
    reach(s('0'),'0',edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty))),empty) = eq('0','0'),
    inference(transitivity,[status(thm)],[c189,c251]) ).

cnf(c253,plain,
    if_reach_2(false,s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = eq('0','0'),
    inference(transitivity,[status(thm)],[c144,c252]) ).

cnf(c254,plain,
    if_reach_1(eq('0','0'),s(s(s(s(X3)))),'0',edge(X2,s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = eq('0','0'),
    inference(transitivity,[status(thm)],[c128,c253]) ).

cnf(c255,plain,
    reach('0','0',edge('0',s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = eq('0','0'),
    inference(transitivity,[status(thm)],[c127,c254]) ).

cnf(c256,plain,
    reach('0','0',edge('0',s('0'),edge(s('0'),s(s('0')),edge(s(s('0')),s(s(s('0'))),edge(s(s(s('0'))),'0',empty)))),empty) = true,
    inference(transitivity,[status(thm)],[c255,c7]) ).

cnf(c257,plain,
    reach('0','0',g,empty) = true,
    inference(transitivity,[status(thm)],[c3,c256]) ).

cnf(c258,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c257]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ164-2 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 22:46:46 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.94/2.07  Command-line arguments: --flatten --complete-subsets
% 12.94/2.07  
% 12.94/2.07  % SZS status Unsatisfiable
% 12.94/2.07  
% 12.94/2.12  % SZS output start CNFRefutation
% See solution above
% 14.86/2.37  
% 14.86/2.37  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------