%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWC289-1 : TPTP v8.1.2. Released v2.4.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 20:54:49 EDT 2023

% Result   : Unsatisfiable 3.45s 0.83s
% Output   : Proof 3.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC289-1 : TPTP v8.1.2. Released v2.4.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 : Mon Aug 28 17:18:36 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.45/0.83  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 3.45/0.83  
% 3.45/0.83  % SZS status Unsatisfiable
% 3.45/0.83  
% 3.45/0.83  % SZS output start Proof
% 3.45/0.83  Take the following subset of the input axioms:
% 3.45/0.83    fof(co1_6, negated_conjecture, sk1=sk3).
% 3.45/0.83    fof(co1_7, negated_conjecture, strictorderedP(sk3)).
% 3.45/0.83    fof(co1_8, negated_conjecture, ~strictorderedP(sk1)).
% 3.45/0.83  
% 3.45/0.83  Now clausify the problem and encode Horn clauses using encoding 3 of
% 3.45/0.83  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 3.45/0.83  We repeatedly replace C & s=t => u=v by the two clauses:
% 3.45/0.83    fresh(y, y, x1...xn) = u
% 3.45/0.83    C => fresh(s, t, x1...xn) = v
% 3.45/0.83  where fresh is a fresh function symbol and x1..xn are the free
% 3.45/0.83  variables of u and v.
% 3.45/0.83  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 3.45/0.83  input problem has no model of domain size 1).
% 3.45/0.83  
% 3.45/0.83  The encoding turns the above axioms into the following unit equations and goals:
% 3.45/0.83  
% 3.45/0.83  Axiom 1 (co1_6): sk1 = sk3.
% 3.45/0.83  Axiom 2 (co1_7): strictorderedP(sk3) = true2.
% 3.45/0.83  
% 3.45/0.83  Goal 1 (co1_8): strictorderedP(sk1) = true2.
% 3.45/0.83  Proof:
% 3.45/0.83    strictorderedP(sk1)
% 3.45/0.83  = { by axiom 1 (co1_6) }
% 3.45/0.83    strictorderedP(sk3)
% 3.45/0.83  = { by axiom 2 (co1_7) }
% 3.45/0.83    true2
% 3.45/0.83  % SZS output end Proof
% 3.45/0.83  
% 3.45/0.83  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------