↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SYN976+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 : n002.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:37 PM UTC 2026

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

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

fof(f2,negated_conjecture,
    ~ ! [A] :
        ( ( ! [X] :
              ( q(X)
              & p(X) )
          & ( g
            | f ) )
       => q(A) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

fof(f4,plain,
    ( ? [A] : ~ q(A)
    & ! [X] : q(X)
    & ! [X] : p(X)
    & ( g
      | f ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

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

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

fof(f9,plain,
    ~ q(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f17,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f9,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN976+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.54  % Computer : n002.cluster.edu
% 0.11/0.54  % Model    : x86_64 x86_64
% 0.11/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54  % Memory   : 8046.5625MB
% 0.11/0.54  % OS       : Linux 6.8.0-71-generic
% 0.11/0.54  % CPULimit : 300
% 0.11/0.54  % WCLimit  : 300
% 0.11/0.54  % DateTime : Mon Sep 21 11:34:20 UTC 2026
% 0.11/0.54  % CPUTime  : 
% 0.11/0.55  % Drodi V4.1.1
% 0.11/0.57  % Refutation found
% 0.11/0.57  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.57  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.59  % Elapsed time: 0.044662 seconds
% 0.15/0.59  % CPU time: 0.114149 seconds
% 0.15/0.59  % Total memory used: 16.446 MB
% 0.15/0.59  % Net memory used: 15.827 MB
%------------------------------------------------------------------------------