%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV779-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 : n015.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 6.70s 1.23s
% Output   : Proof 6.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWV779-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.15  % 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 : n015.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 07:21:10 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 6.70/1.23  Command-line arguments: --no-flatten-goal
% 6.70/1.23  
% 6.70/1.23  % SZS status Unsatisfiable
% 6.70/1.23  
% 6.70/1.24  % SZS output start Proof
% 6.70/1.24  Take the following subset of the input axioms:
% 6.70/1.24    fof(cls_Nil__is__rev__conv_1, axiom, ![T_a]: c_List_Olist_ONil(T_a)=hAPP(c_List_Orev(T_a), c_List_Olist_ONil(T_a))).
% 6.70/1.24    fof(cls_conjecture_0, negated_conjecture, c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent))!=c_Event_Oknows(c_Message_Oagent_OSpy, hAPP(c_List_Orev(tc_Event_Oevent), c_List_Olist_ONil(tc_Event_Oevent)))).
% 6.70/1.24  
% 6.70/1.24  Now clausify the problem and encode Horn clauses using encoding 3 of
% 6.70/1.24  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 6.70/1.24  We repeatedly replace C & s=t => u=v by the two clauses:
% 6.70/1.24    fresh(y, y, x1...xn) = u
% 6.70/1.24    C => fresh(s, t, x1...xn) = v
% 6.70/1.24  where fresh is a fresh function symbol and x1..xn are the free
% 6.70/1.24  variables of u and v.
% 6.70/1.24  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 6.70/1.24  input problem has no model of domain size 1).
% 6.70/1.24  
% 6.70/1.24  The encoding turns the above axioms into the following unit equations and goals:
% 6.70/1.24  
% 6.70/1.24  Axiom 1 (cls_Nil__is__rev__conv_1): c_List_Olist_ONil(X) = hAPP(c_List_Orev(X), c_List_Olist_ONil(X)).
% 6.70/1.24  
% 6.70/1.24  Goal 1 (cls_conjecture_0): c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent)) = c_Event_Oknows(c_Message_Oagent_OSpy, hAPP(c_List_Orev(tc_Event_Oevent), c_List_Olist_ONil(tc_Event_Oevent))).
% 6.70/1.24  Proof:
% 6.70/1.24    c_Event_Oknows(c_Message_Oagent_OSpy, c_List_Olist_ONil(tc_Event_Oevent))
% 6.70/1.24  = { by axiom 1 (cls_Nil__is__rev__conv_1) }
% 6.70/1.24    c_Event_Oknows(c_Message_Oagent_OSpy, hAPP(c_List_Orev(tc_Event_Oevent), c_List_Olist_ONil(tc_Event_Oevent)))
% 6.70/1.24  % SZS output end Proof
% 6.70/1.24  
% 6.70/1.24  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------