TSTP Solution File: SWV254-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV254-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 23:03:13 EDT 2023

% Result   : Unsatisfiable 238.46s 30.47s
% Output   : Proof 238.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWV254-1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Aug 29 11:08:11 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 238.46/30.47  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 238.46/30.47  
% 238.46/30.47  % SZS status Unsatisfiable
% 238.46/30.47  
% 238.46/30.47  % SZS output start Proof
% 238.46/30.47  Take the following subset of the input axioms:
% 238.46/30.49    fof(cls_Datatype_Ooption_Odistinct__1_0, axiom, ![T_a, V_a_H]: c_Datatype_Ooption_ONone!=c_Datatype_Ooption_OSome(V_a_H, T_a)).
% 238.46/30.49    fof(cls_Datatype_Ooption_Odistinct__2_0, axiom, ![T_a2, V_a_H2]: c_Datatype_Ooption_OSome(V_a_H2, T_a2)!=c_Datatype_Ooption_ONone).
% 238.46/30.49    fof(cls_Datatype__Universe_OAtom__not__Scons_0, axiom, ![T_b, V_N, V_M, V_a, T_a2]: c_Datatype__Universe_OAtom(V_a, T_a2, T_b)!=c_Datatype__Universe_OScons(V_M, V_N, T_a2, T_b)).
% 238.46/30.49    fof(cls_Datatype__Universe_OIn0__not__In1_0, axiom, ![T_a2, T_b2, V_N2, V_M2]: c_Datatype__Universe_OIn0(V_M2, T_a2, T_b2)!=c_Datatype__Universe_OIn1(V_N2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_OIn1__not__In0_0, axiom, ![T_a2, T_b2, V_N2, V_M2]: c_Datatype__Universe_OIn1(V_N2, T_a2, T_b2)!=c_Datatype__Universe_OIn0(V_M2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_OLeaf__not__Numb_0, axiom, ![V_k, T_a2, V_a2, T_b2]: c_Datatype__Universe_OLeaf(V_a2, T_a2, T_b2)!=c_Datatype__Universe_ONumb(V_k, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_OLeaf__not__Scons_0, axiom, ![T_a2, V_a2, T_b2, V_N2, V_M2]: c_Datatype__Universe_OLeaf(V_a2, T_a2, T_b2)!=c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_ONumb__not__Leaf_0, axiom, ![T_a2, V_a2, T_b2, V_k2]: c_Datatype__Universe_ONumb(V_k2, T_a2, T_b2)!=c_Datatype__Universe_OLeaf(V_a2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_ONumb__not__Scons_0, axiom, ![T_a2, T_b2, V_k2, V_N2, V_M2]: c_Datatype__Universe_ONumb(V_k2, T_a2, T_b2)!=c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_OScons__not__Atom_0, axiom, ![T_a2, V_a2, T_b2, V_N2, V_M2]: c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)!=c_Datatype__Universe_OAtom(V_a2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_OScons__not__Leaf_0, axiom, ![T_a2, V_a2, T_b2, V_N2, V_M2]: c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)!=c_Datatype__Universe_OLeaf(V_a2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Datatype__Universe_OScons__not__Numb_0, axiom, ![T_a2, T_b2, V_k2, V_N2, V_M2]: c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)!=c_Datatype__Universe_ONumb(V_k2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_IntArith_Oarith__special__14_0, axiom, ![V_y, T_a2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_IntDef_Oneg(c_Numeral_Onumber__of(c_Numeral_Obin__add(V_y, c_Numeral_Obin__minus(c_Numeral_OPls)), T_a2), T_a2) | ~c_lessequals(c_0, c_Numeral_Onumber__of(V_y, T_a2), T_a2))))).
% 238.46/30.49    fof(cls_IntArith_Oarith__special__15_0, axiom, ![T_a2, V_y2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_IntDef_Oneg(c_Numeral_Onumber__of(c_Numeral_Obin__add(V_y2, c_Numeral_Obin__minus(c_Numeral_OBit(c_Numeral_OPls, c_Numeral_Obit_OB1))), T_a2), T_a2) | ~c_lessequals(c_1, c_Numeral_Onumber__of(V_y2, T_a2), T_a2))))).
% 238.46/30.49    fof(cls_IntArith_Oarith__special__16_0, axiom, ![V_x, T_a2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_IntDef_Oneg(c_Numeral_Onumber__of(c_Numeral_Obin__add(c_Numeral_OPls, c_Numeral_Obin__minus(V_x)), T_a2), T_a2) | ~c_lessequals(c_Numeral_Onumber__of(V_x, T_a2), c_0, T_a2))))).
% 238.46/30.49    fof(cls_IntArith_Oarith__special__17_0, axiom, ![T_a2, V_x2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_IntDef_Oneg(c_Numeral_Onumber__of(c_Numeral_Obin__add(c_Numeral_OBit(c_Numeral_OPls, c_Numeral_Obit_OB1), c_Numeral_Obin__minus(V_x2)), T_a2), T_a2) | ~c_lessequals(c_Numeral_Onumber__of(V_x2, T_a2), c_1, T_a2))))).
% 238.46/30.49    fof(cls_IntDef_Oint__less__0__conv_0, axiom, ![V_k2]: ~c_less(c_IntDef_Oint(V_k2), c_0, tc_IntDef_Oint)).
% 238.46/30.49    fof(cls_IntDef_Onot__int__zless__negative_0, axiom, ![V_m, V_n]: ~c_less(c_IntDef_Oint(V_n), c_uminus(c_IntDef_Oint(V_m), tc_IntDef_Oint), tc_IntDef_Oint)).
% 238.46/30.49    fof(cls_IntDef_Onot__neg__int_0, axiom, ![V_n2]: ~c_IntDef_Oneg(c_IntDef_Oint(V_n2), tc_IntDef_Oint)).
% 238.46/30.49    fof(cls_IntDef_Onot__zle__0__negative_0, axiom, ![V_n2]: ~c_lessequals(c_0, c_uminus(c_IntDef_Oint(c_Suc(V_n2)), tc_IntDef_Oint), tc_IntDef_Oint)).
% 238.46/30.49    fof(cls_List_ONil2__notin__lex_0, axiom, ![V_r, V_xs, T_a2]: ~c_in(c_Pair(V_xs, c_List_Olist_ONil, tc_List_Olist(T_a2), tc_List_Olist(T_a2)), c_List_Olex(V_r, T_a2), tc_prod(tc_List_Olist(T_a2), tc_List_Olist(T_a2)))).
% 238.46/30.49    fof(cls_List_ONil__notin__lex_0, axiom, ![V_ys, T_a2, V_r2]: ~c_in(c_Pair(c_List_Olist_ONil, V_ys, tc_List_Olist(T_a2), tc_List_Olist(T_a2)), c_List_Olex(V_r2, T_a2), tc_prod(tc_List_Olist(T_a2), tc_List_Olist(T_a2)))).
% 238.46/30.49    fof(cls_List_Odistinct_Osimps__2_0, axiom, ![T_a__1, V_x2, V_xs2]: (~c_List_Odistinct(c_List_Olist_OCons(V_x2, V_xs2, T_a__1), T_a__1) | ~c_in(V_x2, c_List_Oset(V_xs2, T_a__1), T_a__1))).
% 238.46/30.49    fof(cls_List_Olength__greater__0__conv_0, axiom, ![T_a2]: ~c_less(c_0, c_Nat_Osize(c_List_Olist_ONil, tc_List_Olist(T_a2)), tc_nat)).
% 238.46/30.49    fof(cls_List_Olexord__Nil__right_0, axiom, ![T_a2, V_r2, V_x2]: ~c_in(c_Pair(V_x2, c_List_Olist_ONil, tc_List_Olist(T_a2), tc_List_Olist(T_a2)), c_List_Olexord(V_r2, T_a2), tc_prod(tc_List_Olist(T_a2), tc_List_Olist(T_a2)))).
% 238.46/30.49    fof(cls_List_Olist_Odistinct__1_0, axiom, ![V_list_H, T_a2, V_a_H2]: c_List_Olist_ONil!=c_List_Olist_OCons(V_a_H2, V_list_H, T_a2)).
% 238.46/30.49    fof(cls_List_Olist_Odistinct__2_0, axiom, ![T_a2, V_a_H2, V_list_H2]: c_List_Olist_OCons(V_a_H2, V_list_H2, T_a2)!=c_List_Olist_ONil).
% 238.46/30.49    fof(cls_List_Onot__Cons__self_0, axiom, ![T_a2, V_x2, V_xs2]: V_xs2!=c_List_Olist_OCons(V_x2, V_xs2, T_a2)).
% 238.46/30.49    fof(cls_List_Onull_Osimps__2_0, axiom, ![V_x2, V_xs2, T_a__1_2]: ~c_List_Onull(c_List_Olist_OCons(V_x2, V_xs2, T_a__1_2), T_a__1_2)).
% 238.46/30.49    fof(cls_List_Oop_Amem_Osimps__1_0, axiom, ![V_x2, T_a__1_2]: ~c_List_Oop_Amem(V_x2, c_List_Olist_ONil, T_a__1_2)).
% 238.46/30.49    fof(cls_List_Ox2_A_D_At1_A_61_At1_A_61_61_AFalse_0, axiom, ![V_t, T_a2, V_x2]: c_List_Olist_OCons(V_x2, V_t, T_a2)!=V_t).
% 238.46/30.49    fof(cls_Map_Omap__of__zip__is__None_0, axiom, ![T_a2, V_x2, T_b2, V_xs2, V_ys2]: (~c_in(V_x2, c_List_Oset(V_xs2, T_a2), T_a2) | (c_Map_Omap__of(c_List_Ozip(V_xs2, V_ys2, T_a2, T_b2), V_x2, T_a2, T_b2)!=c_Datatype_Ooption_ONone | c_Nat_Osize(V_xs2, tc_List_Olist(T_a2))!=c_Nat_Osize(V_ys2, tc_List_Olist(T_b2))))).
% 238.46/30.49    fof(cls_Message_Oagent_Odistinct__1_0, axiom, ![V_nat_H]: c_Message_Oagent_OServer!=c_Message_Oagent_OFriend(V_nat_H)).
% 238.46/30.49    fof(cls_Message_Oagent_Odistinct__2_0, axiom, ![V_nat_H2]: c_Message_Oagent_OFriend(V_nat_H2)!=c_Message_Oagent_OServer).
% 238.46/30.49    fof(cls_Message_Oagent_Odistinct__5_0, axiom, ![V_nat]: c_Message_Oagent_OFriend(V_nat)!=c_Message_Oagent_OSpy).
% 238.46/30.49    fof(cls_Message_Oagent_Odistinct__6_0, axiom, ![V_nat2]: c_Message_Oagent_OSpy!=c_Message_Oagent_OFriend(V_nat2)).
% 238.46/30.49    fof(cls_Message_Oparts__emptyE_0, axiom, ![V_X]: ~c_in(V_X, c_Message_Oparts(c_emptyset), tc_Message_Omsg)).
% 238.46/30.49    fof(cls_NatArith_Oof__nat__less__0__iff_0, axiom, ![T_a2, V_m2]: (~class_Ring__and__Field_Oordered__semidom(T_a2) | ~c_less(c_NatArith_Oof__nat(V_m2, T_a2), c_0, T_a2))).
% 238.46/30.49    fof(cls_Nat_OSuc__not__Zero_0, axiom, ![V_m2]: c_Suc(V_m2)!=c_0).
% 238.46/30.49    fof(cls_Nat_OZero__not__Suc_0, axiom, ![V_m2]: c_0!=c_Suc(V_m2)).
% 238.46/30.49    fof(cls_Nat_Oless__irrefl_0, axiom, ![V_n2]: ~c_less(V_n2, V_n2, tc_nat)).
% 238.46/30.49    fof(cls_Nat_Onot__add__less1_0, axiom, ![V_i, V_j]: ~c_less(c_plus(V_i, V_j, tc_nat), V_i, tc_nat)).
% 238.46/30.49    fof(cls_Nat_Onot__add__less2_0, axiom, ![V_i2, V_j2]: ~c_less(c_plus(V_j2, V_i2, tc_nat), V_i2, tc_nat)).
% 238.46/30.49    fof(cls_Nat_Onot__less0_0, axiom, ![V_n2]: ~c_less(V_n2, c_0, tc_nat)).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__10_0, axiom, ![T_a2]: (~class_Ring__and__Field_Ocomm__semiring__1__cancel(T_a2) | ~c_IntDef_Oiszero(c_1, T_a2))).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__13_0, axiom, ![T_a2, V_x2, V_y2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_IntDef_Oneg(c_Numeral_Onumber__of(c_Numeral_Obin__add(V_y2, c_Numeral_Obin__minus(V_x2)), T_a2), T_a2) | ~c_lessequals(c_Numeral_Onumber__of(V_x2, T_a2), c_Numeral_Onumber__of(V_y2, T_a2), T_a2))))).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__3_0, axiom, ![T_a2]: (~class_Numeral_Onumber__ring(T_a2) | ~c_IntDef_Oiszero(c_Numeral_Onumber__of(c_Numeral_OMin, T_a2), T_a2))).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__5_0, axiom, ![V_w, T_a2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | ~c_IntDef_Oiszero(c_Numeral_Onumber__of(c_Numeral_OBit(V_w, c_Numeral_Obit_OB1), T_a2), T_a2)))).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__7_0, axiom, ![T_a2]: (~class_Numeral_Onumber__ring(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | ~c_IntDef_Oneg(c_Numeral_Onumber__of(c_Numeral_OPls, T_a2), T_a2)))).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__8_0, axiom, ![T_a2]: (~class_Ring__and__Field_Oordered__idom(T_a2) | ~c_IntDef_Oneg(c_0, T_a2))).
% 238.46/30.49    fof(cls_Numeral_Obin__rel__simps__9_0, axiom, ![T_a2]: (~class_Ring__and__Field_Oordered__idom(T_a2) | ~c_IntDef_Oneg(c_1, T_a2))).
% 238.46/30.49    fof(cls_OrderedGroup_Oabs__not__less__zero_0, axiom, ![T_a2, V_a2]: (~class_OrderedGroup_Olordered__ab__group__abs(T_a2) | ~c_less(c_HOL_Oabs(V_a2, T_a2), c_0, T_a2))).
% 238.46/30.49    fof(cls_OrderedGroup_Ozero__less__abs__iff_0, axiom, ![T_a2]: (~class_OrderedGroup_Olordered__ab__group__abs(T_a2) | ~c_less(c_0, c_HOL_Oabs(c_0, T_a2), T_a2))).
% 238.46/30.49    fof(cls_Orderings_Oorder__less__irrefl_0, axiom, ![T_a2, V_x2]: (~class_Orderings_Oorder(T_a2) | ~c_less(V_x2, V_x2, T_a2))).
% 238.46/30.49    fof(cls_Parity_Oeven__nat__Suc_0, axiom, ![V_x2]: (~c_Parity_Oeven(V_x2, tc_nat) | ~c_Parity_Oeven(c_Suc(V_x2), tc_nat))).
% 238.46/30.49    fof(cls_Parity_Oneq__one__mod__two_1, axiom, ![V_x2]: (c_Divides_Oop_Amod(V_x2, c_Numeral_Onumber__of(c_Numeral_OBit(c_Numeral_OBit(c_Numeral_OPls, c_Numeral_Obit_OB1), c_Numeral_Obit_OB0), tc_IntDef_Oint), tc_IntDef_Oint)!=c_0 | c_Divides_Oop_Amod(V_x2, c_Numeral_Onumber__of(c_Numeral_OBit(c_Numeral_OBit(c_Numeral_OPls, c_Numeral_Obit_OB1), c_Numeral_Obit_OB0), tc_IntDef_Oint), tc_IntDef_Oint)!=c_1)).
% 238.46/30.49    fof(cls_Parity_Opower__le__zero__eq__number__of_0, axiom, ![T_a2, V_x2, V_w2]: (~class_Power_Orecpower(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_lessequals(c_Nat_Opower(V_x2, c_Numeral_Onumber__of(V_w2, tc_nat), T_a2), c_0, T_a2) | c_Numeral_Onumber__of(V_w2, tc_nat)!=c_0)))).
% 238.46/30.49    fof(cls_Parity_Opower__less__zero__eq__number__of_0, axiom, ![T_a2, V_x2, V_w2]: (~class_Power_Orecpower(T_a2) | (~class_Ring__and__Field_Oordered__idom(T_a2) | (~c_Parity_Oeven(c_Numeral_Onumber__of(V_w2, tc_nat), tc_nat) | ~c_less(c_Nat_Opower(V_x2, c_Numeral_Onumber__of(V_w2, tc_nat), T_a2), c_0, T_a2))))).
% 238.46/30.49    fof(cls_Ring__and__Field_Oaxclass__0__neq__1__class_Oaxioms_0, axiom, ![T_a2]: (~class_Ring__and__Field_Oaxclass__0__neq__1(T_a2) | c_0!=c_1)).
% 238.46/30.49    fof(cls_Ring__and__Field_Odivide__eq__eq__1_0, axiom, ![V_b, T_a2]: (~class_Ring__and__Field_Odivision__by__zero(T_a2) | (~class_Ring__and__Field_Oordered__field(T_a2) | c_divide(V_b, c_0, T_a2)!=c_1))).
% 238.46/30.49    fof(cls_Ring__and__Field_Oeq__divide__eq__1_0, axiom, ![T_a2, V_b2]: (~class_Ring__and__Field_Odivision__by__zero(T_a2) | (~class_Ring__and__Field_Oordered__field(T_a2) | c_1!=c_divide(V_b2, c_0, T_a2)))).
% 238.46/30.49    fof(cls_Ring__and__Field_Onot__one__le__zero_0, axiom, ![T_a2]: (~class_Ring__and__Field_Oordered__semidom(T_a2) | ~c_lessequals(c_1, c_0, T_a2))).
% 238.46/30.49    fof(cls_Ring__and__Field_Onot__one__less__zero_0, axiom, ![T_a2]: (~class_Ring__and__Field_Oordered__semidom(T_a2) | ~c_less(c_1, c_0, T_a2))).
% 238.46/30.49    fof(cls_Ring__and__Field_Oone__neq__zero_0, axiom, ![T_a2]: (~class_Ring__and__Field_Oaxclass__0__neq__1(T_a2) | c_1!=c_0)).
% 238.46/30.49    fof(cls_SetInterval_OatLeastLessThan__empty_0, axiom, ![T_a2, V_m2, V_n2]: (~class_Orderings_Oorder(T_a2) | (~c_lessequals(V_n2, V_m2, T_a2) | c_SetInterval_OatLeastLessThan(V_m2, V_n2, T_a2)=c_emptyset))).
% 238.46/30.49    fof(cls_SetInterval_OatLeastLessThan__singleton_0, axiom, ![V_m2]: c_SetInterval_OatLeastLessThan(V_m2, c_Suc(V_m2), tc_nat)=c_insert(V_m2, c_emptyset, tc_nat)).
% 238.46/30.49    fof(cls_Set_OCompl__iff_0, axiom, ![V_c, V_A, T_a2]: (~c_in(V_c, V_A, T_a2) | ~c_in(V_c, c_uminus(V_A, tc_set(T_a2)), T_a2))).
% 238.46/30.49    fof(cls_Set_ODiff__iff_1, axiom, ![V_B, T_a2, V_A2, V_c2]: (~c_in(V_c2, V_B, T_a2) | ~c_in(V_c2, c_minus(V_A2, V_B, tc_set(T_a2)), T_a2))).
% 238.46/30.49    fof(cls_Set_Odisjoint__insert__1_0, axiom, ![T_a2, V_a2, V_A2, V_B2]: (~c_in(V_a2, V_B2, T_a2) | c_inter(V_B2, c_insert(V_a2, V_A2, T_a2), T_a2)!=c_emptyset)).
% 238.46/30.49    fof(cls_Set_Odisjoint__insert__2_0, axiom, ![T_a2, V_b2, V_A2, V_B2]: (~c_in(V_b2, V_A2, T_a2) | c_emptyset!=c_inter(V_A2, c_insert(V_b2, V_B2, T_a2), T_a2))).
% 238.46/30.49    fof(cls_Set_Oempty__iff_0, axiom, ![T_a2, V_c2]: ~c_in(V_c2, c_emptyset, T_a2)).
% 238.46/30.49    fof(cls_Set_Oempty__not__insert_0, axiom, ![T_a2, V_a2, V_A2]: c_emptyset!=c_insert(V_a2, V_A2, T_a2)).
% 238.46/30.49    fof(cls_Set_Oinsert__disjoint__1_0, axiom, ![T_a2, V_a2, V_A2, V_B2]: (~c_in(V_a2, V_B2, T_a2) | c_inter(c_insert(V_a2, V_A2, T_a2), V_B2, T_a2)!=c_emptyset)).
% 238.46/30.49    fof(cls_Set_Oinsert__disjoint__2_0, axiom, ![T_a2, V_a2, V_A2, V_B2]: (~c_in(V_a2, V_B2, T_a2) | c_emptyset!=c_inter(c_insert(V_a2, V_A2, T_a2), V_B2, T_a2))).
% 238.46/30.49    fof(cls_Set_Oinsert__not__empty_0, axiom, ![T_a2, V_a2, V_A2]: c_insert(V_a2, V_A2, T_a2)!=c_emptyset).
% 238.46/30.49    fof(cls_Set_Onot__psubset__empty_0, axiom, ![T_a2, V_A2]: ~c_less(V_A2, c_emptyset, tc_set(T_a2))).
% 238.46/30.49    fof(cls_Set_OpsubsetE_0, axiom, ![T_a2, V_A2, V_B2]: (~c_less(V_A2, V_B2, tc_set(T_a2)) | ~c_lessequals(V_B2, V_A2, tc_set(T_a2)))).
% 238.46/30.49    fof(cls_Sum__Type_OInl__not__Inr_0, axiom, ![T_a2, V_a2, T_b2, V_b2]: c_Sum__Type_OInl(V_a2, T_a2, T_b2)!=c_Sum__Type_OInr(V_b2, T_b2, T_a2)).
% 238.46/30.49    fof(cls_Sum__Type_OInr__not__Inl_0, axiom, ![T_a2, V_a2, T_b2, V_b2]: c_Sum__Type_OInr(V_b2, T_b2, T_a2)!=c_Sum__Type_OInl(V_a2, T_a2, T_b2)).
% 238.46/30.49    fof(cls_Wellfounded__Recursion_Oacyclic__insert_1, axiom, ![T_a2, V_r2, V_x2, V_y2]: (~c_Wellfounded__Recursion_Oacyclic(c_insert(c_Pair(V_y2, V_x2, T_a2, T_a2), V_r2, tc_prod(T_a2, T_a2)), T_a2) | ~c_in(c_Pair(V_x2, V_y2, T_a2, T_a2), c_Transitive__Closure_Ortrancl(V_r2, T_a2), tc_prod(T_a2, T_a2)))).
% 238.46/30.49    fof(cls_Wellfounded__Recursion_Owf__insert_1, axiom, ![T_a2, V_r2, V_x2, V_y2]: (~c_Wellfounded__Recursion_Owf(c_insert(c_Pair(V_y2, V_x2, T_a2, T_a2), V_r2, tc_prod(T_a2, T_a2)), T_a2) | ~c_in(c_Pair(V_x2, V_y2, T_a2, T_a2), c_Transitive__Closure_Ortrancl(V_r2, T_a2), tc_prod(T_a2, T_a2)))).
% 238.46/30.49    fof(cls_Wellfounded__Recursion_Owf__not__refl_0, axiom, ![T_a2, V_r2, V_a2]: (~c_Wellfounded__Recursion_Owf(V_r2, T_a2) | ~c_in(c_Pair(V_a2, V_a2, T_a2, T_a2), V_r2, tc_prod(T_a2, T_a2)))).
% 238.46/30.49    fof(cls_conjecture_0, negated_conjecture, ![V_U]: c_lessequals(V_U, v_x(V_U), tc_nat)).
% 238.46/30.49    fof(cls_conjecture_1, negated_conjecture, ![V_U2]: v_x(V_U2)=v_nat).
% 238.46/30.49    fof(clsarity_nat_3, axiom, class_Orderings_Oorder(tc_nat)).
% 238.46/30.49  
% 238.46/30.49  Now clausify the problem and encode Horn clauses using encoding 3 of
% 238.46/30.49  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 238.46/30.49  We repeatedly replace C & s=t => u=v by the two clauses:
% 238.46/30.49    fresh(y, y, x1...xn) = u
% 238.46/30.49    C => fresh(s, t, x1...xn) = v
% 238.46/30.49  where fresh is a fresh function symbol and x1..xn are the free
% 238.46/30.49  variables of u and v.
% 238.46/30.49  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 238.46/30.49  input problem has no model of domain size 1).
% 238.46/30.49  
% 238.46/30.49  The encoding turns the above axioms into the following unit equations and goals:
% 238.46/30.49  
% 238.46/30.49  Axiom 1 (clsarity_nat_3): class_Orderings_Oorder(tc_nat) = true2.
% 238.46/30.49  Axiom 2 (cls_conjecture_1): v_x(X) = v_nat.
% 238.46/30.49  Axiom 3 (cls_conjecture_0): c_lessequals(X, v_x(X), tc_nat) = true2.
% 238.46/30.49  Axiom 4 (cls_SetInterval_OatLeastLessThan__singleton_0): c_SetInterval_OatLeastLessThan(X, c_Suc(X), tc_nat) = c_insert(X, c_emptyset, tc_nat).
% 238.46/30.49  Axiom 5 (cls_SetInterval_OatLeastLessThan__empty_0): fresh1209(X, X, Y, Z, W) = c_emptyset.
% 238.46/30.49  Axiom 6 (cls_SetInterval_OatLeastLessThan__empty_0): fresh1208(X, X, Y, Z, W) = c_SetInterval_OatLeastLessThan(W, Z, Y).
% 238.46/30.49  Axiom 7 (cls_SetInterval_OatLeastLessThan__empty_0): fresh1208(class_Orderings_Oorder(X), true2, X, Y, Z) = fresh1209(c_lessequals(Y, Z, X), true2, X, Y, Z).
% 238.46/30.49  
% 238.46/30.49  Goal 1 (cls_Set_Oempty__not__insert_0): c_emptyset = c_insert(X, Y, Z).
% 238.46/30.49  The goal is true when:
% 238.46/30.49    X = v_nat
% 238.46/30.49    Y = c_emptyset
% 238.46/30.49    Z = tc_nat
% 238.46/30.49  
% 238.46/30.49  Proof:
% 238.46/30.49    c_emptyset
% 238.46/30.49  = { by axiom 5 (cls_SetInterval_OatLeastLessThan__empty_0) R->L }
% 238.46/30.49    fresh1209(true2, true2, tc_nat, c_Suc(v_nat), v_nat)
% 238.46/30.49  = { by axiom 3 (cls_conjecture_0) R->L }
% 238.46/30.49    fresh1209(c_lessequals(c_Suc(v_nat), v_x(c_Suc(v_nat)), tc_nat), true2, tc_nat, c_Suc(v_nat), v_nat)
% 238.46/30.49  = { by axiom 2 (cls_conjecture_1) }
% 238.46/30.49    fresh1209(c_lessequals(c_Suc(v_nat), v_nat, tc_nat), true2, tc_nat, c_Suc(v_nat), v_nat)
% 238.46/30.49  = { by axiom 7 (cls_SetInterval_OatLeastLessThan__empty_0) R->L }
% 238.46/30.49    fresh1208(class_Orderings_Oorder(tc_nat), true2, tc_nat, c_Suc(v_nat), v_nat)
% 238.46/30.49  = { by axiom 1 (clsarity_nat_3) }
% 238.46/30.49    fresh1208(true2, true2, tc_nat, c_Suc(v_nat), v_nat)
% 238.46/30.49  = { by axiom 6 (cls_SetInterval_OatLeastLessThan__empty_0) }
% 238.46/30.49    c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat)
% 238.46/30.49  = { by axiom 4 (cls_SetInterval_OatLeastLessThan__singleton_0) }
% 238.46/30.49    c_insert(v_nat, c_emptyset, tc_nat)
% 238.46/30.49  % SZS output end Proof
% 238.46/30.49  
% 238.46/30.49  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------