%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : NUM304+1 : TPTP v8.1.2. Released v3.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 : n017.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 11:55:51 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : NUM304+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/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 : n017.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 : Fri Aug 25 07:52:25 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.69  Command-line arguments: --ground-connectedness --complete-subsets
% 0.20/0.69  
% 0.20/0.69  % SZS status Theorem
% 0.20/0.69  
% 0.20/0.69  % SZS output start Proof
% 0.20/0.69  Take the following subset of the input axioms:
% 0.20/0.69    fof(less_property, axiom, ![X, Y]: (less(X, Y) <=> (~less(Y, X) & Y!=X))).
% 0.20/0.69    fof(something_not_n12, conjecture, ?[X2]: X2!=n12).
% 0.20/0.69  
% 0.20/0.69  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.69  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.69  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.69    fresh(y, y, x1...xn) = u
% 0.20/0.69    C => fresh(s, t, x1...xn) = v
% 0.20/0.69  where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.69  variables of u and v.
% 0.20/0.69  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.69  input problem has no model of domain size 1).
% 0.20/0.69  
% 0.20/0.69  The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.69  
% 0.20/0.69  Axiom 1 (something_not_n12): X = n12.
% 0.20/0.69  
% 0.20/0.69  Goal 1 (true_equals_false): true = false.
% 0.20/0.69  Proof:
% 0.20/0.69    true
% 0.20/0.69  = { by axiom 1 (something_not_n12) }
% 0.20/0.69    n12
% 0.20/0.69  = { by axiom 1 (something_not_n12) R->L }
% 0.20/0.69    false
% 0.20/0.69  % SZS output end Proof
% 0.20/0.69  
% 0.20/0.69  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------