TSTP Solution File: SWV263-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV263-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 : n016.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:17 EDT 2023
% Result : Unsatisfiable 48.04s 6.46s
% Output : Proof 48.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV263-1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/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 : n016.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 03:43:45 EDT 2023
% 0.13/0.34 % CPUTime :
% 48.04/6.46 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 48.04/6.46
% 48.04/6.46 % SZS status Unsatisfiable
% 48.04/6.46
% 48.04/6.46 % SZS output start Proof
% 48.04/6.46 Take the following subset of the input axioms:
% 48.04/6.46 fof(cls_Message_Oparts_OInj_0, axiom, ![V_X, V_H]: (~c_in(V_X, V_H, tc_Message_Omsg) | c_in(V_X, c_Message_Oparts(V_H), tc_Message_Omsg))).
% 48.04/6.46 fof(cls_Set_OsubsetD_0, axiom, ![T_a, V_c, V_A, V_B]: (~c_in(V_c, V_A, T_a) | (~c_lessequals(V_A, V_B, tc_set(T_a)) | c_in(V_c, V_B, T_a)))).
% 48.04/6.46 fof(cls_conjecture_0, negated_conjecture, c_lessequals(v_G, v_H, tc_set(tc_Message_Omsg))).
% 48.04/6.46 fof(cls_conjecture_1, negated_conjecture, c_in(v_X, v_G, tc_Message_Omsg)).
% 48.04/6.46 fof(cls_conjecture_2, negated_conjecture, ~c_in(v_X, c_Message_Oparts(v_H), tc_Message_Omsg)).
% 48.04/6.46
% 48.04/6.46 Now clausify the problem and encode Horn clauses using encoding 3 of
% 48.04/6.46 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 48.04/6.46 We repeatedly replace C & s=t => u=v by the two clauses:
% 48.04/6.46 fresh(y, y, x1...xn) = u
% 48.04/6.46 C => fresh(s, t, x1...xn) = v
% 48.04/6.46 where fresh is a fresh function symbol and x1..xn are the free
% 48.04/6.46 variables of u and v.
% 48.04/6.46 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 48.04/6.46 input problem has no model of domain size 1).
% 48.04/6.46
% 48.04/6.46 The encoding turns the above axioms into the following unit equations and goals:
% 48.04/6.46
% 48.04/6.46 Axiom 1 (cls_conjecture_1): c_in(v_X, v_G, tc_Message_Omsg) = true2.
% 48.04/6.46 Axiom 2 (cls_conjecture_0): c_lessequals(v_G, v_H, tc_set(tc_Message_Omsg)) = true2.
% 48.04/6.46 Axiom 3 (cls_Message_Oparts_OInj_0): fresh1087(X, X, Y, Z) = true2.
% 48.04/6.46 Axiom 4 (cls_Set_OsubsetD_0): fresh995(X, X, Y, Z, W) = true2.
% 48.04/6.46 Axiom 5 (cls_Message_Oparts_OInj_0): fresh1087(c_in(X, Y, tc_Message_Omsg), true2, X, Y) = c_in(X, c_Message_Oparts(Y), tc_Message_Omsg).
% 48.04/6.46 Axiom 6 (cls_Set_OsubsetD_0): fresh996(X, X, Y, Z, W, V) = c_in(Y, V, W).
% 48.04/6.46 Axiom 7 (cls_Set_OsubsetD_0): fresh996(c_lessequals(X, Y, tc_set(Z)), true2, W, X, Z, Y) = fresh995(c_in(W, X, Z), true2, W, Z, Y).
% 48.04/6.46
% 48.04/6.46 Goal 1 (cls_conjecture_2): c_in(v_X, c_Message_Oparts(v_H), tc_Message_Omsg) = true2.
% 48.04/6.46 Proof:
% 48.04/6.46 c_in(v_X, c_Message_Oparts(v_H), tc_Message_Omsg)
% 48.04/6.46 = { by axiom 5 (cls_Message_Oparts_OInj_0) R->L }
% 48.04/6.46 fresh1087(c_in(v_X, v_H, tc_Message_Omsg), true2, v_X, v_H)
% 48.04/6.46 = { by axiom 6 (cls_Set_OsubsetD_0) R->L }
% 48.04/6.46 fresh1087(fresh996(true2, true2, v_X, v_G, tc_Message_Omsg, v_H), true2, v_X, v_H)
% 48.04/6.46 = { by axiom 2 (cls_conjecture_0) R->L }
% 48.04/6.46 fresh1087(fresh996(c_lessequals(v_G, v_H, tc_set(tc_Message_Omsg)), true2, v_X, v_G, tc_Message_Omsg, v_H), true2, v_X, v_H)
% 48.04/6.46 = { by axiom 7 (cls_Set_OsubsetD_0) }
% 48.04/6.46 fresh1087(fresh995(c_in(v_X, v_G, tc_Message_Omsg), true2, v_X, tc_Message_Omsg, v_H), true2, v_X, v_H)
% 48.04/6.46 = { by axiom 1 (cls_conjecture_1) }
% 48.04/6.46 fresh1087(fresh995(true2, true2, v_X, tc_Message_Omsg, v_H), true2, v_X, v_H)
% 48.04/6.46 = { by axiom 4 (cls_Set_OsubsetD_0) }
% 48.04/6.46 fresh1087(true2, true2, v_X, v_H)
% 48.04/6.46 = { by axiom 3 (cls_Message_Oparts_OInj_0) }
% 48.04/6.46 true2
% 48.04/6.46 % SZS output end Proof
% 48.04/6.46
% 48.04/6.46 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------