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