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

% Computer : n020.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:57 EDT 2024

% Result   : Unsatisfiable 0.21s 0.37s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   57 (  15 unt;   0 def)
%            Number of atoms       :  120 (  30 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  122 (  59   ~;  56   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   8 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (  18   !;   0   ?)

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

fof(f98,axiom,
    ! [U,V] :
      ( cons(U,V) != nil
      | ~ ssItem(U)
      | ~ ssList(V) ),
    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,
    ( ssItem(sk5)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f300,plain,
    ! [V] :
      ( ! [U] :
          ( cons(U,V) != nil
          | ~ ssItem(U) )
      | ~ ssList(V) ),
    inference(miniscoping,[status(esa)],[f98]) ).

fof(f301,plain,
    ! [X0,X1] :
      ( cons(X0,X1) != nil
      | ~ ssItem(X0)
      | ~ ssList(X1) ),
    inference(cnf_transformation,[status(esa)],[f300]) ).

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

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

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

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

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

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

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

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

fof(f440,plain,
    ( ssItem(sk5)
    | nil = sk4 ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f442,plain,
    ( cons(sk5,nil) = sk3
    | nil = sk4 ),
    inference(cnf_transformation,[status(esa)],[f196]) ).

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

fof(f460,plain,
    ( spl0_3
  <=> nil = sk4 ),
    introduced(split_symbol_definition) ).

fof(f461,plain,
    ( nil = sk4
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f460]) ).

fof(f463,plain,
    ( spl0_2
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f440,f457,f460]) ).

fof(f464,plain,
    ( spl0_4
  <=> nil = sk3 ),
    introduced(split_symbol_definition) ).

fof(f466,plain,
    ( nil != sk3
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f464]) ).

fof(f468,plain,
    ( spl0_5
  <=> cons(sk5,nil) = sk3 ),
    introduced(split_symbol_definition) ).

fof(f469,plain,
    ( cons(sk5,nil) = sk3
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f468]) ).

fof(f471,plain,
    ( spl0_5
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f442,f468,f460]) ).

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

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

fof(f514,plain,
    ( spl0_8
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f516,plain,
    ( ~ ssList(nil)
    | spl0_8 ),
    inference(component_clause,[status(thm)],[f514]) ).

fof(f517,plain,
    ( spl0_9
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f519,plain,
    ( ~ ssList(sk1)
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f517]) ).

fof(f520,plain,
    ( spl0_10
  <=> sk1 = nil ),
    introduced(split_symbol_definition) ).

fof(f521,plain,
    ( sk1 = nil
    | ~ spl0_10 ),
    inference(component_clause,[status(thm)],[f520]) ).

fof(f523,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk1)
    | sk1 = nil ),
    inference(resolution,[status(thm)],[f304,f439]) ).

fof(f524,plain,
    ( ~ spl0_8
    | ~ spl0_9
    | spl0_10 ),
    inference(split_clause,[status(thm)],[f523,f514,f517,f520]) ).

fof(f525,plain,
    ( $false
    | spl0_9 ),
    inference(forward_subsumption_resolution,[status(thm)],[f519,f432]) ).

fof(f526,plain,
    spl0_9,
    inference(contradiction_clause,[status(thm)],[f525]) ).

fof(f527,plain,
    ( $false
    | spl0_8 ),
    inference(forward_subsumption_resolution,[status(thm)],[f516,f209]) ).

fof(f528,plain,
    spl0_8,
    inference(contradiction_clause,[status(thm)],[f527]) ).

fof(f541,plain,
    ( nil = sk2
    | ~ spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f436,f461]) ).

fof(f542,plain,
    ( neq(nil,nil)
    | ~ spl0_3 ),
    inference(backward_demodulation,[status(thm)],[f541,f438]) ).

fof(f552,plain,
    ( sk3 != nil
    | ~ ssItem(sk5)
    | ~ ssList(nil)
    | ~ spl0_5 ),
    inference(paramodulation,[status(thm)],[f469,f301]) ).

fof(f553,plain,
    ( ~ spl0_4
    | ~ spl0_2
    | ~ spl0_8
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f552,f464,f457,f514,f468]) ).

fof(f562,plain,
    ( ~ ssList(nil)
    | ~ spl0_3 ),
    inference(resolution,[status(thm)],[f542,f491]) ).

fof(f563,plain,
    ( ~ spl0_8
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f562,f514,f460]) ).

fof(f611,plain,
    ( nil = sk3
    | ~ spl0_10 ),
    inference(forward_demodulation,[status(thm)],[f521,f437]) ).

fof(f612,plain,
    ( $false
    | spl0_4
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f611,f466]) ).

fof(f613,plain,
    ( spl0_4
    | ~ spl0_10 ),
    inference(contradiction_clause,[status(thm)],[f612]) ).

fof(f614,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f463,f471,f524,f526,f528,f553,f563,f613]) ).

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