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

View Problem - Process Solution

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

% Computer : n024.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:28 EDT 2024

% Result   : Unsatisfiable 0.13s 0.35s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   63 (  16 unt;   0 def)
%            Number of atoms       :  126 (  14 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  119 (  56   ~;  55   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   9 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(f57,axiom,
    ! [U] :
      ( ~ ssList(U)
      | segmentP(U,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(f187,negated_conjecture,
    ssList(sk2),
    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,
    ! [A] :
      ( ~ ssList(A)
      | ~ neq(A,nil)
      | ~ segmentP(sk2,A)
      | ~ segmentP(sk1,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f254,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | segmentP(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f57]) ).

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(f429,plain,
    ssList(sk2),
    inference(cnf_transformation,[status(esa)],[f187]) ).

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,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ segmentP(sk2,X0)
      | ~ segmentP(sk1,X0) ),
    inference(cnf_transformation,[status(esa)],[f193]) ).

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

fof(f437,plain,
    ( nil = sk4
    | segmentP(sk4,sk3) ),
    inference(cnf_transformation,[status(esa)],[f195]) ).

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(f454,plain,
    ( spl0_4
  <=> segmentP(sk4,sk3) ),
    introduced(split_symbol_definition) ).

fof(f455,plain,
    ( segmentP(sk4,sk3)
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f454]) ).

fof(f457,plain,
    ( spl0_2
    | spl0_4 ),
    inference(split_clause,[status(thm)],[f437,f447,f454]) ).

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(f515,plain,
    ( nil = sk2
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f432,f448]) ).

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

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

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

fof(f541,plain,
    ( segmentP(sk4,sk1)
    | ~ spl0_4 ),
    inference(backward_demodulation,[status(thm)],[f433,f455]) ).

fof(f542,plain,
    ( neq(sk1,nil)
    | ~ spl0_3 ),
    inference(backward_demodulation,[status(thm)],[f433,f451]) ).

fof(f546,plain,
    ( spl0_14
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f548,plain,
    ( ~ ssList(sk1)
    | spl0_14 ),
    inference(component_clause,[status(thm)],[f546]) ).

fof(f555,plain,
    ( $false
    | spl0_14 ),
    inference(forward_subsumption_resolution,[status(thm)],[f428,f548]) ).

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

fof(f561,plain,
    ( segmentP(sk2,sk1)
    | ~ spl0_4 ),
    inference(backward_demodulation,[status(thm)],[f432,f541]) ).

fof(f566,plain,
    ( spl0_17
  <=> ssList(sk2) ),
    introduced(split_symbol_definition) ).

fof(f568,plain,
    ( ~ ssList(sk2)
    | spl0_17 ),
    inference(component_clause,[status(thm)],[f566]) ).

fof(f574,plain,
    ( $false
    | spl0_17 ),
    inference(forward_subsumption_resolution,[status(thm)],[f429,f568]) ).

fof(f575,plain,
    spl0_17,
    inference(contradiction_clause,[status(thm)],[f574]) ).

fof(f577,plain,
    ( spl0_19
  <=> segmentP(sk2,sk1) ),
    introduced(split_symbol_definition) ).

fof(f579,plain,
    ( ~ segmentP(sk2,sk1)
    | spl0_19 ),
    inference(component_clause,[status(thm)],[f577]) ).

fof(f580,plain,
    ( spl0_20
  <=> segmentP(sk1,sk1) ),
    introduced(split_symbol_definition) ).

fof(f582,plain,
    ( ~ segmentP(sk1,sk1)
    | spl0_20 ),
    inference(component_clause,[status(thm)],[f580]) ).

fof(f583,plain,
    ( ~ ssList(sk1)
    | ~ segmentP(sk2,sk1)
    | ~ segmentP(sk1,sk1)
    | ~ spl0_3 ),
    inference(resolution,[status(thm)],[f435,f542]) ).

fof(f584,plain,
    ( ~ spl0_14
    | ~ spl0_19
    | ~ spl0_20
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f583,f546,f577,f580,f450]) ).

fof(f598,plain,
    ( $false
    | ~ spl0_4
    | spl0_19 ),
    inference(forward_subsumption_resolution,[status(thm)],[f579,f561]) ).

fof(f599,plain,
    ( ~ spl0_4
    | spl0_19 ),
    inference(contradiction_clause,[status(thm)],[f598]) ).

fof(f601,plain,
    ( ~ ssList(sk1)
    | spl0_20 ),
    inference(resolution,[status(thm)],[f582,f254]) ).

fof(f602,plain,
    ( ~ spl0_14
    | spl0_20 ),
    inference(split_clause,[status(thm)],[f601,f546,f580]) ).

fof(f603,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f453,f457,f505,f521,f556,f575,f584,f599,f602]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC086-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Apr 30 00:01:36 EDT 2024
% 0.13/0.33  % 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.026391 seconds
% 0.13/0.37  % CPU time: 0.044522 seconds
% 0.13/0.37  % Total memory used: 14.347 MB
% 0.13/0.37  % Net memory used: 14.324 MB
%------------------------------------------------------------------------------