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

% Computer : n028.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 : Wed May 31 12:39:41 EDT 2023

% Result   : Unsatisfiable 0.14s 0.32s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   47 (  15 unt;   0 def)
%            Number of atoms       :   95 (  18 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   95 (  47   ~;  43   |;   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/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f190,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f192,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f194,negated_conjecture,
    ( nil = sk4
    | neq(sk3,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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,
    neq(sk2,nil),
    inference(cnf_transformation,[status(esa)],[f192]) ).

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

fof(f436,plain,
    ( nil = sk4
    | neq(sk3,nil) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

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

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

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

fof(f451,plain,
    ( neq(sk3,nil)
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f450]) ).

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

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

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

fof(f494,plain,
    ( spl0_6
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f496,plain,
    ( ~ ssList(nil)
    | spl0_6 ),
    inference(component_clause,[status(thm)],[f494]) ).

fof(f504,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f496,f205]) ).

fof(f505,plain,
    spl0_6,
    inference(contradiction_clause,[status(thm)],[f504]) ).

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

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

fof(f509,plain,
    ( spl0_9
  <=> sk1 = nil ),
    introduced(split_symbol_definition) ).

fof(f510,plain,
    ( sk1 = nil
    | ~ spl0_9 ),
    inference(component_clause,[status(thm)],[f509]) ).

fof(f512,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk1)
    | sk1 = nil ),
    inference(resolution,[status(thm)],[f300,f435]) ).

fof(f513,plain,
    ( ~ spl0_6
    | ~ spl0_8
    | spl0_9 ),
    inference(split_clause,[status(thm)],[f512,f494,f506,f509]) ).

fof(f514,plain,
    ( $false
    | spl0_8 ),
    inference(forward_subsumption_resolution,[status(thm)],[f508,f428]) ).

fof(f515,plain,
    spl0_8,
    inference(contradiction_clause,[status(thm)],[f514]) ).

fof(f528,plain,
    ( nil = sk2
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f432,f448]) ).

fof(f529,plain,
    ( neq(nil,nil)
    | ~ spl0_2 ),
    inference(backward_demodulation,[status(thm)],[f528,f434]) ).

fof(f543,plain,
    ( nil = sk3
    | ~ spl0_9 ),
    inference(forward_demodulation,[status(thm)],[f510,f433]) ).

fof(f545,plain,
    ( neq(nil,nil)
    | ~ spl0_9
    | ~ spl0_3 ),
    inference(backward_demodulation,[status(thm)],[f543,f451]) ).

fof(f547,plain,
    ( ~ ssList(nil)
    | ~ spl0_9
    | ~ spl0_3 ),
    inference(resolution,[status(thm)],[f545,f471]) ).

fof(f548,plain,
    ( ~ spl0_6
    | ~ spl0_9
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f547,f494,f509,f450]) ).

fof(f556,plain,
    ( ~ ssList(nil)
    | ~ spl0_2 ),
    inference(resolution,[status(thm)],[f529,f471]) ).

fof(f557,plain,
    ( ~ spl0_6
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f556,f494,f447]) ).

fof(f558,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f453,f505,f513,f515,f548,f557]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10  % Problem  : SWC209-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30  % Computer : n028.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Tue May 30 11:35:02 EDT 2023
% 0.09/0.31  % CPUTime  : 
% 0.14/0.32  % Drodi V3.5.1
% 0.14/0.32  % Refutation found
% 0.14/0.32  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.32  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.57  % Elapsed time: 0.047316 seconds
% 0.15/0.57  % CPU time: 0.020683 seconds
% 0.15/0.57  % Memory used: 4.050 MB
%------------------------------------------------------------------------------