TSTP Solution File: SWV781-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWV781-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 : n031.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:15 EDT 2023
% Result : Unsatisfiable 9.57s 1.62s
% Output : Proof 9.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV781-1 : TPTP v8.1.2. Released v4.1.0.
% 0.14/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.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 04:03:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 9.57/1.62 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 9.57/1.62
% 9.57/1.62 % SZS status Unsatisfiable
% 9.57/1.62
% 9.57/1.62 % SZS output start Proof
% 9.57/1.62 Take the following subset of the input axioms:
% 9.57/1.62 fof(cls_conjecture_0, negated_conjecture, ~c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent)), c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent)), tc_fun(tc_Message_Omsg, tc_bool))).
% 9.57/1.62 fof(cls_subset__refl_0, axiom, ![T_a, V_A]: c_lessequals(V_A, V_A, tc_fun(T_a, tc_bool))).
% 9.57/1.62 fof(cls_takeWhile_Osimps_I1_J_0, axiom, ![V_P, T_a2]: c_List_OtakeWhile(V_P, c_List_Olist_ONil(T_a2), T_a2)=c_List_Olist_ONil(T_a2)).
% 9.57/1.62
% 9.57/1.62 Now clausify the problem and encode Horn clauses using encoding 3 of
% 9.57/1.62 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 9.57/1.62 We repeatedly replace C & s=t => u=v by the two clauses:
% 9.57/1.62 fresh(y, y, x1...xn) = u
% 9.57/1.62 C => fresh(s, t, x1...xn) = v
% 9.57/1.62 where fresh is a fresh function symbol and x1..xn are the free
% 9.57/1.62 variables of u and v.
% 9.57/1.62 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 9.57/1.62 input problem has no model of domain size 1).
% 9.57/1.62
% 9.57/1.62 The encoding turns the above axioms into the following unit equations and goals:
% 9.57/1.62
% 9.57/1.62 Axiom 1 (cls_takeWhile_Osimps_I1_J_0): c_List_OtakeWhile(X, c_List_Olist_ONil(Y), Y) = c_List_Olist_ONil(Y).
% 9.57/1.62 Axiom 2 (cls_subset__refl_0): c_lessequals(X, X, tc_fun(Y, tc_bool)) = true2.
% 9.57/1.62
% 9.57/1.62 Goal 1 (cls_conjecture_0): c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent)), c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent)), tc_fun(tc_Message_Omsg, tc_bool)) = true2.
% 9.57/1.62 Proof:
% 9.57/1.62 c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent)), c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent)), tc_fun(tc_Message_Omsg, tc_bool))
% 9.57/1.62 = { by axiom 1 (cls_takeWhile_Osimps_I1_J_0) R->L }
% 9.57/1.62 c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_OtakeWhile(X, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent), tc_Event_Oevent)), c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent)), tc_fun(tc_Message_Omsg, tc_bool))
% 9.57/1.62 = { by axiom 1 (cls_takeWhile_Osimps_I1_J_0) R->L }
% 9.57/1.62 c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_OtakeWhile(X, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent), tc_Event_Oevent)), c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent)), tc_fun(tc_Message_Omsg, tc_bool))
% 9.57/1.62 = { by axiom 1 (cls_takeWhile_Osimps_I1_J_0) }
% 9.57/1.62 c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent)), c_Event_Oknows(c_Message_Oagent_OSpy, c_List_OtakeWhile(v_P, c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent)), tc_fun(tc_Message_Omsg, tc_bool))
% 9.57/1.62 = { by axiom 2 (cls_subset__refl_0) }
% 9.57/1.62 true2
% 9.57/1.62 % SZS output end Proof
% 9.57/1.62
% 9.57/1.62 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------