%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SYN184-1 : TPTP v8.1.2. Released v1.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 : n013.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:33:30 EDT 2023

% Result   : Unsatisfiable 11.24s 1.87s
% Output   : Proof 11.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN184-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Sat Aug 26 20:26:32 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 11.24/1.87  Command-line arguments: --no-flatten-goal
% 11.24/1.87  
% 11.24/1.87  % SZS status Unsatisfiable
% 11.24/1.87  
% 11.24/1.87  % SZS output start Proof
% 11.24/1.87  Take the following subset of the input axioms:
% 11.24/1.87    fof(axiom_9, axiom, r0(b)).
% 11.24/1.87    fof(prove_this, negated_conjecture, ~r0(b)).
% 11.24/1.87  
% 11.24/1.87  Now clausify the problem and encode Horn clauses using encoding 3 of
% 11.24/1.87  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 11.24/1.87  We repeatedly replace C & s=t => u=v by the two clauses:
% 11.24/1.87    fresh(y, y, x1...xn) = u
% 11.24/1.87    C => fresh(s, t, x1...xn) = v
% 11.24/1.87  where fresh is a fresh function symbol and x1..xn are the free
% 11.24/1.87  variables of u and v.
% 11.24/1.87  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 11.24/1.87  input problem has no model of domain size 1).
% 11.24/1.87  
% 11.24/1.87  The encoding turns the above axioms into the following unit equations and goals:
% 11.24/1.87  
% 11.24/1.87  Axiom 1 (axiom_9): r0(b) = true.
% 11.24/1.87  
% 11.24/1.87  Goal 1 (prove_this): r0(b) = true.
% 11.24/1.87  Proof:
% 11.24/1.87    r0(b)
% 11.24/1.87  = { by axiom 1 (axiom_9) }
% 11.24/1.87    true
% 11.24/1.87  % SZS output end Proof
% 11.24/1.87  
% 11.24/1.87  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------