TSTP Solution File: SWV264-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV264-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 : n001.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:18 EDT 2023
% Result : Unsatisfiable 42.62s 5.84s
% Output : Proof 42.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV264-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.16/0.34 % Computer : n001.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Aug 29 08:35:06 EDT 2023
% 0.16/0.35 % CPUTime :
% 42.62/5.84 Command-line arguments: --no-flatten-goal
% 42.62/5.84
% 42.62/5.84 % SZS status Unsatisfiable
% 42.62/5.84
% 42.62/5.84 % SZS output start Proof
% 42.62/5.84 Take the following subset of the input axioms:
% 42.62/5.84 fof(cls_Message_Oparts_OFst_0, axiom, ![V_X, V_H, V_Y]: (~c_in(c_Message_Omsg_OMPair(V_X, V_Y), c_Message_Oparts(V_H), tc_Message_Omsg) | c_in(V_X, c_Message_Oparts(V_H), tc_Message_Omsg))).
% 42.62/5.84 fof(cls_conjecture_2, negated_conjecture, c_in(c_Message_Omsg_OMPair(v_X, v_Y), c_Message_Oparts(v_H), tc_Message_Omsg)).
% 42.62/5.84 fof(cls_conjecture_3, negated_conjecture, ~c_in(v_X, c_Message_Oparts(v_H), tc_Message_Omsg)).
% 42.62/5.84
% 42.62/5.84 Now clausify the problem and encode Horn clauses using encoding 3 of
% 42.62/5.84 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 42.62/5.84 We repeatedly replace C & s=t => u=v by the two clauses:
% 42.62/5.84 fresh(y, y, x1...xn) = u
% 42.62/5.84 C => fresh(s, t, x1...xn) = v
% 42.62/5.84 where fresh is a fresh function symbol and x1..xn are the free
% 42.62/5.84 variables of u and v.
% 42.62/5.84 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 42.62/5.84 input problem has no model of domain size 1).
% 42.62/5.84
% 42.62/5.84 The encoding turns the above axioms into the following unit equations and goals:
% 42.62/5.84
% 42.62/5.84 Axiom 1 (cls_Message_Oparts_OFst_0): fresh1088(X, X, Y, Z) = true2.
% 42.62/5.84 Axiom 2 (cls_conjecture_2): c_in(c_Message_Omsg_OMPair(v_X, v_Y), c_Message_Oparts(v_H), tc_Message_Omsg) = true2.
% 42.62/5.84 Axiom 3 (cls_Message_Oparts_OFst_0): fresh1088(c_in(c_Message_Omsg_OMPair(X, Y), c_Message_Oparts(Z), tc_Message_Omsg), true2, X, Z) = c_in(X, c_Message_Oparts(Z), tc_Message_Omsg).
% 42.62/5.84
% 42.62/5.84 Goal 1 (cls_conjecture_3): c_in(v_X, c_Message_Oparts(v_H), tc_Message_Omsg) = true2.
% 42.62/5.84 Proof:
% 42.62/5.84 c_in(v_X, c_Message_Oparts(v_H), tc_Message_Omsg)
% 42.62/5.84 = { by axiom 3 (cls_Message_Oparts_OFst_0) R->L }
% 42.62/5.84 fresh1088(c_in(c_Message_Omsg_OMPair(v_X, v_Y), c_Message_Oparts(v_H), tc_Message_Omsg), true2, v_X, v_H)
% 42.62/5.84 = { by axiom 2 (cls_conjecture_2) }
% 42.62/5.84 fresh1088(true2, true2, v_X, v_H)
% 42.62/5.84 = { by axiom 1 (cls_Message_Oparts_OFst_0) }
% 42.62/5.84 true2
% 42.62/5.84 % SZS output end Proof
% 42.62/5.84
% 42.62/5.84 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------