TSTP Solution File: SWV083+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWV083+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n001.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 : Wed May 31 12:40:37 EDT 2023

% Result   : Theorem 0.25s 0.58s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   38 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   28 (  10   ~;   8   |;   6   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    2 (;   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f39,axiom,
    ! [X] : minus(X,n1) = pred(X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ( ( leq(n0,pv66)
      & leq(pv66,minus(n5,n1)) )
   => ( leq(n0,pv66)
      & leq(pv66,minus(n5,n1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv66)
        & leq(pv66,minus(n5,n1)) )
     => ( leq(n0,pv66)
        & leq(pv66,minus(n5,n1)) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f210,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[status(esa)],[f39]) ).

fof(f244,plain,
    ( leq(n0,pv66)
    & leq(pv66,minus(n5,n1))
    & ( ~ leq(n0,pv66)
      | ~ leq(pv66,minus(n5,n1)) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f245,plain,
    leq(n0,pv66),
    inference(cnf_transformation,[status(esa)],[f244]) ).

fof(f246,plain,
    leq(pv66,minus(n5,n1)),
    inference(cnf_transformation,[status(esa)],[f244]) ).

fof(f247,plain,
    ( ~ leq(n0,pv66)
    | ~ leq(pv66,minus(n5,n1)) ),
    inference(cnf_transformation,[status(esa)],[f244]) ).

fof(f313,plain,
    ( spl0_0
  <=> leq(n0,pv66) ),
    introduced(split_symbol_definition) ).

fof(f315,plain,
    ( ~ leq(n0,pv66)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f313]) ).

fof(f316,plain,
    ( spl0_1
  <=> leq(pv66,minus(n5,n1)) ),
    introduced(split_symbol_definition) ).

fof(f318,plain,
    ( ~ leq(pv66,minus(n5,n1))
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f316]) ).

fof(f319,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f247,f313,f316]) ).

fof(f324,plain,
    leq(pv66,pred(n5)),
    inference(backward_demodulation,[status(thm)],[f210,f246]) ).

fof(f363,plain,
    ( ~ leq(pv66,pred(n5))
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f210,f318]) ).

fof(f364,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f363,f324]) ).

fof(f365,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f364]) ).

fof(f366,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f315,f245]) ).

fof(f367,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f366]) ).

fof(f368,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f319,f365,f367]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV083+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n001.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  : 300
% 0.13/0.34  % DateTime : Tue May 30 12:08:30 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.25/0.58  % Refutation found
% 0.25/0.58  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.25/0.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.25/0.58  % Elapsed time: 0.018509 seconds
% 0.25/0.58  % CPU time: 0.041428 seconds
% 0.25/0.58  % Memory used: 15.763 MB
%------------------------------------------------------------------------------