TSTP Solution File: SWV898-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV898-1 : TPTP v8.1.2. Released v4.1.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 : n025.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:06:41 EDT 2023
% Result : Unsatisfiable 20.91s 3.21s
% Output : Proof 20.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV898-1 : TPTP v8.1.2. Released v4.1.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 : n025.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 : Tue Aug 29 06:28:55 EDT 2023
% 0.13/0.34 % CPUTime :
% 20.91/3.21 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 20.91/3.21
% 20.91/3.21 % SZS status Unsatisfiable
% 20.91/3.21
% 20.91/3.21 % SZS output start Proof
% 20.91/3.21 Take the following subset of the input axioms:
% 20.91/3.21 fof(cls_conjecture_3, negated_conjecture, ~c_Finite__Set_Ofinite(c_Set_Oimage(c_COMBB(c_Hoare__Mirabelle_OMGT, c_COMBB(c_Option_Othe(tc_Com_Ocom), c_Com_Obody, tc_Option_Ooption(tc_Com_Ocom), tc_Com_Ocom, tc_Com_Opname), tc_Com_Ocom, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate), tc_Com_Opname), c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)), tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate))).
% 20.91/3.21 fof(cls_finite__dom__body_0, axiom, c_Finite__Set_Ofinite(c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname)).
% 20.91/3.21 fof(cls_finite__imageI_0, axiom, ![T_a, T_b, V_h, V_F]: (c_Finite__Set_Ofinite(c_Set_Oimage(V_h, V_F, T_a, T_b), T_b) | ~c_Finite__Set_Ofinite(V_F, T_a))).
% 20.91/3.21
% 20.91/3.21 Now clausify the problem and encode Horn clauses using encoding 3 of
% 20.91/3.21 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 20.91/3.21 We repeatedly replace C & s=t => u=v by the two clauses:
% 20.91/3.21 fresh(y, y, x1...xn) = u
% 20.91/3.21 C => fresh(s, t, x1...xn) = v
% 20.91/3.21 where fresh is a fresh function symbol and x1..xn are the free
% 20.91/3.21 variables of u and v.
% 20.91/3.21 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 20.91/3.21 input problem has no model of domain size 1).
% 20.91/3.21
% 20.91/3.21 The encoding turns the above axioms into the following unit equations and goals:
% 20.91/3.21
% 20.91/3.21 Axiom 1 (cls_finite__dom__body_0): c_Finite__Set_Ofinite(c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname) = true2.
% 20.91/3.21 Axiom 2 (cls_finite__imageI_0): fresh378(X, X, Y, Z, W, V) = true2.
% 20.91/3.21 Axiom 3 (cls_finite__imageI_0): fresh378(c_Finite__Set_Ofinite(X, Y), true2, Z, X, Y, W) = c_Finite__Set_Ofinite(c_Set_Oimage(Z, X, Y, W), W).
% 20.91/3.21
% 20.91/3.21 Goal 1 (cls_conjecture_3): c_Finite__Set_Ofinite(c_Set_Oimage(c_COMBB(c_Hoare__Mirabelle_OMGT, c_COMBB(c_Option_Othe(tc_Com_Ocom), c_Com_Obody, tc_Option_Ooption(tc_Com_Ocom), tc_Com_Ocom, tc_Com_Opname), tc_Com_Ocom, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate), tc_Com_Opname), c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)), tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)) = true2.
% 20.91/3.21 Proof:
% 20.91/3.21 c_Finite__Set_Ofinite(c_Set_Oimage(c_COMBB(c_Hoare__Mirabelle_OMGT, c_COMBB(c_Option_Othe(tc_Com_Ocom), c_Com_Obody, tc_Option_Ooption(tc_Com_Ocom), tc_Com_Ocom, tc_Com_Opname), tc_Com_Ocom, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate), tc_Com_Opname), c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)), tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate))
% 20.91/3.21 = { by axiom 3 (cls_finite__imageI_0) R->L }
% 20.91/3.21 fresh378(c_Finite__Set_Ofinite(c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname), true2, c_COMBB(c_Hoare__Mirabelle_OMGT, c_COMBB(c_Option_Othe(tc_Com_Ocom), c_Com_Obody, tc_Option_Ooption(tc_Com_Ocom), tc_Com_Ocom, tc_Com_Opname), tc_Com_Ocom, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate), tc_Com_Opname), c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate))
% 20.91/3.21 = { by axiom 1 (cls_finite__dom__body_0) }
% 20.91/3.21 fresh378(true2, true2, c_COMBB(c_Hoare__Mirabelle_OMGT, c_COMBB(c_Option_Othe(tc_Com_Ocom), c_Com_Obody, tc_Option_Ooption(tc_Com_Ocom), tc_Com_Ocom, tc_Com_Opname), tc_Com_Ocom, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate), tc_Com_Opname), c_Map_Odom(c_Com_Obody, tc_Com_Opname, tc_Com_Ocom), tc_Com_Opname, tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate))
% 20.91/3.21 = { by axiom 2 (cls_finite__imageI_0) }
% 20.91/3.21 true2
% 20.91/3.21 % SZS output end Proof
% 20.91/3.21
% 20.91/3.21 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------