%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SCT052-1 : TPTP v8.1.2. Released v4.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 : n022.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 14:21:59 EDT 2023

% Result   : Unsatisfiable 14.76s 2.34s
% Output   : Proof 15.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SCT052-1 : TPTP v8.1.2. Released v4.1.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.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug 24 15:11:41 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 14.76/2.34  Command-line arguments: --ground-connectedness --complete-subsets
% 14.76/2.34  
% 14.76/2.34  % SZS status Unsatisfiable
% 14.76/2.34  
% 14.76/2.35  % SZS output start Proof
% 14.76/2.35  Take the following subset of the input axioms:
% 14.76/2.35    fof(cls_conjecture_4, negated_conjecture, v_b____!=v_c____).
% 14.76/2.35    fof(cls_conjecture_5, negated_conjecture, v_b____=v_c____).
% 14.76/2.35  
% 14.76/2.35  Now clausify the problem and encode Horn clauses using encoding 3 of
% 14.76/2.35  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 14.76/2.35  We repeatedly replace C & s=t => u=v by the two clauses:
% 14.76/2.35    fresh(y, y, x1...xn) = u
% 14.76/2.35    C => fresh(s, t, x1...xn) = v
% 14.76/2.35  where fresh is a fresh function symbol and x1..xn are the free
% 15.48/2.35  variables of u and v.
% 15.48/2.35  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 15.48/2.35  input problem has no model of domain size 1).
% 15.48/2.35  
% 15.48/2.35  The encoding turns the above axioms into the following unit equations and goals:
% 15.48/2.35  
% 15.48/2.35  Axiom 1 (cls_conjecture_5): v_b____ = v_c____.
% 15.48/2.35  
% 15.48/2.35  Goal 1 (cls_conjecture_4): v_b____ = v_c____.
% 15.48/2.35  Proof:
% 15.48/2.35    v_b____
% 15.48/2.35  = { by axiom 1 (cls_conjecture_5) }
% 15.48/2.35    v_c____
% 15.48/2.35  % SZS output end Proof
% 15.48/2.35  
% 15.48/2.35  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------