↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.15s 5.40s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   35 (   5 unt;   0 def)
%            Number of atoms       :  110 (  70 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  120 (  45   ~;  52   |;  16   &)
%                                         (   6 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   69 (  51   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ? [Z,W] :
    ! [X,Y] :
      ( big_f(X,Y)
    <=> ( Y = W
        & X = Z ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,conjecture,
    ? [W] :
    ! [Y] :
      ( ? [Z] :
        ! [X] :
          ( big_f(X,Y)
        <=> X = Z )
    <=> Y = W ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    ~ ? [W] :
      ! [Y] :
        ( ? [Z] :
          ! [X] :
            ( big_f(X,Y)
          <=> X = Z )
      <=> Y = W ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

fof(f4,plain,
    ? [Z,W] :
    ! [X,Y] :
      ( ( Y != W
        | X != Z
        | big_f(X,Y) )
      & ( ( Y = W
          & X = Z )
        | ~ big_f(X,Y) ) ),
    inference(NNF_transformation,[status(thm)],[f1]) ).

fof(f5,plain,
    ? [Z,W] :
      ( ! [X,Y] :
          ( Y != W
          | X != Z
          | big_f(X,Y) )
      & ! [X,Y] :
          ( ( Y = W
            & X = Z )
          | ~ big_f(X,Y) ) ),
    inference(miniscoping,[status(thm)],[f4]) ).

fof(f6,plain,
    ( ! [X,Y] :
        ( Y != sK1_skl
        | X != sK0_skl
        | big_f(X,Y) )
    & ! [X,Y] :
        ( ( Y = sK1_skl
          & X = sK0_skl )
        | ~ big_f(X,Y) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Z,sK0_skl),skolemize(W,sK1_skl)],[f5]) ).

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

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

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

fof(f10,plain,
    ! [W] :
    ? [Y] :
      ( ? [Z] :
        ! [X] :
          ( big_f(X,Y)
        <=> X = Z )
    <~> Y = W ),
    inference(pre_NNF_transformation,[status(thm)],[f3]) ).

fof(f11,plain,
    ! [W] :
    ? [Y] :
      ( ( Y != W
        | ! [Z] :
          ? [X] :
            ( ( X = Z
              | big_f(X,Y) )
            & ( X != Z
              | ~ big_f(X,Y) ) ) )
      & ( Y = W
        | ? [Z] :
          ! [X] :
            ( ( X != Z
              | big_f(X,Y) )
            & ( X = Z
              | ~ big_f(X,Y) ) ) ) ),
    inference(NNF_transformation,[status(thm)],[f10]) ).

fof(f12,plain,
    ! [W] :
    ? [Y] :
      ( ( Y != W
        | ! [Z] :
          ? [X] :
            ( ( X = Z
              | big_f(X,Y) )
            & ( X != Z
              | ~ big_f(X,Y) ) ) )
      & ( Y = W
        | ? [Z] :
            ( ! [X] :
                ( X != Z
                | big_f(X,Y) )
            & ! [X] :
                ( X = Z
                | ~ big_f(X,Y) ) ) ) ),
    inference(miniscoping,[status(thm)],[f11]) ).

fof(f13,plain,
    ! [W] :
      ( ( sK2_skl(W) != W
        | ! [Z] :
            ( ( sK4_skl(Z,W) = Z
              | big_f(sK4_skl(Z,W),sK2_skl(W)) )
            & ( sK4_skl(Z,W) != Z
              | ~ big_f(sK4_skl(Z,W),sK2_skl(W)) ) ) )
      & ( sK2_skl(W) = W
        | ( ! [X] :
              ( X != sK3_skl(W)
              | big_f(X,sK2_skl(W)) )
          & ! [X] :
              ( X = sK3_skl(W)
              | ~ big_f(X,sK2_skl(W)) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl,sK4_skl]),skolemize(Y,sK2_skl(W)),skolemize(Z,sK3_skl(W)),skolemize(X,sK4_skl(Z,W))],[f12]) ).

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

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

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

fof(f18,plain,
    big_f(sK0_skl,sK1_skl),
    inference(destructive_equality_resolution,[status(thm)],[f9]) ).

fof(f19,plain,
    ! [X0] :
      ( sK2_skl(X0) = X0
      | big_f(sK3_skl(X0),sK2_skl(X0)) ),
    inference(destructive_equality_resolution,[status(thm)],[f15]) ).

fof(f22,plain,
    ! [X0] :
      ( sK2_skl(X0) = X0
      | sK3_skl(X0) = sK0_skl ),
    inference(resolution,[status(thm)],[f7,f19]) ).

fof(f23,plain,
    ! [X0] :
      ( sK2_skl(X0) = X0
      | sK2_skl(X0) = X0
      | big_f(sK0_skl,sK2_skl(X0)) ),
    inference(paramodulation,[status(thm)],[f22,f19]) ).

fof(f24,plain,
    ! [X0] :
      ( sK2_skl(X0) = X0
      | big_f(sK0_skl,sK2_skl(X0)) ),
    inference(duplicate_literals_removal,[status(thm)],[f23]) ).

fof(f28,plain,
    ! [X0] :
      ( sK2_skl(X0) = X0
      | sK2_skl(X0) = sK1_skl ),
    inference(resolution,[status(thm)],[f8,f24]) ).

fof(f31,plain,
    ! [X0] :
      ( sK4_skl(X0,sK1_skl) = X0
      | big_f(sK4_skl(X0,sK1_skl),sK2_skl(sK1_skl)) ),
    inference(resolution,[status(thm)],[f28,f17]) ).

fof(f38,plain,
    ! [X0] :
      ( sK2_skl(X0) = X0
      | sK1_skl != X0 ),
    inference(equality_factoring,[status(thm)],[f28]) ).

fof(f47,plain,
    sK2_skl(sK1_skl) = sK1_skl,
    inference(destructive_equality_resolution,[status(thm)],[f38]) ).

fof(f58,plain,
    ! [X0] :
      ( sK4_skl(X0,sK1_skl) = X0
      | big_f(sK4_skl(X0,sK1_skl),sK1_skl) ),
    inference(forward_demodulation,[status(thm)],[f47,f31]) ).

fof(f60,plain,
    ! [X0] :
      ( sK4_skl(X0,sK1_skl) = sK0_skl
      | sK4_skl(X0,sK1_skl) = X0 ),
    inference(resolution,[status(thm)],[f58,f7]) ).

fof(f80,plain,
    ! [X0] :
      ( sK4_skl(X0,sK1_skl) = sK0_skl
      | X0 != sK0_skl ),
    inference(equality_factoring,[status(thm)],[f60]) ).

fof(f94,plain,
    sK4_skl(sK0_skl,sK1_skl) = sK0_skl,
    inference(destructive_equality_resolution,[status(thm)],[f80]) ).

fof(f95,plain,
    ( sK2_skl(sK1_skl) != sK1_skl
    | ~ big_f(sK4_skl(sK0_skl,sK1_skl),sK2_skl(sK1_skl)) ),
    inference(resolution,[status(thm)],[f94,f16]) ).

fof(f102,plain,
    ( sK2_skl(sK1_skl) != sK1_skl
    | ~ big_f(sK0_skl,sK2_skl(sK1_skl)) ),
    inference(forward_demodulation,[status(thm)],[f94,f95]) ).

fof(f103,plain,
    ( sK2_skl(sK1_skl) != sK1_skl
    | ~ big_f(sK0_skl,sK1_skl) ),
    inference(forward_demodulation,[status(thm)],[f47,f102]) ).

fof(f104,plain,
    ( sK1_skl != sK1_skl
    | ~ big_f(sK0_skl,sK1_skl) ),
    inference(forward_demodulation,[status(thm)],[f47,f103]) ).

fof(f105,plain,
    ~ big_f(sK0_skl,sK1_skl),
    inference(trivial_equality_resolution,[status(thm)],[f104]) ).

fof(f106,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f105,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN075+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.37  % Computer : n015.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Mon Sep 21 10:45:28 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.38  % Drodi V4.1.1
% 0.15/5.40  % Refutation found
% 0.15/5.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/5.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/5.42  % Elapsed time: 0.044159 seconds
% 0.15/5.42  % CPU time: 0.129123 seconds
% 0.15/5.42  % Total memory used: 62.470 MB
% 0.15/5.42  % Net memory used: 62.083 MB
%------------------------------------------------------------------------------