%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV150+1 : TPTP v8.1.2. Bugfixed v3.3.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 : n011.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 23:02:46 EDT 2023

% Result   : Theorem 0.21s 0.59s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV150+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Aug 29 04:14:56 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.59  Command-line arguments: --no-flatten-goal
% 0.21/0.59  
% 0.21/0.59  % SZS status Theorem
% 0.21/0.59  
% 0.21/0.59  % SZS output start Proof
% 0.21/0.59  Take the following subset of the input axioms:
% 0.21/0.59    fof(gauss_array_0020, conjecture, ~leq(tptp_float_0_001, tptp_float_0_001) => leq(s_worst7, n3)).
% 0.21/0.59    fof(reflexivity_leq, axiom, ![X]: leq(X, X)).
% 0.21/0.59  
% 0.21/0.59  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.59  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.59  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.59    fresh(y, y, x1...xn) = u
% 0.21/0.59    C => fresh(s, t, x1...xn) = v
% 0.21/0.59  where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.59  variables of u and v.
% 0.21/0.59  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.59  input problem has no model of domain size 1).
% 0.21/0.59  
% 0.21/0.59  The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.59  
% 0.21/0.59  Axiom 1 (reflexivity_leq): leq(X, X) = true3.
% 0.21/0.59  
% 0.21/0.59  Goal 1 (gauss_array_0020): leq(tptp_float_0_001, tptp_float_0_001) = true3.
% 0.21/0.59  Proof:
% 0.21/0.59    leq(tptp_float_0_001, tptp_float_0_001)
% 0.21/0.59  = { by axiom 1 (reflexivity_leq) }
% 0.21/0.59    true3
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  
% 0.21/0.59  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------