%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV968-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 : n010.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:56 EDT 2023

% Result   : Unsatisfiable 0.20s 0.79s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV968-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/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 : n010.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 05:14:19 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.79  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.20/0.79  
% 0.20/0.79  % SZS status Unsatisfiable
% 0.20/0.79  
% 0.20/0.79  % SZS output start Proof
% 0.20/0.79  Take the following subset of the input axioms:
% 0.20/0.79    fof(cls_UClass_0, axiom, v_U____=c_Type_Oty_OClass(v_C_H____)).
% 0.20/0.79    fof(cls_conjecture_0, negated_conjecture, ~c_WellTypeRT_OWTrt(v_P, v_h_Ha____, v_E____, v_e_Ha____, c_Type_Oty_OClass(v_C_H____))).
% 0.20/0.79    fof(cls_wte_H_0, axiom, c_WellTypeRT_OWTrt(v_P, v_h_Ha____, v_E____, v_e_Ha____, v_U____)).
% 0.20/0.79  
% 0.20/0.79  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.79  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.79  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.79    fresh(y, y, x1...xn) = u
% 0.20/0.79    C => fresh(s, t, x1...xn) = v
% 0.20/0.79  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.79  variables of u and v.
% 0.20/0.79  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.79  input problem has no model of domain size 1).
% 0.20/0.79  
% 0.20/0.79  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.79  
% 0.20/0.79  Axiom 1 (cls_UClass_0): v_U____ = c_Type_Oty_OClass(v_C_H____).
% 0.20/0.79  Axiom 2 (cls_wte_H_0): c_WellTypeRT_OWTrt(v_P, v_h_Ha____, v_E____, v_e_Ha____, v_U____) = true2.
% 0.20/0.79  
% 0.20/0.79  Goal 1 (cls_conjecture_0): c_WellTypeRT_OWTrt(v_P, v_h_Ha____, v_E____, v_e_Ha____, c_Type_Oty_OClass(v_C_H____)) = true2.
% 0.20/0.79  Proof:
% 0.20/0.79    c_WellTypeRT_OWTrt(v_P, v_h_Ha____, v_E____, v_e_Ha____, c_Type_Oty_OClass(v_C_H____))
% 0.20/0.79  = { by axiom 1 (cls_UClass_0) R->L }
% 0.20/0.79    c_WellTypeRT_OWTrt(v_P, v_h_Ha____, v_E____, v_e_Ha____, v_U____)
% 0.20/0.79  = { by axiom 2 (cls_wte_H_0) }
% 0.20/0.79    true2
% 0.20/0.79  % SZS output end Proof
% 0.20/0.79  
% 0.20/0.79  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------