%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL774-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 : n028.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:34 EDT 2023

% Result   : Unsatisfiable 6.70s 1.21s
% Output   : Proof 6.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL774-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.34  % Computer : n028.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 : Fri Aug 25 02:00:35 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 6.70/1.21  Command-line arguments: --no-flatten-goal
% 6.70/1.21  
% 6.70/1.21  % SZS status Unsatisfiable
% 6.70/1.21  
% 6.70/1.21  % SZS output start Proof
% 6.70/1.21  Take the following subset of the input axioms:
% 6.70/1.21    fof(cls_Var__IT_0, axiom, ![V_n]: c_InductTermi_OIT(c_Lambda_OdB_OVar(V_n))).
% 6.70/1.21    fof(cls_conjecture_2, negated_conjecture, ~c_InductTermi_OIT(c_Lambda_OdB_OVar(v_i))).
% 6.70/1.21  
% 6.70/1.21  Now clausify the problem and encode Horn clauses using encoding 3 of
% 6.70/1.21  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 6.70/1.21  We repeatedly replace C & s=t => u=v by the two clauses:
% 6.70/1.21    fresh(y, y, x1...xn) = u
% 6.70/1.21    C => fresh(s, t, x1...xn) = v
% 6.70/1.21  where fresh is a fresh function symbol and x1..xn are the free
% 6.70/1.21  variables of u and v.
% 6.70/1.21  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 6.70/1.21  input problem has no model of domain size 1).
% 6.70/1.21  
% 6.70/1.21  The encoding turns the above axioms into the following unit equations and goals:
% 6.70/1.21  
% 6.70/1.21  Axiom 1 (cls_Var__IT_0): c_InductTermi_OIT(c_Lambda_OdB_OVar(X)) = true2.
% 6.70/1.21  
% 6.70/1.21  Goal 1 (cls_conjecture_2): c_InductTermi_OIT(c_Lambda_OdB_OVar(v_i)) = true2.
% 6.70/1.21  Proof:
% 6.70/1.21    c_InductTermi_OIT(c_Lambda_OdB_OVar(v_i))
% 6.70/1.21  = { by axiom 1 (cls_Var__IT_0) }
% 6.70/1.22    true2
% 6.70/1.22  % SZS output end Proof
% 6.70/1.22  
% 6.70/1.22  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------