%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SWV107+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% 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  : 600s
% DateTime : Wed Jul 20 21:15:51 EDT 2022

% Result   : Theorem 0.65s 0.83s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0019,conjecture,
    ( geq(minus(n3,n1),n0)
   => ( geq(minus(n6,n1),n0)
     => ( ( geq(n2,n0)
          & geq(minus(n999,n1),n0) )
       => ( geq(minus(n6,n1),n0)
         => ( geq(minus(n6,n1),n0)
           => ( geq(minus(n6,n1),n0)
             => ( ( geq(minus(n3,n1),n0)
                  & geq(minus(n999,n1),n0) )
               => true ) ) ) ) ) ) ),
    input ).

fof(c85,negated_conjecture,
    ~ ( geq(minus(n3,n1),n0)
     => ( geq(minus(n6,n1),n0)
       => ( ( geq(n2,n0)
            & geq(minus(n999,n1),n0) )
         => ( geq(minus(n6,n1),n0)
           => ( geq(minus(n6,n1),n0)
             => ( geq(minus(n6,n1),n0)
               => ( ( geq(minus(n3,n1),n0)
                    & geq(minus(n999,n1),n0) )
                 => true ) ) ) ) ) ) ),
    inference(assume_negation,status(cth),[quaternion_ds1_inuse_0019]) ).

fof(c86,negated_conjecture,
    ( geq(minus(n3,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(n2,n0)
    & geq(minus(n999,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n3,n1),n0)
    & geq(minus(n999,n1),n0)
    & ~ true ),
    inference(fof_nnf,status(thm),[c85]) ).

cnf(c96,negated_conjecture,
    ~ true,
    inference(split_conjunct,status(thm),[c86]) ).

fof(ttrue,axiom,
    true,
    input ).

cnf(c98,axiom,
    true,
    inference(split_conjunct,status(thm),[ttrue]) ).

cnf(c483,plain,
    $false,
    inference(resolution,status(thm),[c98,c96]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV107+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n013.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 23:56:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.65/0.83  # Version:  1.3
% 0.65/0.83  # SZS status Theorem
% 0.65/0.83  # SZS output start CNFRefutation
% See solution above
% 0.65/0.83  
% 0.65/0.83  # Initial clauses    : 339
% 0.65/0.83  # Processed clauses  : 2
% 0.65/0.83  # Factors computed   : 0
% 0.65/0.83  # Resolvents computed: 1
% 0.65/0.83  # Tautologies deleted: 0
% 0.65/0.83  # Forward subsumed   : 0
% 0.65/0.83  # Backward subsumed  : 0
% 0.65/0.83  # -------- CPU Time ---------
% 0.65/0.83  # User time          : 0.457 s
% 0.65/0.83  # System time        : 0.015 s
% 0.65/0.83  # Total time         : 0.472 s
%------------------------------------------------------------------------------