TSTP Solution File: SWC001-1 by Drodi---3.6.0

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

% Computer : n008.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:44:06 EDT 2024

% Result   : Unsatisfiable 0.13s 0.35s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   38 (   9 unt;   0 def)
%            Number of atoms       :   85 (   4 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   89 (  42   ~;  43   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    8 (   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f190,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f191,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    duplicatefreeP(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f193,negated_conjecture,
    ! [A] :
      ( ~ ssItem(A)
      | memberP(sk4,A)
      | ~ memberP(sk3,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f194,negated_conjecture,
    ! [A] :
      ( ~ ssItem(A)
      | memberP(sk3,A)
      | ~ memberP(sk4,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    ( ssItem(sk5)
    | ~ duplicatefreeP(sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f196,negated_conjecture,
    ( memberP(sk2,sk5)
    | memberP(sk1,sk5)
    | ~ duplicatefreeP(sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f197,negated_conjecture,
    ( ~ memberP(sk2,sk5)
    | ~ memberP(sk1,sk5)
    | ~ duplicatefreeP(sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f432,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(esa)],[f190]) ).

fof(f433,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(esa)],[f191]) ).

fof(f434,plain,
    duplicatefreeP(sk3),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f435,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | memberP(sk4,X0)
      | ~ memberP(sk3,X0) ),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f436,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | memberP(sk3,X0)
      | ~ memberP(sk4,X0) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f437,plain,
    ( ssItem(sk5)
    | ~ duplicatefreeP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f195]) ).

fof(f438,plain,
    ( memberP(sk2,sk5)
    | memberP(sk1,sk5)
    | ~ duplicatefreeP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f196]) ).

fof(f439,plain,
    ( ~ memberP(sk2,sk5)
    | ~ memberP(sk1,sk5)
    | ~ duplicatefreeP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f197]) ).

fof(f447,plain,
    ( spl0_2
  <=> ssItem(sk5) ),
    introduced(split_symbol_definition) ).

fof(f450,plain,
    ( spl0_3
  <=> duplicatefreeP(sk1) ),
    introduced(split_symbol_definition) ).

fof(f452,plain,
    ( ~ duplicatefreeP(sk1)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f450]) ).

fof(f453,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f437,f447,f450]) ).

fof(f454,plain,
    ( spl0_4
  <=> memberP(sk2,sk5) ),
    introduced(split_symbol_definition) ).

fof(f455,plain,
    ( memberP(sk2,sk5)
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f454]) ).

fof(f457,plain,
    ( spl0_5
  <=> memberP(sk1,sk5) ),
    introduced(split_symbol_definition) ).

fof(f458,plain,
    ( memberP(sk1,sk5)
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f457]) ).

fof(f460,plain,
    ( spl0_4
    | spl0_5
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f438,f454,f457,f450]) ).

fof(f461,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f439,f454,f457,f450]) ).

fof(f493,plain,
    duplicatefreeP(sk1),
    inference(forward_demodulation,[status(thm)],[f433,f434]) ).

fof(f494,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | memberP(sk2,X0)
      | ~ memberP(sk3,X0) ),
    inference(forward_demodulation,[status(thm)],[f432,f435]) ).

fof(f495,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | memberP(sk2,X0)
      | ~ memberP(sk1,X0) ),
    inference(forward_demodulation,[status(thm)],[f433,f494]) ).

fof(f496,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | memberP(sk1,X0)
      | ~ memberP(sk4,X0) ),
    inference(forward_demodulation,[status(thm)],[f433,f436]) ).

fof(f497,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | memberP(sk1,X0)
      | ~ memberP(sk2,X0) ),
    inference(forward_demodulation,[status(thm)],[f432,f496]) ).

fof(f498,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f452,f493]) ).

fof(f499,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f498]) ).

fof(f500,plain,
    ( ~ ssItem(sk5)
    | memberP(sk1,sk5)
    | ~ spl0_4 ),
    inference(resolution,[status(thm)],[f455,f497]) ).

fof(f501,plain,
    ( ~ spl0_2
    | spl0_5
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f500,f447,f457,f454]) ).

fof(f502,plain,
    ( ~ ssItem(sk5)
    | memberP(sk2,sk5)
    | ~ spl0_5 ),
    inference(resolution,[status(thm)],[f458,f495]) ).

fof(f503,plain,
    ( ~ spl0_2
    | spl0_4
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f502,f447,f454,f457]) ).

fof(f504,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f453,f460,f461,f499,f501,f503]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC001-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr 30 00:02:27 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 0.13/0.35  % Refutation found
% 0.13/0.35  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37  % Elapsed time: 0.024652 seconds
% 0.13/0.37  % CPU time: 0.037578 seconds
% 0.13/0.37  % Total memory used: 14.278 MB
% 0.13/0.37  % Net memory used: 14.258 MB
%------------------------------------------------------------------------------