%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV812-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 : n018.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:22 EDT 2023

% Result   : Unsatisfiable 10.00s 1.68s
% Output   : Proof 10.00s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV812-1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/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.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Aug 29 06:35:17 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 10.00/1.67  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 10.00/1.67  
% 10.00/1.68  % SZS status Unsatisfiable
% 10.00/1.68  
% 10.00/1.68  % SZS output start Proof
% 10.00/1.68  Take the following subset of the input axioms:
% 10.00/1.68    fof(cls_Spy__in__bad_0, axiom, c_in(c_Message_Oagent_OSpy, c_Event_Obad, tc_Message_Oagent)).
% 10.00/1.68    fof(cls_conjecture_0, negated_conjecture, ~c_in(v_A, c_Event_Obad, tc_Message_Oagent)).
% 10.00/1.68    fof(cls_conjecture_5, negated_conjecture, v_A=c_Message_Oagent_OSpy).
% 10.00/1.68  
% 10.00/1.68  Now clausify the problem and encode Horn clauses using encoding 3 of
% 10.00/1.68  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 10.00/1.68  We repeatedly replace C & s=t => u=v by the two clauses:
% 10.00/1.68    fresh(y, y, x1...xn) = u
% 10.00/1.68    C => fresh(s, t, x1...xn) = v
% 10.00/1.68  where fresh is a fresh function symbol and x1..xn are the free
% 10.00/1.68  variables of u and v.
% 10.00/1.68  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 10.00/1.68  input problem has no model of domain size 1).
% 10.00/1.68  
% 10.00/1.68  The encoding turns the above axioms into the following unit equations and goals:
% 10.00/1.68  
% 10.00/1.68  Axiom 1 (cls_conjecture_5): v_A = c_Message_Oagent_OSpy.
% 10.00/1.68  Axiom 2 (cls_Spy__in__bad_0): c_in(c_Message_Oagent_OSpy, c_Event_Obad, tc_Message_Oagent) = true2.
% 10.00/1.68  
% 10.00/1.68  Goal 1 (cls_conjecture_0): c_in(v_A, c_Event_Obad, tc_Message_Oagent) = true2.
% 10.00/1.68  Proof:
% 10.00/1.68    c_in(v_A, c_Event_Obad, tc_Message_Oagent)
% 10.00/1.68  = { by axiom 1 (cls_conjecture_5) }
% 10.00/1.68    c_in(c_Message_Oagent_OSpy, c_Event_Obad, tc_Message_Oagent)
% 10.00/1.68  = { by axiom 2 (cls_Spy__in__bad_0) }
% 10.00/1.68    true2
% 10.00/1.68  % SZS output end Proof
% 10.00/1.68  
% 10.00/1.68  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------