↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n007.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:14:59 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ( q
   => r ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ( r
   => ( q
      & p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ( p
   => ( r
      | q ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,conjecture,
    ( p
  <=> q ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ ( p
    <=> q ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ( r
    | ~ q ),
    inference(pre_NNF_transformation,[status(thm)],[f1]) ).

fof(f7,plain,
    ( r
    | ~ q ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f8,plain,
    ( ( q
      & p )
    | ~ r ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f9,plain,
    ( p
    | ~ r ),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f10,plain,
    ( q
    | ~ r ),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f11,plain,
    ( r
    | q
    | ~ p ),
    inference(pre_NNF_transformation,[status(thm)],[f3]) ).

fof(f12,plain,
    ( r
    | q
    | ~ p ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f13,plain,
    ( p
  <~> q ),
    inference(pre_NNF_transformation,[status(thm)],[f5]) ).

fof(f14,plain,
    ( ( ~ q
      | ~ p )
    & ( q
      | p ) ),
    inference(NNF_transformation,[status(thm)],[f13]) ).

fof(f15,plain,
    ( q
    | p ),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f16,plain,
    ( ~ q
    | ~ p ),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f17,definition,
    ( sQ0_spl
  <=> q ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f20,definition,
    ( sQ1_spl
  <=> r ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f23,plain,
    ( sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f7,f17,f20]) ).

fof(f24,definition,
    ( sQ2_spl
  <=> p ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f27,plain,
    ( sQ2_spl
    | ~ sQ1_spl ),
    inference(split_clause,[status(thm)],[f9,f20,f24]) ).

fof(f28,plain,
    ( sQ0_spl
    | ~ sQ1_spl ),
    inference(split_clause,[status(thm)],[f10,f20,f17]) ).

fof(f29,plain,
    ( sQ1_spl
    | sQ0_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f12,f24,f17,f20]) ).

fof(f30,plain,
    ( sQ0_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f15,f24,f17]) ).

fof(f31,plain,
    ( ~ sQ0_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f16,f24,f17]) ).

fof(f32,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f23,f27,f28,f29,f30,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN044+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n007.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 10:38:05 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.39  % Refutation found
% 0.10/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.41  % Elapsed time: 0.035661 seconds
% 0.10/0.41  % CPU time: 0.080028 seconds
% 0.10/0.41  % Total memory used: 11.815 MB
% 0.10/0.41  % Net memory used: 11.391 MB
%------------------------------------------------------------------------------