TSTP Solution File: SWV913-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV913-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 : n008.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:44 EDT 2023
% Result : Unsatisfiable 13.09s 2.23s
% Output : Proof 13.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV913-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 : n008.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 05:36:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 13.09/2.23 Command-line arguments: --ground-connectedness --complete-subsets
% 13.09/2.23
% 13.09/2.23 % SZS status Unsatisfiable
% 13.09/2.23
% 13.09/2.23 % SZS output start Proof
% 13.09/2.23 Take the following subset of the input axioms:
% 13.09/2.23 fof(cls_asm_0, axiom, ![T_a, V_G, V_ts]: (c_Hoare__Mirabelle_Ohoare__derivs(V_G, V_ts, T_a) | ~c_lessequals(V_ts, V_G, tc_fun(tc_Hoare__Mirabelle_Otriple(T_a), tc_bool)))).
% 13.09/2.23 fof(cls_conjecture_0, negated_conjecture, ~c_Hoare__Mirabelle_Ohoare__derivs(hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), t_a)).
% 13.09/2.23 fof(cls_equalityE_0, axiom, ![V_x, T_a2]: c_lessequals(V_x, V_x, tc_fun(T_a2, tc_bool))).
% 13.09/2.23
% 13.09/2.23 Now clausify the problem and encode Horn clauses using encoding 3 of
% 13.09/2.23 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 13.09/2.23 We repeatedly replace C & s=t => u=v by the two clauses:
% 13.09/2.23 fresh(y, y, x1...xn) = u
% 13.09/2.23 C => fresh(s, t, x1...xn) = v
% 13.09/2.23 where fresh is a fresh function symbol and x1..xn are the free
% 13.09/2.23 variables of u and v.
% 13.09/2.23 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 13.09/2.23 input problem has no model of domain size 1).
% 13.09/2.23
% 13.09/2.23 The encoding turns the above axioms into the following unit equations and goals:
% 13.09/2.23
% 13.09/2.23 Axiom 1 (cls_asm_0): fresh308(X, X, Y, Z, W) = true2.
% 13.09/2.23 Axiom 2 (cls_equalityE_0): c_lessequals(X, X, tc_fun(Y, tc_bool)) = true2.
% 13.09/2.23 Axiom 3 (cls_asm_0): fresh308(c_lessequals(X, Y, tc_fun(tc_Hoare__Mirabelle_Otriple(Z), tc_bool)), true2, Y, X, Z) = c_Hoare__Mirabelle_Ohoare__derivs(Y, X, Z).
% 13.09/2.23
% 13.09/2.23 Goal 1 (cls_conjecture_0): c_Hoare__Mirabelle_Ohoare__derivs(hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), t_a) = true2.
% 13.09/2.23 Proof:
% 13.09/2.23 c_Hoare__Mirabelle_Ohoare__derivs(hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), t_a)
% 13.09/2.23 = { by axiom 3 (cls_asm_0) R->L }
% 13.09/2.23 fresh308(c_lessequals(hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool)), true2, hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), t_a)
% 13.09/2.23 = { by axiom 2 (cls_equalityE_0) }
% 13.09/2.23 fresh308(true2, true2, hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)), v_t), c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a), tc_bool))), t_a)
% 13.09/2.23 = { by axiom 1 (cls_asm_0) }
% 13.09/2.23 true2
% 13.09/2.23 % SZS output end Proof
% 13.09/2.23
% 13.09/2.23 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------