↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SYN060+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 : n017.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:15:04 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    :   21 (   8 unt;   1 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  19   ~;  15   |;  10   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   19 (  18   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X] :
      ( ( big_g(X)
        | big_f(X) )
     => ~ big_h(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [X] :
      ( ( big_g(X)
       => ~ big_i(X) )
     => ( big_h(X)
        & big_f(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,conjecture,
    ! [X] : big_i(X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ ! [X] : big_i(X),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ! [X] :
      ( ~ big_h(X)
      | ( ~ big_g(X)
        & ~ big_f(X) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f1]) ).

fof(f6,plain,
    ! [X0] :
      ( ~ big_h(X0)
      | ~ big_f(X0) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f8,plain,
    ! [X] :
      ( ( big_h(X)
        & big_f(X) )
      | ( big_i(X)
        & big_g(X) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f9,definition,
    ! [X] :
      ( sP0_prd(X)
    <=> ( big_i(X)
        & big_g(X) ) ),
    introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).

fof(f10,plain,
    ! [X] :
      ( ( big_h(X)
        & big_f(X) )
      | sP0_prd(X) ),
    inference(formula_renaming,[status(thm)],[f8,f9]) ).

fof(f11,plain,
    ! [X0] :
      ( big_f(X0)
      | sP0_prd(X0) ),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f12,plain,
    ! [X0] :
      ( big_h(X0)
      | sP0_prd(X0) ),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f13,plain,
    ? [X] : ~ big_i(X),
    inference(pre_NNF_transformation,[status(thm)],[f4]) ).

fof(f14,plain,
    ~ big_i(sK0_skl),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl)],[f13]) ).

fof(f15,plain,
    ~ big_i(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f16,plain,
    ! [X] :
      ( ( ~ big_i(X)
        | ~ big_g(X)
        | sP0_prd(X) )
      & ( ( big_i(X)
          & big_g(X) )
        | ~ sP0_prd(X) ) ),
    inference(NNF_transformation,[status(thm)],[f9]) ).

fof(f17,plain,
    ( ! [X] :
        ( ~ big_i(X)
        | ~ big_g(X)
        | sP0_prd(X) )
    & ! [X] :
        ( ( big_i(X)
          & big_g(X) )
        | ~ sP0_prd(X) ) ),
    inference(miniscoping,[status(thm)],[f16]) ).

fof(f19,plain,
    ! [X0] :
      ( big_i(X0)
      | ~ sP0_prd(X0) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | sP0_prd(X0) ),
    inference(resolution,[status(thm)],[f12,f6]) ).

fof(f23,plain,
    ! [X0] : sP0_prd(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f22,f11]) ).

fof(f24,plain,
    ! [X0] : big_i(X0),
    inference(backward_subsumption_resolution,[status(thm)],[f19,f23]) ).

fof(f26,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f15,f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN060+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n017.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 10:36:12 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.42  % Elapsed time: 0.043322 seconds
% 0.13/0.42  % CPU time: 0.113705 seconds
% 0.13/0.42  % Total memory used: 16.538 MB
% 0.13/0.42  % Net memory used: 15.983 MB
%------------------------------------------------------------------------------