↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n006.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:46:47 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X,Y,Z] :
      ( ( leq(Y,Z)
        & leq(X,Y) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X,Y] :
      ( gt(Y,X)
     => leq(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ! [A] :
      ( ( leq(A,tptp_minus_1)
        & leq(n0,A) )
     => uninit = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ! [A] :
        ( ( leq(A,tptp_minus_1)
          & leq(n0,A) )
       => uninit = init ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f58,axiom,
    gt(n0,tptp_minus_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f78,axiom,
    ! [X] :
      ( ( leq(X,n0)
        & leq(n0,X) )
     => X = n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f91,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f93,plain,
    ! [X,Y,Z] :
      ( leq(X,Z)
      | ~ leq(Y,Z)
      | ~ leq(X,Y) ),
    inference(pre_NNF_transformation,[status(thm)],[f5]) ).

fof(f94,plain,
    ! [X,Z] :
      ( leq(X,Z)
      | ! [Y] :
          ( ~ leq(Y,Z)
          | ~ leq(X,Y) ) ),
    inference(miniscoping,[status(thm)],[f93]) ).

fof(f95,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f94]) ).

fof(f104,plain,
    ! [X,Y] :
      ( leq(X,Y)
      | ~ gt(Y,X) ),
    inference(pre_NNF_transformation,[status(thm)],[f8]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
      | ~ gt(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f104]) ).

fof(f244,plain,
    ? [A] :
      ( uninit != init
      & leq(A,tptp_minus_1)
      & leq(n0,A) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f245,plain,
    ( uninit != init
    & ? [A] :
        ( leq(A,tptp_minus_1)
        & leq(n0,A) ) ),
    inference(miniscoping,[status(thm)],[f244]) ).

fof(f246,plain,
    ( uninit != init
    & leq(sK23_skl,tptp_minus_1)
    & leq(n0,sK23_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(A,sK23_skl)],[f245]) ).

fof(f247,plain,
    leq(n0,sK23_skl),
    inference(cnf_transformation,[status(thm)],[f246]) ).

fof(f248,plain,
    leq(sK23_skl,tptp_minus_1),
    inference(cnf_transformation,[status(thm)],[f246]) ).

fof(f253,plain,
    gt(n0,tptp_minus_1),
    inference(cnf_transformation,[status(thm)],[f58]) ).

fof(f275,plain,
    ! [X] :
      ( X = n0
      | ~ leq(X,n0)
      | ~ leq(n0,X) ),
    inference(pre_NNF_transformation,[status(thm)],[f78]) ).

fof(f276,plain,
    ! [X0] :
      ( X0 = n0
      | ~ leq(X0,n0)
      | ~ leq(n0,X0) ),
    inference(cnf_transformation,[status(thm)],[f275]) ).

fof(f326,plain,
    ! [X0] :
      ( leq(X0,tptp_minus_1)
      | ~ leq(X0,sK23_skl) ),
    inference(resolution,[status(thm)],[f95,f248]) ).

fof(f329,plain,
    leq(n0,tptp_minus_1),
    inference(resolution,[status(thm)],[f326,f247]) ).

fof(f334,plain,
    ( tptp_minus_1 = n0
    | ~ leq(tptp_minus_1,n0) ),
    inference(resolution,[status(thm)],[f276,f329]) ).

fof(f337,definition,
    ( sQ0_spl
  <=> leq(tptp_minus_1,n0) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f339,plain,
    ( sQ0_spl
    | ~ leq(tptp_minus_1,n0) ),
    inference(component_clause,[status(thm)],[f337]) ).

fof(f340,definition,
    ( sQ1_spl
  <=> tptp_minus_1 = n0 ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f341,plain,
    ( ~ sQ1_spl
    | tptp_minus_1 = n0 ),
    inference(component_clause,[status(thm)],[f340]) ).

fof(f343,plain,
    ( sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f334,f337,f340]) ).

fof(f590,plain,
    leq(tptp_minus_1,n0),
    inference(resolution,[status(thm)],[f105,f253]) ).

fof(f604,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f590,f339]) ).

fof(f605,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f604]) ).

fof(f621,plain,
    ( ~ sQ1_spl
    | gt(tptp_minus_1,tptp_minus_1) ),
    inference(backward_demodulation,[status(thm)],[f341,f253]) ).

fof(f628,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f621,f91]) ).

fof(f629,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f628]) ).

fof(f630,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f343,f605,f629]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV165+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 08:33:27 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.15/0.39  % Drodi V4.1.1
% 0.15/0.41  % Refutation found
% 0.15/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.45  % Elapsed time: 0.062864 seconds
% 0.15/0.45  % CPU time: 0.177814 seconds
% 0.15/0.45  % Total memory used: 108.892 MB
% 0.15/0.45  % Net memory used: 108.639 MB
%------------------------------------------------------------------------------