↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.17s 0.42s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   3 unt;   0 def)
%            Number of atoms       :  101 (   0 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :  115 (  31   ~;  42   |;  24   &)
%                                         (   4 <=>;  12  =>;   0  <=;   2 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   47 (  34   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X1,X2] :
    ? [Y1,Y2] :
    ! [Z] :
      ( big_f(X1,X2)
     => ( ( big_f(Y1,Y2)
         => ( big_f(Y2,Z)
            | big_f(X2,Z) ) )
       => ( ( ( big_f(Y1,Y2)
             => ( big_f(X2,Z)
              <=> big_f(Y1,Z) ) )
           => big_f(Z,Z) )
         => ( ( big_f(Y1,Z)
            <=> big_f(Y2,Z) )
            & big_f(Y1,Y2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ! [X1,X2] :
      ? [Y1,Y2] :
      ! [Z] :
        ( big_f(X1,X2)
       => ( ( big_f(Y1,Y2)
           => ( big_f(Y2,Z)
              | big_f(X2,Z) ) )
         => ( ( ( big_f(Y1,Y2)
               => ( big_f(X2,Z)
                <=> big_f(Y1,Z) ) )
             => big_f(Z,Z) )
           => ( ( big_f(Y1,Z)
              <=> big_f(Y2,Z) )
              & big_f(Y1,Y2) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X1,X2] :
    ! [Y1,Y2] :
    ? [Z] :
      ( ( ( big_f(Y1,Z)
        <~> big_f(Y2,Z) )
        | ~ big_f(Y1,Y2) )
      & ( big_f(Z,Z)
        | ( ( big_f(X2,Z)
          <~> big_f(Y1,Z) )
          & big_f(Y1,Y2) ) )
      & ( big_f(Y2,Z)
        | big_f(X2,Z)
        | ~ big_f(Y1,Y2) )
      & big_f(X1,X2) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ? [X1,X2] :
    ! [Y1,Y2] :
    ? [Z] :
      ( ( ( ( ~ big_f(Y2,Z)
            | ~ big_f(Y1,Z) )
          & ( big_f(Y2,Z)
            | big_f(Y1,Z) ) )
        | ~ big_f(Y1,Y2) )
      & ( big_f(Z,Z)
        | ( ( ~ big_f(Y1,Z)
            | ~ big_f(X2,Z) )
          & ( big_f(Y1,Z)
            | big_f(X2,Z) )
          & big_f(Y1,Y2) ) )
      & ( big_f(Y2,Z)
        | big_f(X2,Z)
        | ~ big_f(Y1,Y2) )
      & big_f(X1,X2) ),
    inference(NNF_transformation,[status(thm)],[f3]) ).

fof(f5,plain,
    ? [X2] :
      ( ! [Y1,Y2] :
        ? [Z] :
          ( ( ( ( ~ big_f(Y2,Z)
                | ~ big_f(Y1,Z) )
              & ( big_f(Y2,Z)
                | big_f(Y1,Z) ) )
            | ~ big_f(Y1,Y2) )
          & ( big_f(Z,Z)
            | ( ( ~ big_f(Y1,Z)
                | ~ big_f(X2,Z) )
              & ( big_f(Y1,Z)
                | big_f(X2,Z) )
              & big_f(Y1,Y2) ) )
          & ( big_f(Y2,Z)
            | big_f(X2,Z)
            | ~ big_f(Y1,Y2) ) )
      & ? [X1] : big_f(X1,X2) ),
    inference(miniscoping,[status(thm)],[f4]) ).

fof(f6,plain,
    ( ! [Y1,Y2] :
        ( ( ( ( ~ big_f(Y2,sK2_skl(Y2,Y1))
              | ~ big_f(Y1,sK2_skl(Y2,Y1)) )
            & ( big_f(Y2,sK2_skl(Y2,Y1))
              | big_f(Y1,sK2_skl(Y2,Y1)) ) )
          | ~ big_f(Y1,Y2) )
        & ( big_f(sK2_skl(Y2,Y1),sK2_skl(Y2,Y1))
          | ( ( ~ big_f(Y1,sK2_skl(Y2,Y1))
              | ~ big_f(sK0_skl,sK2_skl(Y2,Y1)) )
            & ( big_f(Y1,sK2_skl(Y2,Y1))
              | big_f(sK0_skl,sK2_skl(Y2,Y1)) )
            & big_f(Y1,Y2) ) )
        & ( big_f(Y2,sK2_skl(Y2,Y1))
          | big_f(sK0_skl,sK2_skl(Y2,Y1))
          | ~ big_f(Y1,Y2) ) )
    & big_f(sK1_skl,sK0_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(X2,sK0_skl),skolemize(X1,sK1_skl),skolemize(Z,sK2_skl(Y2,Y1))],[f5]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( big_f(sK2_skl(X1,X0),sK2_skl(X1,X0))
      | big_f(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( big_f(X1,sK2_skl(X1,X0))
      | big_f(X0,sK2_skl(X1,X0))
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ big_f(X1,sK2_skl(X1,X0))
      | ~ big_f(X0,sK2_skl(X1,X0))
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( big_f(X1,X0)
      | big_f(sK2_skl(X0,X1),sK2_skl(sK2_skl(X0,X1),sK2_skl(X0,X1)))
      | big_f(sK2_skl(X0,X1),sK2_skl(sK2_skl(X0,X1),sK2_skl(X0,X1))) ),
    inference(resolution,[status(thm)],[f12,f9]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( big_f(X1,X0)
      | big_f(sK2_skl(X0,X1),sK2_skl(sK2_skl(X0,X1),sK2_skl(X0,X1))) ),
    inference(duplicate_literals_removal,[status(thm)],[f14]) ).

fof(f60,plain,
    ! [X0,X1] :
      ( ~ big_f(sK2_skl(X1,X0),sK2_skl(sK2_skl(X1,X0),sK2_skl(X1,X0)))
      | ~ big_f(sK2_skl(X1,X0),sK2_skl(X1,X0))
      | big_f(X0,X1) ),
    inference(resolution,[status(thm)],[f16,f13]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( ~ big_f(sK2_skl(X1,X0),sK2_skl(sK2_skl(X1,X0),sK2_skl(X1,X0)))
      | big_f(X0,X1) ),
    inference(forward_subsumption_resolution,[status(thm)],[f60,f9]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,sK2_skl(X1,X0))
      | ~ big_f(X0,X1) ),
    inference(backward_subsumption_resolution,[status(thm)],[f13,f65]) ).

fof(f65,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(forward_subsumption_resolution,[status(thm)],[f63,f16]) ).

fof(f66,plain,
    ! [X0,X1] : ~ big_f(X0,sK2_skl(X1,X0)),
    inference(forward_subsumption_resolution,[status(thm)],[f64,f65]) ).

fof(f67,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f66,f65]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN352+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40  % Computer : n011.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Mon Sep 21 10:51:11 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.41  % Drodi V4.1.1
% 0.17/0.42  % Refutation found
% 0.17/0.42  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.48  % Elapsed time: 0.073720 seconds
% 0.17/0.48  % CPU time: 0.071708 seconds
% 0.17/0.48  % Total memory used: 2.662 MB
% 0.17/0.48  % Net memory used: 2.611 MB
%------------------------------------------------------------------------------