%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL854-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 : n021.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 08:20:59 EDT 2023

% Result   : Unsatisfiable 7.11s 1.31s
% Output   : Proof 7.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL854-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.11  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.11/0.31  % Computer : n021.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu Aug 24 18:03:40 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 7.11/1.31  Command-line arguments: --no-flatten-goal
% 7.11/1.31  
% 7.11/1.31  % SZS status Unsatisfiable
% 7.11/1.31  
% 7.11/1.31  % SZS output start Proof
% 7.11/1.31  Take the following subset of the input axioms:
% 7.11/1.31    fof(cls_App_I1_J_0, axiom, c_Type_Otyping(v_ea____, v_s____, hAPP(hAPP(c_Type_Otype_OFun, v_Ta____), v_U____))).
% 7.11/1.31    fof(cls_conjecture_0, negated_conjecture, ~c_Type_Otyping(v_ea____, v_s____, hAPP(hAPP(c_Type_Otype_OFun, v_Ta____), v_U____))).
% 7.11/1.31  
% 7.11/1.31  Now clausify the problem and encode Horn clauses using encoding 3 of
% 7.11/1.31  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 7.11/1.31  We repeatedly replace C & s=t => u=v by the two clauses:
% 7.11/1.31    fresh(y, y, x1...xn) = u
% 7.11/1.31    C => fresh(s, t, x1...xn) = v
% 7.11/1.31  where fresh is a fresh function symbol and x1..xn are the free
% 7.11/1.31  variables of u and v.
% 7.11/1.31  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 7.11/1.31  input problem has no model of domain size 1).
% 7.11/1.31  
% 7.11/1.31  The encoding turns the above axioms into the following unit equations and goals:
% 7.11/1.31  
% 7.11/1.31  Axiom 1 (cls_App_I1_J_0): c_Type_Otyping(v_ea____, v_s____, hAPP(hAPP(c_Type_Otype_OFun, v_Ta____), v_U____)) = true2.
% 7.11/1.31  
% 7.11/1.31  Goal 1 (cls_conjecture_0): c_Type_Otyping(v_ea____, v_s____, hAPP(hAPP(c_Type_Otype_OFun, v_Ta____), v_U____)) = true2.
% 7.11/1.31  Proof:
% 7.11/1.31    c_Type_Otyping(v_ea____, v_s____, hAPP(hAPP(c_Type_Otype_OFun, v_Ta____), v_U____))
% 7.11/1.31  = { by axiom 1 (cls_App_I1_J_0) }
% 7.11/1.31    true2
% 7.11/1.31  % SZS output end Proof
% 7.11/1.31  
% 7.11/1.31  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------