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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SET818-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 : n005.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 15:33:19 EDT 2023

% Result   : Unsatisfiable 43.13s 5.87s
% Output   : Proof 43.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET818-1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sat Aug 26 11:56:53 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 43.13/5.87  Command-line arguments: --no-flatten-goal
% 43.13/5.87  
% 43.13/5.87  % SZS status Unsatisfiable
% 43.13/5.87  
% 43.13/5.87  % SZS output start Proof
% 43.13/5.87  Take the following subset of the input axioms:
% 43.13/5.88    fof(cls_Datatype_Ooption_Odistinct__1__iff1_0, axiom, ![T_a, V_a_H]: c_Datatype_Ooption_ONone!=c_Datatype_Ooption_OSome(V_a_H, T_a)).
% 43.13/5.88    fof(cls_Datatype_Ooption_Odistinct__2__iff1_0, axiom, ![T_a2, V_a_H2]: c_Datatype_Ooption_OSome(V_a_H2, T_a2)!=c_Datatype_Ooption_ONone).
% 43.13/5.88    fof(cls_Datatype__Universe_OAtom__not__Scons__iff1_0, axiom, ![V_a, T_b, V_M, V_N, T_a2]: c_Datatype__Universe_OAtom(V_a, T_a2, T_b)!=c_Datatype__Universe_OScons(V_M, V_N, T_a2, T_b)).
% 43.13/5.88    fof(cls_Datatype__Universe_OIn0__not__In1__iff1_0, axiom, ![T_a2, T_b2, V_M2, V_N2]: c_Datatype__Universe_OIn0(V_M2, T_a2, T_b2)!=c_Datatype__Universe_OIn1(V_N2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_Datatype__Universe_OIn1__not__In0__iff1_0, axiom, ![T_a2, T_b2, V_M2, V_N2]: c_Datatype__Universe_OIn1(V_N2, T_a2, T_b2)!=c_Datatype__Universe_OIn0(V_M2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_Datatype__Universe_OLeaf__not__Numb__iff1_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)).
% 43.13/5.88    fof(cls_Datatype__Universe_OLeaf__not__Scons__iff1_0, axiom, ![T_a2, V_a2, T_b2, V_M2, V_N2]: c_Datatype__Universe_OLeaf(V_a2, T_a2, T_b2)!=c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_Datatype__Universe_ONumb__not__Leaf__iff1_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)).
% 43.13/5.88    fof(cls_Datatype__Universe_ONumb__not__Scons__iff1_0, axiom, ![T_a2, T_b2, V_M2, V_N2, V_k2]: c_Datatype__Universe_ONumb(V_k2, T_a2, T_b2)!=c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_Datatype__Universe_OScons__not__Atom__iff1_0, axiom, ![T_a2, V_a2, T_b2, V_M2, V_N2]: c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)!=c_Datatype__Universe_OAtom(V_a2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_Datatype__Universe_OScons__not__Leaf__iff1_0, axiom, ![T_a2, V_a2, T_b2, V_M2, V_N2]: c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)!=c_Datatype__Universe_OLeaf(V_a2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_Datatype__Universe_OScons__not__Numb__iff1_0, axiom, ![T_a2, T_b2, V_M2, V_N2, V_k2]: c_Datatype__Universe_OScons(V_M2, V_N2, T_a2, T_b2)!=c_Datatype__Universe_ONumb(V_k2, T_a2, T_b2)).
% 43.13/5.88    fof(cls_List_ONil2__notin__lex__iff1_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)))).
% 43.13/5.88    fof(cls_List_ONil__notin__lex__iff1_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)))).
% 43.13/5.88    fof(cls_List_Olength__greater__0__conv__iff1_0, axiom, ![T_a2]: ~c_less(c_0, c_Nat_Osize(c_List_Olist_ONil, tc_List_Olist(T_a2)), tc_nat)).
% 43.13/5.88    fof(cls_List_Olist_Odistinct__1__iff1_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)).
% 43.13/5.88    fof(cls_List_Olist_Odistinct__2__iff1_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).
% 43.13/5.88    fof(cls_Nat_OSuc__not__Zero__iff1_0, axiom, ![V_m]: c_Suc(V_m)!=c_0).
% 43.13/5.88    fof(cls_Nat_OZero__not__Suc__iff1_0, axiom, ![V_m2]: c_0!=c_Suc(V_m2)).
% 43.13/5.88    fof(cls_Nat_Oless__irrefl_0, axiom, ![V_n]: ~c_less(V_n, V_n, tc_nat)).
% 43.13/5.88    fof(cls_Nat_Onot__add__less1__iff1_0, axiom, ![V_i, V_j]: ~c_less(c_plus(V_i, V_j, tc_nat), V_i, tc_nat)).
% 43.13/5.88    fof(cls_Nat_Onot__add__less2__iff1_0, axiom, ![V_i2, V_j2]: ~c_less(c_plus(V_j2, V_i2, tc_nat), V_i2, tc_nat)).
% 43.13/5.88    fof(cls_Nat_Onot__less0__iff1_0, axiom, ![V_n2]: ~c_less(V_n2, c_0, tc_nat)).
% 43.13/5.88    fof(cls_Orderings_Oorder__less__irrefl__iff1_0, axiom, ![V_x, T_a2]: (~class_Orderings_Oorder(T_a2) | ~c_less(V_x, V_x, T_a2))).
% 43.13/5.88    fof(cls_Set_OComplD__dest_0, axiom, ![V_A, V_c, T_a2]: (~c_in(V_c, V_A, T_a2) | ~c_in(V_c, c_uminus(V_A, tc_set(T_a2)), T_a2))).
% 43.13/5.88    fof(cls_Set_ODiffE_0, 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))).
% 43.13/5.88    fof(cls_Set_OemptyE_0, axiom, ![T_a2, V_a2]: ~c_in(V_a2, c_emptyset, T_a2)).
% 43.13/5.88    fof(cls_Set_Onot__psubset__empty__iff1_0, axiom, ![T_a2, V_A2]: ~c_less(V_A2, c_emptyset, tc_set(T_a2))).
% 43.13/5.88    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)))).
% 43.13/5.88    fof(cls_Sum__Type_OInl__not__Inr__iff1_0, axiom, ![V_b, T_a2, V_a2, T_b2]: c_Sum__Type_OInl(V_a2, T_a2, T_b2)!=c_Sum__Type_OInr(V_b, T_b2, T_a2)).
% 43.13/5.88    fof(cls_Sum__Type_OInr__not__Inl__iff1_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)).
% 43.13/5.88    fof(cls_Wellfounded__Recursion_Oacyclic__insert__iff1_1, axiom, ![V_y, V_x2, T_a2, V_r2]: (~c_Wellfounded__Recursion_Oacyclic(c_insert(c_Pair(V_y, V_x2, T_a2, T_a2), V_r2, tc_prod(T_a2, T_a2)), T_a2) | ~c_in(c_Pair(V_x2, V_y, T_a2, T_a2), c_Transitive__Closure_Ortrancl(V_r2, T_a2), tc_prod(T_a2, T_a2)))).
% 43.13/5.88    fof(cls_Wellfounded__Recursion_Owf__insert__iff1_1, axiom, ![V_x2, T_a2, V_r2, 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)))).
% 43.13/5.88    fof(cls_conjecture_0, negated_conjecture, ![V_U]: c_in(v_x(V_U), V_U, tc_IntDef_Oint)).
% 43.13/5.88    fof(cls_conjecture_1, negated_conjecture, ![V_U2]: ~c_lessequals(v_x(V_U2), c_0, tc_IntDef_Oint)).
% 43.13/5.88  
% 43.13/5.88  Now clausify the problem and encode Horn clauses using encoding 3 of
% 43.13/5.88  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 43.13/5.88  We repeatedly replace C & s=t => u=v by the two clauses:
% 43.13/5.88    fresh(y, y, x1...xn) = u
% 43.13/5.88    C => fresh(s, t, x1...xn) = v
% 43.13/5.88  where fresh is a fresh function symbol and x1..xn are the free
% 43.13/5.88  variables of u and v.
% 43.13/5.88  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 43.13/5.88  input problem has no model of domain size 1).
% 43.13/5.88  
% 43.13/5.88  The encoding turns the above axioms into the following unit equations and goals:
% 43.13/5.88  
% 43.13/5.88  Axiom 1 (cls_conjecture_0): c_in(v_x(X), X, tc_IntDef_Oint) = true2.
% 43.13/5.88  
% 43.13/5.88  Goal 1 (cls_Set_OemptyE_0): c_in(X, c_emptyset, Y) = true2.
% 43.13/5.88  The goal is true when:
% 43.13/5.88    X = v_x(c_emptyset)
% 43.13/5.88    Y = tc_IntDef_Oint
% 43.13/5.88  
% 43.13/5.88  Proof:
% 43.13/5.88    c_in(v_x(c_emptyset), c_emptyset, tc_IntDef_Oint)
% 43.13/5.88  = { by axiom 1 (cls_conjecture_0) }
% 43.13/5.88    true2
% 43.13/5.88  % SZS output end Proof
% 43.13/5.88  
% 43.13/5.88  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------