↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n026.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:20 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X] :
        ( q(X)
        & p(X) )
   => ( ? [X] : q(X)
      & ? [X] : p(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ? [X] :
          ( q(X)
          & p(X) )
     => ( ? [X] : q(X)
        & ? [X] : p(X) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

fof(f4,plain,
    ( ( ! [X] : ~ q(X)
      | ! [X] : ~ p(X) )
    & q(sK0_skl)
    & p(sK0_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl)],[f3]) ).

fof(f5,plain,
    p(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f6,plain,
    q(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ~ q(X1)
      | ~ p(X0) ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f8,plain,
    ! [X0] : ~ p(X0),
    inference(resolution,[status(thm)],[f7,f6]) ).

fof(f10,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f5,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN926+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n026.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 11:32:37 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.41  % Refutation found
% 0.09/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.44  % Elapsed time: 0.061199 seconds
% 0.09/0.44  % CPU time: 0.154684 seconds
% 0.09/0.44  % Total memory used: 55.213 MB
% 0.09/0.44  % Net memory used: 54.537 MB
%------------------------------------------------------------------------------