TSTP Solution File: SYN075+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SYN075+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:51:15 EDT 2024

% Result   : Theorem 0.11s 0.36s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   46 (   7 unt;   0 def)
%            Number of atoms       :  134 (  76 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  139 (  51   ~;  62   |;  16   &)
%                                         (   9 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   70 (  52   !;  18   ?)

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

fof(f2,conjecture,
    ? [W] :
    ! [Y] :
      ( ? [Z] :
        ! [X] :
          ( big_f(X,Y)
        <=> X = Z )
    <=> Y = W ),
    file('/export/starexec/sandbox2/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] :
      ( ( ~ big_f(X,Y)
        | ( X = Z
          & Y = W ) )
      & ( big_f(X,Y)
        | X != Z
        | Y != W ) ),
    inference(NNF_transformation,[status(esa)],[f1]) ).

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

fof(f6,plain,
    ( ! [X,Y] :
        ( ~ big_f(X,Y)
        | ( X = sk0_0
          & Y = sk0_1 ) )
    & ! [X,Y] :
        ( big_f(X,Y)
        | X != sk0_0
        | Y != sk0_1 ) ),
    inference(skolemization,[status(esa)],[f5]) ).

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

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

fof(f9,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | X0 != sk0_0
      | X1 != sk0_1 ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

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

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

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

fof(f13,plain,
    ! [W] :
      ( ( ( ! [X] :
              ( ~ big_f(X,sk0_2(W))
              | X = sk0_3(W) )
          & ! [X] :
              ( big_f(X,sk0_2(W))
              | X != sk0_3(W) ) )
        | sk0_2(W) = W )
      & ( ! [Z] :
            ( ( ~ big_f(sk0_4(Z,W),sk0_2(W))
              | sk0_4(Z,W) != Z )
            & ( big_f(sk0_4(Z,W),sk0_2(W))
              | sk0_4(Z,W) = Z ) )
        | sk0_2(W) != W ) ),
    inference(skolemization,[status(esa)],[f12]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( big_f(X0,sk0_2(X1))
      | X0 != sk0_3(X1)
      | sk0_2(X1) = X1 ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ big_f(sk0_4(X0,X1),sk0_2(X1))
      | sk0_4(X0,X1) != X0
      | sk0_2(X1) != X1 ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( big_f(sk0_4(X0,X1),sk0_2(X1))
      | sk0_4(X0,X1) = X0
      | sk0_2(X1) != X1 ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f18,plain,
    big_f(sk0_0,sk0_1),
    inference(destructive_equality_resolution,[status(esa)],[f9]) ).

fof(f19,plain,
    ! [X0] :
      ( big_f(sk0_3(X0),sk0_2(X0))
      | sk0_2(X0) = X0 ),
    inference(destructive_equality_resolution,[status(esa)],[f15]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( sk0_4(X0,X1) = sk0_0
      | sk0_4(X0,X1) = X0
      | sk0_2(X1) != X1 ),
    inference(resolution,[status(thm)],[f7,f17]) ).

fof(f21,plain,
    ! [X0] :
      ( sk0_3(X0) = sk0_0
      | sk0_2(X0) = X0 ),
    inference(resolution,[status(thm)],[f7,f19]) ).

fof(f22,plain,
    ! [X0] :
      ( big_f(sk0_0,sk0_2(X0))
      | sk0_2(X0) = X0
      | sk0_2(X0) = X0 ),
    inference(paramodulation,[status(thm)],[f21,f19]) ).

fof(f23,plain,
    ! [X0] :
      ( big_f(sk0_0,sk0_2(X0))
      | sk0_2(X0) = X0 ),
    inference(duplicate_literals_removal,[status(esa)],[f22]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( sk0_2(X0) != X0
      | X1 != sk0_0
      | sk0_4(X1,X0) = sk0_0 ),
    inference(equality_factoring,[status(esa)],[f20]) ).

fof(f35,plain,
    ! [X0] :
      ( sk0_2(X0) != X0
      | sk0_4(sk0_0,X0) = sk0_0 ),
    inference(destructive_equality_resolution,[status(esa)],[f34]) ).

fof(f36,plain,
    ! [X0] :
      ( sk0_2(X0) = sk0_1
      | sk0_2(X0) = X0 ),
    inference(resolution,[status(thm)],[f8,f23]) ).

fof(f39,plain,
    sk0_4(sk0_0,sk0_1) = sk0_0,
    inference(resolution,[status(thm)],[f36,f35]) ).

fof(f40,plain,
    ( spl0_2
  <=> sk0_2(sk0_1) = sk0_1 ),
    introduced(split_symbol_definition) ).

fof(f42,plain,
    ( sk0_2(sk0_1) != sk0_1
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f40]) ).

fof(f43,plain,
    ( spl0_3
  <=> sk0_4(sk0_0,sk0_1) = sk0_0 ),
    introduced(split_symbol_definition) ).

fof(f45,plain,
    ( sk0_4(sk0_0,sk0_1) != sk0_0
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f43]) ).

fof(f75,plain,
    ! [X0] :
      ( sk0_1 != X0
      | sk0_2(X0) = X0 ),
    inference(equality_factoring,[status(esa)],[f36]) ).

fof(f76,plain,
    sk0_2(sk0_1) = sk0_1,
    inference(destructive_equality_resolution,[status(esa)],[f75]) ).

fof(f118,plain,
    ( spl0_11
  <=> big_f(sk0_0,sk0_2(sk0_1)) ),
    introduced(split_symbol_definition) ).

fof(f120,plain,
    ( ~ big_f(sk0_0,sk0_2(sk0_1))
    | spl0_11 ),
    inference(component_clause,[status(thm)],[f118]) ).

fof(f123,plain,
    ( ~ big_f(sk0_0,sk0_2(sk0_1))
    | sk0_4(sk0_0,sk0_1) != sk0_0
    | sk0_2(sk0_1) != sk0_1 ),
    inference(paramodulation,[status(thm)],[f39,f16]) ).

fof(f124,plain,
    ( ~ spl0_11
    | ~ spl0_3
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f123,f118,f43,f40]) ).

fof(f125,plain,
    ( ~ big_f(sk0_0,sk0_1)
    | spl0_11 ),
    inference(forward_demodulation,[status(thm)],[f76,f120]) ).

fof(f126,plain,
    ( $false
    | spl0_11 ),
    inference(forward_subsumption_resolution,[status(thm)],[f125,f18]) ).

fof(f127,plain,
    spl0_11,
    inference(contradiction_clause,[status(thm)],[f126]) ).

fof(f128,plain,
    ( sk0_0 != sk0_0
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f39,f45]) ).

fof(f129,plain,
    ( $false
    | spl0_3 ),
    inference(trivial_equality_resolution,[status(esa)],[f128]) ).

fof(f130,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f129]) ).

fof(f132,plain,
    ( sk0_1 != sk0_1
    | spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f76,f42]) ).

fof(f133,plain,
    ( $false
    | spl0_2 ),
    inference(trivial_equality_resolution,[status(esa)],[f132]) ).

fof(f134,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f133]) ).

fof(f135,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f124,f127,f130,f134]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN075+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.34  % Computer : n027.cluster.edu
% 0.11/0.34  % Model    : x86_64 x86_64
% 0.11/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34  % Memory   : 8042.1875MB
% 0.11/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34  % CPULimit : 300
% 0.11/0.34  % WCLimit  : 300
% 0.11/0.34  % DateTime : Mon Apr 29 22:32:32 EDT 2024
% 0.11/0.34  % CPUTime  : 
% 0.11/0.35  % Drodi V3.6.0
% 0.11/0.36  % Refutation found
% 0.11/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.38  % Elapsed time: 0.021833 seconds
% 0.11/0.38  % CPU time: 0.025800 seconds
% 0.11/0.38  % Total memory used: 9.449 MB
% 0.11/0.38  % Net memory used: 9.343 MB
%------------------------------------------------------------------------------