↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n014.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 02:46:32 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ( geq(pv72,tptp_float_0_001)
   => ( ( gt(plus(n1,loopcounter),n1)
       => true )
      & ( ~ gt(plus(n1,loopcounter),n1)
       => true ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( geq(pv72,tptp_float_0_001)
     => ( ( gt(plus(n1,loopcounter),n1)
         => true )
        & ( ~ gt(plus(n1,loopcounter),n1)
         => true ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f242,plain,
    true,
    inference(cnf_transformation,[status(thm)],[f51]) ).

fof(f244,plain,
    ( ( ( ~ true
        & gt(plus(n1,loopcounter),n1) )
      | ( ~ true
        & ~ gt(plus(n1,loopcounter),n1) ) )
    & geq(pv72,tptp_float_0_001) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f245,definition,
    ( sP3_prd
  <=> ( ~ true
      & ~ gt(plus(n1,loopcounter),n1) ) ),
    introduced(definition,[new_symbols(definition,[sP3_prd])],[]) ).

fof(f246,plain,
    ( ( ( ~ true
        & gt(plus(n1,loopcounter),n1) )
      | sP3_prd )
    & geq(pv72,tptp_float_0_001) ),
    inference(formula_renaming,[status(thm)],[f244,f245]) ).

fof(f249,plain,
    ( ~ true
    | sP3_prd ),
    inference(cnf_transformation,[status(thm)],[f246]) ).

fof(f316,plain,
    ( ( true
      | gt(plus(n1,loopcounter),n1)
      | sP3_prd )
    & ( ( ~ true
        & ~ gt(plus(n1,loopcounter),n1) )
      | ~ sP3_prd ) ),
    inference(NNF_transformation,[status(thm)],[f245]) ).

fof(f318,plain,
    ( ~ true
    | ~ sP3_prd ),
    inference(cnf_transformation,[status(thm)],[f316]) ).

fof(f328,definition,
    ( sQ0_spl
  <=> sP3_prd ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f335,definition,
    ( sQ2_spl
  <=> true ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f337,plain,
    ( sQ2_spl
    | ~ true ),
    inference(component_clause,[status(thm)],[f335]) ).

fof(f338,plain,
    ( ~ sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f249,f328,f335]) ).

fof(f340,plain,
    ( ~ sQ2_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f318,f328,f335]) ).

fof(f343,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f242,f337]) ).

fof(f344,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f343]) ).

fof(f345,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f338,f340,f344]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV059+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n014.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.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Mon Sep 21 08:29:04 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.37  % Drodi V4.1.1
% 0.02/0.39  % Refutation found
% 0.02/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.02/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.02/0.42  % Elapsed time: 0.049685 seconds
% 0.02/0.42  % CPU time: 0.143579 seconds
% 0.02/0.42  % Total memory used: 108.341 MB
% 0.02/0.42  % Net memory used: 108.185 MB
%------------------------------------------------------------------------------