↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   61 (  22   ~;  23   |;   9   &)
%                                         (   2 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   24 (  20   !;   4   ?)

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

fof(f2,negated_conjecture,
    ~ ( ! [X] :
          ( c
         => p(X) )
    <=> ( c
       => ! [X] : p(X) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X] :
        ( p(X)
        | ~ c )
  <~> ( ! [X] : p(X)
      | ~ c ) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ( ( ( ? [X] : ~ p(X)
        & c )
      | ? [X] :
          ( ~ p(X)
          & c ) )
    & ( ! [X] : p(X)
      | ~ c
      | ! [X] :
          ( p(X)
          | ~ c ) ) ),
    inference(NNF_transformation,[status(thm)],[f3]) ).

fof(f5,plain,
    ( ( ( ? [X] : ~ p(X)
        & c )
      | ( ? [X] : ~ p(X)
        & c ) )
    & ( ! [X] : p(X)
      | ~ c
      | ! [X] : p(X)
      | ~ c ) ),
    inference(miniscoping,[status(thm)],[f4]) ).

fof(f6,plain,
    ( ( ( ~ p(sK1_skl)
        & c )
      | ( ~ p(sK0_skl)
        & c ) )
    & ( ! [X] : p(X)
      | ~ c
      | ! [X] : p(X)
      | ~ c ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl)],[f5]) ).

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

fof(f8,plain,
    ( c
    | c ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f11,plain,
    ( ~ p(sK1_skl)
    | ~ p(sK0_skl) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( p(X1)
      | p(X0)
      | ~ c ),
    inference(duplicate_literals_removal,[status(thm)],[f7]) ).

fof(f13,plain,
    c,
    inference(duplicate_literals_removal,[status(thm)],[f8]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( p(X1)
      | p(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f13]) ).

fof(f15,plain,
    ! [X0] :
      ( p(X0)
      | ~ p(sK0_skl) ),
    inference(resolution,[status(thm)],[f11,f14]) ).

fof(f16,plain,
    ! [X0] : p(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f15,f14]) ).

fof(f17,plain,
    ~ p(sK1_skl),
    inference(backward_subsumption_resolution,[status(thm)],[f11,f16]) ).

fof(f18,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f17,f16]) ).

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