%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL779-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 : n022.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:35 EDT 2023

% Result   : Unsatisfiable 12.37s 2.11s
% Output   : Proof 12.37s
% Verified : 
% SZS Type : -

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