↑ Up

Drodi---4.1.1.THM-CRf.s

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

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

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

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

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

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

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

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

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

fof(f8,definition,
    ( sQ0_spl
  <=> p(sK0_skl) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f9,plain,
    ( ~ sQ0_spl
    | p(sK0_skl) ),
    inference(component_clause,[status(thm)],[f8]) ).

fof(f11,definition,
    ( sQ1_spl
  <=> p(sK1_skl) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f12,plain,
    ( ~ sQ1_spl
    | p(sK1_skl) ),
    inference(component_clause,[status(thm)],[f11]) ).

fof(f14,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f6,f8,f11]) ).

fof(f15,definition,
    ! [X0] :
      ( sQ2_spl
    <=> ~ p(X0) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ sQ2_spl
      | ~ p(X0) ),
    inference(component_clause,[status(thm)],[f15]) ).

fof(f18,plain,
    sQ2_spl,
    inference(split_clause,[status(thm)],[f7,f15]) ).

fof(f19,plain,
    ( ~ sQ0_spl
    | ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f9,f16]) ).

fof(f20,plain,
    ( ~ sQ0_spl
    | ~ sQ2_spl ),
    inference(contradiction_clause,[status(thm)],[f19]) ).

fof(f21,plain,
    ( ~ sQ1_spl
    | ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f16]) ).

fof(f22,plain,
    ( ~ sQ1_spl
    | ~ sQ2_spl ),
    inference(contradiction_clause,[status(thm)],[f21]) ).

fof(f23,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f14,f18,f20,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN963+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 11:31:19 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Drodi V4.1.1
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40  % Elapsed time: 0.036030 seconds
% 0.13/0.40  % CPU time: 0.071262 seconds
% 0.13/0.40  % Total memory used: 7.190 MB
% 0.13/0.40  % Net memory used: 6.914 MB
%------------------------------------------------------------------------------