↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.14s 10.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   5 unt;   2 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   38 (  15   ~;  13   |;   6   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   34 (  25   !;   9   ?)

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

fof(f2,negated_conjecture,
    ~ ( ! [Z] :
        ? [X] :
          ( big_q(X,Z)
          | ! [Y] : big_p(X,Y) )
     => ! [Y] :
        ? [X] :
          ( big_q(X,Y)
          | big_p(X,Y) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ? [Y] :
      ! [X] :
        ( ~ big_q(X,Y)
        & ~ big_p(X,Y) )
    & ! [Z] :
      ? [X] :
        ( big_q(X,Z)
        | ! [Y] : big_p(X,Y) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ( ? [Y] :
        ( ! [X] : ~ big_q(X,Y)
        & ! [X] : ~ big_p(X,Y) )
    & ( ! [Z] :
        ? [X] : big_q(X,Z)
      | ? [X] :
        ! [Y] : big_p(X,Y) ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

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

fof(f6,plain,
    ! [X0,X1] :
      ( big_q(sK1_skl(X1),X1)
      | big_p(sK0_skl,X0) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f7,plain,
    ! [X0] : ~ big_p(X0,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f8,plain,
    ! [X0] : ~ big_q(X0,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f9,definition,
    ! [X0] :
      ( sQ0_spl
    <=> big_p(sK0_skl,X0) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | big_p(sK0_skl,X0) ),
    inference(component_clause,[status(thm)],[f9]) ).

fof(f12,definition,
    ! [X1] :
      ( sQ1_spl
    <=> big_q(sK1_skl(X1),X1) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f13,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | big_q(sK1_skl(X0),X0) ),
    inference(component_clause,[status(thm)],[f12]) ).

fof(f15,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f6,f9,f12]) ).

fof(f16,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(resolution,[status(thm)],[f10,f7]) ).

fof(f17,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f16]) ).

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

fof(f19,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f18]) ).

fof(f20,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f15,f17,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN382+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.37  % Computer : n008.cluster.edu
% 0.09/10.37  % Model    : x86_64 x86_64
% 0.09/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37  % Memory   : 8046.5625MB
% 0.09/10.37  % OS       : Linux 6.8.0-71-generic
% 0.09/10.37  % CPULimit : 300
% 0.09/10.37  % WCLimit  : 300
% 0.09/10.37  % DateTime : Mon Sep 21 10:53:54 UTC 2026
% 0.09/10.38  % CPUTime  : 
% 0.09/10.38  % Drodi V4.1.1
% 0.14/10.40  % Refutation found
% 0.14/10.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/10.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/10.43  % Elapsed time: 0.044214 seconds
% 0.14/10.43  % CPU time: 0.106000 seconds
% 0.14/10.43  % Total memory used: 16.436 MB
% 0.14/10.43  % Net memory used: 15.810 MB
%------------------------------------------------------------------------------