↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL230+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 : n016.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 01:07:14 PM UTC 2026

% Result   : Theorem 0.10s 5.58s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   7 unt;   3 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   47 (  16   ~;  18   |;   4   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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,conjecture,
    ( ( ( q
        | p )
     => ( r
        | p ) )
   => ( ( q
       => r )
      | p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ( ( q
          | p )
       => ( r
          | p ) )
     => ( ( q
         => r )
        | p ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

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

fof(f6,plain,
    ~ p,
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f7,plain,
    q,
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f8,plain,
    ~ r,
    inference(cnf_transformation,[status(thm)],[f3]) ).

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

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

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

fof(f13,plain,
    ( ~ sQ1_spl
    | r ),
    inference(component_clause,[status(thm)],[f12]) ).

fof(f16,definition,
    ( sQ2_spl
  <=> q ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f18,plain,
    ( sQ2_spl
    | ~ q ),
    inference(component_clause,[status(thm)],[f16]) ).

fof(f19,plain,
    ( sQ1_spl
    | sQ0_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f5,f16,f9,f12]) ).

fof(f20,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f13,f8]) ).

fof(f21,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f20]) ).

fof(f22,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f18,f7]) ).

fof(f23,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f22]) ).

fof(f24,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f10,f6]) ).

fof(f25,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f24]) ).

fof(f26,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f19,f21,f23,f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.21  % Problem  : LCL230+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.22  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.55  % Computer : n016.cluster.edu
% 0.10/5.55  % Model    : x86_64 x86_64
% 0.10/5.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.55  % Memory   : 8046.5625MB
% 0.10/5.55  % OS       : Linux 6.8.0-71-generic
% 0.10/5.55  % CPULimit : 300
% 0.10/5.55  % WCLimit  : 300
% 0.10/5.55  % DateTime : Mon Sep 21 00:18:29 UTC 2026
% 0.10/5.55  % CPUTime  : 
% 0.10/5.56  % Drodi V4.1.1
% 0.10/5.58  % Refutation found
% 0.10/5.58  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/5.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/5.60  % Elapsed time: 0.040043 seconds
% 0.13/5.60  % CPU time: 0.103699 seconds
% 0.13/5.60  % Total memory used: 14.380 MB
% 0.13/5.60  % Net memory used: 13.859 MB
%------------------------------------------------------------------------------