TSTP Solution File: SWV774-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV774-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 : n020.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:13 EDT 2023

% Result   : Unsatisfiable 8.07s 1.43s
% Output   : Proof 8.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SWV774-1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/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 : n020.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:48:13 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 8.07/1.43  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 8.07/1.43  
% 8.07/1.43  % SZS status Unsatisfiable
% 8.07/1.43  
% 8.07/1.43  % SZS output start Proof
% 8.07/1.43  Take the following subset of the input axioms:
% 8.07/1.44    fof(cls_append__Nil_0, axiom, ![T_a, V_ys]: c_List_Oappend(c_List_Olist_ONil(T_a), V_ys, T_a)=V_ys).
% 8.07/1.44    fof(cls_conjecture_0, negated_conjecture, c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Oappend(c_List_Olist_ONil(tc_Event_Oevent), c_List_Olist_OCons(c_Event_Oevent_OGets(v_A, v_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))).
% 8.07/1.44    fof(cls_knows__Spy__Gets_0, axiom, ![V_A, V_X, V_evs]: c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_OCons(c_Event_Oevent_OGets(V_A, V_X), V_evs, tc_Event_Oevent))=c_Event_Oknows(c_Message_Oagent_OSpy, V_evs)).
% 8.07/1.44  
% 8.07/1.44  Now clausify the problem and encode Horn clauses using encoding 3 of
% 8.07/1.44  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 8.07/1.44  We repeatedly replace C & s=t => u=v by the two clauses:
% 8.07/1.44    fresh(y, y, x1...xn) = u
% 8.07/1.44    C => fresh(s, t, x1...xn) = v
% 8.07/1.44  where fresh is a fresh function symbol and x1..xn are the free
% 8.07/1.44  variables of u and v.
% 8.07/1.44  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 8.07/1.44  input problem has no model of domain size 1).
% 8.07/1.44  
% 8.07/1.44  The encoding turns the above axioms into the following unit equations and goals:
% 8.07/1.44  
% 8.07/1.44  Axiom 1 (cls_append__Nil_0): c_List_Oappend(c_List_Olist_ONil(X), Y, X) = Y.
% 8.07/1.44  Axiom 2 (cls_knows__Spy__Gets_0): c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_OCons(c_Event_Oevent_OGets(X, Y), Z, tc_Event_Oevent)) = c_Event_Oknows(c_Message_Oagent_OSpy, Z).
% 8.07/1.44  
% 8.07/1.44  Goal 1 (cls_conjecture_0): c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Oappend(c_List_Olist_ONil(tc_Event_Oevent), c_List_Olist_OCons(c_Event_Oevent_OGets(v_A, v_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)).
% 8.07/1.44  Proof:
% 8.07/1.44    c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Oappend(c_List_Olist_ONil(tc_Event_Oevent), c_List_Olist_OCons(c_Event_Oevent_OGets(v_A, v_X), c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent), tc_Event_Oevent))
% 8.07/1.44  = { by axiom 1 (cls_append__Nil_0) }
% 8.07/1.44    c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_OCons(c_Event_Oevent_OGets(v_A, v_X), c_List_Olist_ONil(tc_Event_Oevent), tc_Event_Oevent))
% 8.07/1.44  = { by axiom 2 (cls_knows__Spy__Gets_0) }
% 8.07/1.44    c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent))
% 8.07/1.44  % SZS output end Proof
% 8.07/1.44  
% 8.07/1.44  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------