TSTP Solution File: SWV413+1 by Drodi---3.6.0

View Problem - Process Solution

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

% 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 : Tue Apr 30 20:46:58 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   49 (  19   ~;  11   |;  16   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (  26   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,lemma,
    ! [U,V,W,X] :
      ( ( pair_in_list(U,V,W)
        & less_than(X,W) )
     => pair_in_list(update_slb(U,X),V,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f20,conjecture,
    ! [U,V,W,X] :
      ( ( pair_in_list(U,V,W)
        & strictly_less_than(V,X)
        & less_than(X,W) )
     => ? [Y] :
          ( pair_in_list(update_slb(U,X),V,Y)
          & less_than(X,Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f21,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( pair_in_list(U,V,W)
          & strictly_less_than(V,X)
          & less_than(X,W) )
       => ? [Y] :
            ( pair_in_list(update_slb(U,X),V,Y)
            & less_than(X,Y) ) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f63,plain,
    ! [U,V,W,X] :
      ( ~ pair_in_list(U,V,W)
      | ~ less_than(X,W)
      | pair_in_list(update_slb(U,X),V,W) ),
    inference(pre_NNF_transformation,[status(esa)],[f19]) ).

fof(f64,plain,
    ! [X0,X1,X2,X3] :
      ( ~ pair_in_list(X0,X1,X2)
      | ~ less_than(X3,X2)
      | pair_in_list(update_slb(X0,X3),X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f63]) ).

fof(f65,plain,
    ? [U,V,W,X] :
      ( pair_in_list(U,V,W)
      & strictly_less_than(V,X)
      & less_than(X,W)
      & ! [Y] :
          ( ~ pair_in_list(update_slb(U,X),V,Y)
          | ~ less_than(X,Y) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f21]) ).

fof(f66,plain,
    ? [U,V,X] :
      ( ? [W] :
          ( pair_in_list(U,V,W)
          & strictly_less_than(V,X)
          & less_than(X,W) )
      & ! [Y] :
          ( ~ pair_in_list(update_slb(U,X),V,Y)
          | ~ less_than(X,Y) ) ),
    inference(miniscoping,[status(esa)],[f65]) ).

fof(f67,plain,
    ( pair_in_list(sk0_0,sk0_1,sk0_3)
    & strictly_less_than(sk0_1,sk0_2)
    & less_than(sk0_2,sk0_3)
    & ! [Y] :
        ( ~ pair_in_list(update_slb(sk0_0,sk0_2),sk0_1,Y)
        | ~ less_than(sk0_2,Y) ) ),
    inference(skolemization,[status(esa)],[f66]) ).

fof(f68,plain,
    pair_in_list(sk0_0,sk0_1,sk0_3),
    inference(cnf_transformation,[status(esa)],[f67]) ).

fof(f70,plain,
    less_than(sk0_2,sk0_3),
    inference(cnf_transformation,[status(esa)],[f67]) ).

fof(f71,plain,
    ! [X0] :
      ( ~ pair_in_list(update_slb(sk0_0,sk0_2),sk0_1,X0)
      | ~ less_than(sk0_2,X0) ),
    inference(cnf_transformation,[status(esa)],[f67]) ).

fof(f800,plain,
    ! [X0] :
      ( ~ pair_in_list(sk0_0,sk0_1,X0)
      | ~ less_than(sk0_2,X0)
      | ~ less_than(sk0_2,X0) ),
    inference(resolution,[status(thm)],[f64,f71]) ).

fof(f801,plain,
    ! [X0] :
      ( ~ pair_in_list(sk0_0,sk0_1,X0)
      | ~ less_than(sk0_2,X0) ),
    inference(duplicate_literals_removal,[status(esa)],[f800]) ).

fof(f802,plain,
    ~ less_than(sk0_2,sk0_3),
    inference(resolution,[status(thm)],[f801,f68]) ).

fof(f803,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f802,f70]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV413+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr 30 00:26:33 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37  % Elapsed time: 0.031377 seconds
% 0.13/0.37  % CPU time: 0.122242 seconds
% 0.13/0.37  % Total memory used: 17.661 MB
% 0.13/0.37  % Net memory used: 17.417 MB
%------------------------------------------------------------------------------