%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : LCL764-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 : n001.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:30 EDT 2023

% Result   : Unsatisfiable 4.05s 0.93s
% Output   : Proof 4.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL764-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 : n001.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 : Thu Aug 24 23:34:12 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 4.05/0.93  Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 4.05/0.93  
% 4.05/0.93  % SZS status Unsatisfiable
% 4.05/0.93  
% 4.05/0.93  % SZS output start Proof
% 4.05/0.93  Take the following subset of the input axioms:
% 4.05/0.93    fof(cls_conjecture_0, negated_conjecture, ~c_List_Olistsp(c_InductTermi_OIT, c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB)).
% 4.05/0.93    fof(cls_listsp_ONil_0, axiom, ![T_a, V_A]: c_List_Olistsp(V_A, c_List_Olist_ONil(T_a), T_a)).
% 4.05/0.93  
% 4.05/0.93  Now clausify the problem and encode Horn clauses using encoding 3 of
% 4.05/0.93  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 4.05/0.93  We repeatedly replace C & s=t => u=v by the two clauses:
% 4.05/0.93    fresh(y, y, x1...xn) = u
% 4.05/0.93    C => fresh(s, t, x1...xn) = v
% 4.05/0.93  where fresh is a fresh function symbol and x1..xn are the free
% 4.05/0.93  variables of u and v.
% 4.05/0.93  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 4.05/0.93  input problem has no model of domain size 1).
% 4.05/0.93  
% 4.05/0.93  The encoding turns the above axioms into the following unit equations and goals:
% 4.05/0.93  
% 4.05/0.93  Axiom 1 (cls_listsp_ONil_0): c_List_Olistsp(X, c_List_Olist_ONil(Y), Y) = true2.
% 4.05/0.93  
% 4.05/0.93  Goal 1 (cls_conjecture_0): c_List_Olistsp(c_InductTermi_OIT, c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB) = true2.
% 4.05/0.93  Proof:
% 4.05/0.93    c_List_Olistsp(c_InductTermi_OIT, c_List_Olist_ONil(tc_Lambda_OdB), tc_Lambda_OdB)
% 4.05/0.93  = { by axiom 1 (cls_listsp_ONil_0) }
% 4.05/0.93    true2
% 4.05/0.93  % SZS output end Proof
% 4.05/0.93  
% 4.05/0.93  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------