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

% Computer : n018.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:58 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f100,axiom,
    ! [U,V] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | neq(V,U)
      | V = U ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f115,axiom,
    ! [U,V] :
      ( U != V
      | ~ neq(U,V)
      | ~ ssList(V)
      | ~ ssList(U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f186,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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,
    neq(sk2,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f199,negated_conjecture,
    ~ neq(sk1,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f200,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f208,plain,
    ssList(nil),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f303,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    inference(cnf_transformation,[status(esa)],[f100]) ).

fof(f321,plain,
    ! [U] :
      ( ! [V] :
          ( U != V
          | ~ neq(U,V)
          | ~ ssList(V) )
      | ~ ssList(U) ),
    inference(miniscoping,[status(esa)],[f115]) ).

fof(f322,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f321]) ).

fof(f431,plain,
    ssList(sk1),
    inference(cnf_transformation,[status(esa)],[f186]) ).

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

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

fof(f437,plain,
    neq(sk2,nil),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f446,plain,
    ~ neq(sk1,nil),
    inference(cnf_transformation,[status(esa)],[f199]) ).

fof(f447,plain,
    ( nil = sk4
    | nil != sk3 ),
    inference(cnf_transformation,[status(esa)],[f200]) ).

fof(f455,plain,
    ( spl0_2
  <=> nil = sk4 ),
    introduced(split_symbol_definition) ).

fof(f456,plain,
    ( nil = sk4
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f455]) ).

fof(f458,plain,
    ( spl0_3
  <=> nil = sk3 ),
    introduced(split_symbol_definition) ).

fof(f460,plain,
    ( nil != sk3
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f458]) ).

fof(f461,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f447,f455,f458]) ).

fof(f469,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(destructive_equality_resolution,[status(esa)],[f322]) ).

fof(f470,plain,
    ! [X0] :
      ( ~ neq(X0,X0)
      | ~ ssList(X0) ),
    inference(duplicate_literals_removal,[status(esa)],[f469]) ).

fof(f494,plain,
    ( nil != sk1
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f436,f460]) ).

fof(f526,plain,
    ( spl0_8
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f528,plain,
    ( ~ ssList(sk1)
    | spl0_8 ),
    inference(component_clause,[status(thm)],[f526]) ).

fof(f536,plain,
    ( $false
    | spl0_8 ),
    inference(forward_subsumption_resolution,[status(thm)],[f528,f431]) ).

fof(f537,plain,
    spl0_8,
    inference(contradiction_clause,[status(thm)],[f536]) ).

fof(f547,plain,
    ( spl0_10
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f549,plain,
    ( ~ ssList(nil)
    | spl0_10 ),
    inference(component_clause,[status(thm)],[f547]) ).

fof(f550,plain,
    ( spl0_11
  <=> sk1 = nil ),
    introduced(split_symbol_definition) ).

fof(f551,plain,
    ( sk1 = nil
    | ~ spl0_11 ),
    inference(component_clause,[status(thm)],[f550]) ).

fof(f553,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk1)
    | sk1 = nil ),
    inference(resolution,[status(thm)],[f303,f446]) ).

fof(f554,plain,
    ( ~ spl0_10
    | ~ spl0_8
    | spl0_11 ),
    inference(split_clause,[status(thm)],[f553,f547,f526,f550]) ).

fof(f555,plain,
    ( $false
    | spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f549,f208]) ).

fof(f556,plain,
    spl0_10,
    inference(contradiction_clause,[status(thm)],[f555]) ).

fof(f557,plain,
    ( $false
    | spl0_3
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[status(thm)],[f551,f494]) ).

fof(f558,plain,
    ( spl0_3
    | ~ spl0_11 ),
    inference(contradiction_clause,[status(thm)],[f557]) ).

fof(f559,plain,
    ( nil = sk2
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f435,f456]) ).

fof(f563,plain,
    ( neq(nil,nil)
    | ~ spl0_2 ),
    inference(backward_demodulation,[status(thm)],[f559,f437]) ).

fof(f591,plain,
    ( ~ ssList(nil)
    | ~ spl0_2 ),
    inference(resolution,[status(thm)],[f470,f563]) ).

fof(f592,plain,
    ( ~ spl0_10
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f591,f547,f455]) ).

fof(f593,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f461,f537,f554,f556,f558,f592]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC213-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n018.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:20:13 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  % Drodi V3.6.0
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41  % Elapsed time: 0.041021 seconds
% 0.13/0.41  % CPU time: 0.071832 seconds
% 0.13/0.41  % Total memory used: 14.513 MB
% 0.13/0.41  % Net memory used: 14.496 MB
%------------------------------------------------------------------------------