↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n001.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 03:18:34 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X] :
        ( a(X)
       => b(X) )
   => ( ! [X] : a(X)
     => ? [X] : b(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ? [X] :
          ( a(X)
         => b(X) )
     => ( ! [X] : a(X)
       => ? [X] : b(X) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X] : ~ b(X)
    & ! [X] : a(X)
    & ? [X] :
        ( b(X)
        | ~ a(X) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ( ! [X] : ~ b(X)
    & ! [X] : a(X)
    & ( ? [X] : b(X)
      | ? [X] : ~ a(X) ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f5,plain,
    ( ! [X] : ~ b(X)
    & ! [X] : a(X)
    & ( b(sK1_skl)
      | ~ a(sK0_skl) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl)],[f4]) ).

fof(f6,plain,
    ( b(sK1_skl)
    | ~ a(sK0_skl) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f7,plain,
    ! [X0] : a(X0),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f8,plain,
    ! [X0] : ~ b(X0),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f9,plain,
    b(sK1_skl),
    inference(forward_subsumption_resolution,[status(thm)],[f6,f7]) ).

fof(f11,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f9,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN956+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.34  % Computer : n001.cluster.edu
% 0.10/0.34  % Model    : x86_64 x86_64
% 0.10/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34  % Memory   : 8046.5625MB
% 0.10/0.34  % OS       : Linux 6.8.0-71-generic
% 0.10/0.34  % CPULimit : 300
% 0.10/0.34  % WCLimit  : 300
% 0.10/0.34  % DateTime : Mon Sep 21 11:36:44 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.36  % Drodi V4.1.1
% 0.15/0.38  % Refutation found
% 0.15/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.40  % Elapsed time: 0.051242 seconds
% 0.15/0.40  % CPU time: 0.137338 seconds
% 0.15/0.40  % Total memory used: 55.225 MB
% 0.15/0.40  % Net memory used: 54.547 MB
%------------------------------------------------------------------------------