TSTP Solution File: SWV268-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV268-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:20 EDT 2023
% Result : Unsatisfiable 233.04s 29.95s
% Output : Proof 233.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV268-1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 04:12:00 EDT 2023
% 0.14/0.36 % CPUTime :
% 233.04/29.95 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 233.04/29.95
% 233.04/29.95 % SZS status Unsatisfiable
% 233.04/29.95
% 233.04/29.95 % SZS output start Proof
% 233.04/29.95 Take the following subset of the input axioms:
% 233.48/29.96 fof(cls_Message_Oparts__idem_0, axiom, ![V_H]: c_Message_Oparts(c_Message_Oparts(V_H))=c_Message_Oparts(V_H)).
% 233.48/29.96 fof(cls_Message_Oparts__mono_0, axiom, ![V_G, V_H2]: (~c_lessequals(V_G, V_H2, tc_set(tc_Message_Omsg)) | c_lessequals(c_Message_Oparts(V_G), c_Message_Oparts(V_H2), tc_set(tc_Message_Omsg)))).
% 233.48/29.96 fof(cls_conjecture_0, negated_conjecture, c_lessequals(v_G, c_Message_Oparts(v_H), tc_set(tc_Message_Omsg))).
% 233.48/29.96 fof(cls_conjecture_1, negated_conjecture, ~c_lessequals(c_Message_Oparts(v_G), c_Message_Oparts(v_H), tc_set(tc_Message_Omsg))).
% 233.48/29.96
% 233.48/29.96 Now clausify the problem and encode Horn clauses using encoding 3 of
% 233.48/29.96 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 233.48/29.96 We repeatedly replace C & s=t => u=v by the two clauses:
% 233.48/29.96 fresh(y, y, x1...xn) = u
% 233.48/29.96 C => fresh(s, t, x1...xn) = v
% 233.48/29.96 where fresh is a fresh function symbol and x1..xn are the free
% 233.48/29.96 variables of u and v.
% 233.48/29.96 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 233.48/29.96 input problem has no model of domain size 1).
% 233.48/29.96
% 233.48/29.96 The encoding turns the above axioms into the following unit equations and goals:
% 233.48/29.96
% 233.48/29.96 Axiom 1 (cls_Message_Oparts__idem_0): c_Message_Oparts(c_Message_Oparts(X)) = c_Message_Oparts(X).
% 233.48/29.96 Axiom 2 (cls_Message_Oparts__mono_0): fresh1700(X, X, Y, Z) = true2.
% 233.48/29.96 Axiom 3 (cls_conjecture_0): c_lessequals(v_G, c_Message_Oparts(v_H), tc_set(tc_Message_Omsg)) = true2.
% 233.48/29.96 Axiom 4 (cls_Message_Oparts__mono_0): fresh1700(c_lessequals(X, Y, tc_set(tc_Message_Omsg)), true2, X, Y) = c_lessequals(c_Message_Oparts(X), c_Message_Oparts(Y), tc_set(tc_Message_Omsg)).
% 233.48/29.96
% 233.48/29.96 Goal 1 (cls_conjecture_1): c_lessequals(c_Message_Oparts(v_G), c_Message_Oparts(v_H), tc_set(tc_Message_Omsg)) = true2.
% 233.48/29.96 Proof:
% 233.48/29.96 c_lessequals(c_Message_Oparts(v_G), c_Message_Oparts(v_H), tc_set(tc_Message_Omsg))
% 233.48/29.96 = { by axiom 1 (cls_Message_Oparts__idem_0) R->L }
% 233.48/29.96 c_lessequals(c_Message_Oparts(v_G), c_Message_Oparts(c_Message_Oparts(v_H)), tc_set(tc_Message_Omsg))
% 233.48/29.96 = { by axiom 4 (cls_Message_Oparts__mono_0) R->L }
% 233.48/29.96 fresh1700(c_lessequals(v_G, c_Message_Oparts(v_H), tc_set(tc_Message_Omsg)), true2, v_G, c_Message_Oparts(v_H))
% 233.48/29.96 = { by axiom 3 (cls_conjecture_0) }
% 233.48/29.96 fresh1700(true2, true2, v_G, c_Message_Oparts(v_H))
% 233.48/29.96 = { by axiom 2 (cls_Message_Oparts__mono_0) }
% 233.48/29.96 true2
% 233.48/29.96 % SZS output end Proof
% 233.48/29.96
% 233.48/29.96 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------