↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWV413+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:47:36 PM UTC 2026

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% 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] :
      ( ( less_than(X,W)
        & pair_in_list(U,V,W) )
     => pair_in_list(update_slb(U,X),V,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

fof(f67,plain,
    ( ! [Y] :
        ( ~ less_than(sK2_skl,Y)
        | ~ pair_in_list(update_slb(sK0_skl,sK2_skl),sK1_skl,Y) )
    & less_than(sK2_skl,sK3_skl)
    & strictly_less_than(sK1_skl,sK2_skl)
    & pair_in_list(sK0_skl,sK1_skl,sK3_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl]),skolemize(U,sK0_skl),skolemize(V,sK1_skl),skolemize(X,sK2_skl),skolemize(W,sK3_skl)],[f66]) ).

fof(f68,plain,
    pair_in_list(sK0_skl,sK1_skl,sK3_skl),
    inference(cnf_transformation,[status(thm)],[f67]) ).

fof(f70,plain,
    less_than(sK2_skl,sK3_skl),
    inference(cnf_transformation,[status(thm)],[f67]) ).

fof(f71,plain,
    ! [X0] :
      ( ~ less_than(sK2_skl,X0)
      | ~ pair_in_list(update_slb(sK0_skl,sK2_skl),sK1_skl,X0) ),
    inference(cnf_transformation,[status(thm)],[f67]) ).

fof(f150,plain,
    ! [X0] :
      ( ~ less_than(sK2_skl,X0)
      | ~ less_than(sK2_skl,X0)
      | ~ pair_in_list(sK0_skl,sK1_skl,X0) ),
    inference(resolution,[status(thm)],[f64,f71]) ).

fof(f153,plain,
    ! [X0] :
      ( ~ less_than(sK2_skl,X0)
      | ~ pair_in_list(sK0_skl,sK1_skl,X0) ),
    inference(duplicate_literals_removal,[status(thm)],[f150]) ).

fof(f154,plain,
    ~ less_than(sK2_skl,sK3_skl),
    inference(resolution,[status(thm)],[f153,f68]) ).

fof(f155,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f154,f70]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV413+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  % Computer : n015.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.45  % WCLimit  : 300
% 0.20/0.45  % DateTime : Mon Sep 21 08:48:21 UTC 2026
% 0.20/0.45  % CPUTime  : 
% 0.20/0.48  % Drodi V4.1.1
% 0.20/0.50  % Refutation found
% 0.20/0.50  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.53  % Elapsed time: 0.070149 seconds
% 0.20/0.53  % CPU time: 0.125679 seconds
% 0.20/0.53  % Total memory used: 19.467 MB
% 0.20/0.53  % Net memory used: 19.424 MB
%------------------------------------------------------------------------------