%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : HWV093-1 : TPTP v8.1.2. Released v6.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 : n031.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:32:20 EDT 2023

% Result   : Unsatisfiable 221.57s 29.31s
% Output   : Proof 221.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : HWV093-1 : TPTP v8.1.2. Released v6.1.0.
% 0.12/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.35  % Computer : n031.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Aug 29 15:15:56 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 221.57/29.31  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 221.57/29.31  
% 221.57/29.31  % SZS status Unsatisfiable
% 221.57/29.31  
% 221.57/29.32  % SZS output start Proof
% 221.57/29.32  Take the following subset of the input axioms:
% 221.57/29.32    fof(u12823, negated_conjecture, $false).
% 221.57/29.32  
% 221.57/29.32  Now clausify the problem and encode Horn clauses using encoding 3 of
% 221.57/29.32  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 221.57/29.32  We repeatedly replace C & s=t => u=v by the two clauses:
% 221.57/29.32    fresh(y, y, x1...xn) = u
% 221.57/29.32    C => fresh(s, t, x1...xn) = v
% 221.57/29.32  where fresh is a fresh function symbol and x1..xn are the free
% 221.57/29.32  variables of u and v.
% 221.57/29.32  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 221.57/29.32  input problem has no model of domain size 1).
% 221.57/29.32  
% 221.57/29.32  The encoding turns the above axioms into the following unit equations and goals:
% 221.57/29.32  
% 221.57/29.32  
% 221.57/29.32  Goal 1 (u12823): tuple4 = tuple4.
% 221.57/29.32  Proof:
% 221.57/29.32  Reflexivity.
% 221.57/29.32  % SZS output end Proof
% 221.57/29.32  
% 221.57/29.32  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------