%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN394+1 : TPTP v8.1.2. Released v2.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 : 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 : Fri Sep  1 03:34:27 EDT 2023

% Result   : Theorem 0.20s 0.37s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN394+1 : TPTP v8.1.2. Released v2.0.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 : Sat Aug 26 21:11:16 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.37  Command-line arguments: --ground-connectedness --complete-subsets
% 0.20/0.37  
% 0.20/0.37  % SZS status Theorem
% 0.20/0.37  
% 0.20/0.37  % SZS output start Proof
% 0.20/0.37  Take the following subset of the input axioms:
% 0.20/0.37    fof(kalish201, conjecture, ![X]: (f(X) => g(X)) => (![Y]: f(Y) => ![Z]: g(Z))).
% 0.20/0.37  
% 0.20/0.37  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.37  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.37  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.37    fresh(y, y, x1...xn) = u
% 0.20/0.37    C => fresh(s, t, x1...xn) = v
% 0.20/0.37  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.37  variables of u and v.
% 0.20/0.37  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.37  input problem has no model of domain size 1).
% 0.20/0.37  
% 0.20/0.37  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.37  
% 0.20/0.37  Axiom 1 (kalish201): f(X) = true.
% 0.20/0.37  Axiom 2 (kalish201_1): fresh(X, X, Y) = true.
% 0.20/0.37  Axiom 3 (kalish201_1): fresh(f(X), true, X) = g(X).
% 0.20/0.37  
% 0.20/0.37  Goal 1 (kalish201_2): g(z) = true.
% 0.20/0.37  Proof:
% 0.20/0.37    g(z)
% 0.20/0.37  = { by axiom 3 (kalish201_1) R->L }
% 0.20/0.37    fresh(f(z), true, z)
% 0.20/0.37  = { by axiom 1 (kalish201) }
% 0.20/0.37    fresh(true, true, z)
% 0.20/0.37  = { by axiom 2 (kalish201_1) }
% 0.20/0.37    true
% 0.20/0.37  % SZS output end Proof
% 0.20/0.37  
% 0.20/0.37  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------