%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : HWV032-1 : TPTP v8.1.2. Released v2.5.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 : n006.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 02:31:39 EDT 2023

% Result   : Unsatisfiable 0.19s 0.43s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : HWV032-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.12  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Aug 29 17:17:36 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.19/0.43  Command-line arguments: --no-flatten-goal
% 0.19/0.43  
% 0.19/0.43  % SZS status Unsatisfiable
% 0.19/0.43  
% 0.19/0.43  % SZS output start Proof
% 0.19/0.43  Take the following subset of the input axioms:
% 0.19/0.43    fof(axiom_28, axiom, ![X_t_37]: (~p_Reset(X_t_37) | rd_level(plus(X_t_37, n1))=n0)).
% 0.19/0.43    fof(quest_1, negated_conjecture, p_Reset(t_139)).
% 0.19/0.43    fof(quest_2, negated_conjecture, ~gt(fifo_length, rd_level(plus(t_139, n1)))).
% 0.19/0.43    fof(quest_3, negated_conjecture, gt(fifo_length, n0)).
% 0.19/0.43  
% 0.19/0.43  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.43  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.43  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.43    fresh(y, y, x1...xn) = u
% 0.19/0.43    C => fresh(s, t, x1...xn) = v
% 0.19/0.43  where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.43  variables of u and v.
% 0.19/0.43  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.43  input problem has no model of domain size 1).
% 0.19/0.43  
% 0.19/0.43  The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.43  
% 0.19/0.43  Axiom 1 (quest_1): p_Reset(t_139) = true2.
% 0.19/0.43  Axiom 2 (quest_3): gt(fifo_length, n0) = true2.
% 0.19/0.43  Axiom 3 (axiom_28): fresh7(X, X, Y) = n0.
% 0.19/0.43  Axiom 4 (axiom_28): fresh7(p_Reset(X), true2, X) = rd_level(plus(X, n1)).
% 0.19/0.43  
% 0.19/0.43  Goal 1 (quest_2): gt(fifo_length, rd_level(plus(t_139, n1))) = true2.
% 0.19/0.43  Proof:
% 0.19/0.43    gt(fifo_length, rd_level(plus(t_139, n1)))
% 0.19/0.43  = { by axiom 4 (axiom_28) R->L }
% 0.19/0.43    gt(fifo_length, fresh7(p_Reset(t_139), true2, t_139))
% 0.19/0.43  = { by axiom 1 (quest_1) }
% 0.19/0.43    gt(fifo_length, fresh7(true2, true2, t_139))
% 0.19/0.43  = { by axiom 3 (axiom_28) }
% 0.19/0.43    gt(fifo_length, n0)
% 0.19/0.43  = { by axiom 2 (quest_3) }
% 0.19/0.43    true2
% 0.19/0.43  % SZS output end Proof
% 0.19/0.43  
% 0.19/0.43  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------