%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : NUM634+1 : TPTP v8.1.2. Released v4.0.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 : n032.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 11:57:25 EDT 2023

% Result   : Theorem 0.13s 0.76s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : NUM634+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Fri Aug 25 14:56:13 EDT 2023
% 0.10/0.29  % CPUTime  : 
% 0.13/0.76  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.13/0.76  
% 0.13/0.76  % SZS status Theorem
% 0.13/0.76  
% 0.13/0.76  % SZS output start Proof
% 0.13/0.76  Take the following subset of the input axioms:
% 0.13/0.76    fof(m__3462, hypothesis, xK!=sz00).
% 0.13/0.76    fof(m__3520, hypothesis, ~xK!=sz00).
% 0.13/0.76  
% 0.13/0.76  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.13/0.76  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.13/0.76  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.13/0.76    fresh(y, y, x1...xn) = u
% 0.13/0.76    C => fresh(s, t, x1...xn) = v
% 0.13/0.76  where fresh is a fresh function symbol and x1..xn are the free
% 0.13/0.76  variables of u and v.
% 0.13/0.76  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.13/0.76  input problem has no model of domain size 1).
% 0.13/0.76  
% 0.13/0.76  The encoding turns the above axioms into the following unit equations and goals:
% 0.13/0.76  
% 0.13/0.76  Axiom 1 (m__3520): xK = sz00.
% 0.13/0.76  
% 0.13/0.76  Goal 1 (m__3462): xK = sz00.
% 0.13/0.76  Proof:
% 0.13/0.76    xK
% 0.13/0.76  = { by axiom 1 (m__3520) }
% 0.13/0.76    sz00
% 0.13/0.76  % SZS output end Proof
% 0.13/0.76  
% 0.13/0.76  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------