TSTP Solution File: SWC348-1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n029.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:40:08 EDT 2023

% Result   : Unsatisfiable 28.40s 4.01s
% Output   : CNFRefutation 28.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   83 (  23 unt;   0 def)
%            Number of atoms       :  171 (  21 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  157 (  69   ~;  77   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   19 (  17 usr;  12 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   18 (;  18   !;   0   ?)

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

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

fof(f47,axiom,
    ! [U] : ssItem(skaf44(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f56,axiom,
    ! [U] :
      ( ~ ssList(U)
      | segmentP(U,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f66,axiom,
    ! [U] :
      ( ~ ssItem(U)
      | strictorderedP(cons(U,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(f101,axiom,
    ! [U] :
      ( ~ singletonP(U)
      | ~ ssList(U)
      | cons(skaf44(U),nil) = U ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f194,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ strictorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f197,plain,
    strictorderedP(nil),
    inference(cnf_transformation,[status(esa)],[f3]) ).

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

fof(f241,plain,
    ! [X0] : ssItem(skaf44(X0)),
    inference(cnf_transformation,[status(esa)],[f47]) ).

fof(f250,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | segmentP(X0,nil) ),
    inference(cnf_transformation,[status(esa)],[f56]) ).

fof(f260,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | strictorderedP(cons(X0,nil)) ),
    inference(cnf_transformation,[status(esa)],[f66]) ).

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

fof(f298,plain,
    ! [X0] :
      ( ~ singletonP(X0)
      | ~ ssList(X0)
      | cons(skaf44(X0),nil) = X0 ),
    inference(cnf_transformation,[status(esa)],[f101]) ).

fof(f334,plain,
    ! [X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ segmentP(X1,X0)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | X1 = X0 ),
    inference(cnf_transformation,[status(esa)],[f127]) ).

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

fof(f426,plain,
    ssList(sk2),
    inference(cnf_transformation,[status(esa)],[f187]) ).

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

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

fof(f431,plain,
    segmentP(sk4,sk3),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f432,plain,
    ( singletonP(sk3)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f433,plain,
    ( ~ segmentP(sk2,sk1)
    | ~ strictorderedP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f441,plain,
    ( spl0_2
  <=> singletonP(sk3) ),
    introduced(split_symbol_definition) ).

fof(f442,plain,
    ( singletonP(sk3)
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f441]) ).

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

fof(f446,plain,
    ( ~ neq(sk4,nil)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f444]) ).

fof(f447,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f432,f441,f444]) ).

fof(f448,plain,
    ( spl0_4
  <=> segmentP(sk2,sk1) ),
    introduced(split_symbol_definition) ).

fof(f450,plain,
    ( ~ segmentP(sk2,sk1)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f448]) ).

fof(f451,plain,
    ( spl0_5
  <=> strictorderedP(sk1) ),
    introduced(split_symbol_definition) ).

fof(f453,plain,
    ( ~ strictorderedP(sk1)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f451]) ).

fof(f454,plain,
    ( ~ spl0_4
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f433,f448,f451]) ).

fof(f486,plain,
    segmentP(sk2,sk3),
    inference(forward_demodulation,[status(thm)],[f429,f431]) ).

fof(f487,plain,
    segmentP(sk2,sk1),
    inference(forward_demodulation,[status(thm)],[f430,f486]) ).

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

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

fof(f498,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f490,f202]) ).

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

fof(f518,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f450,f487]) ).

fof(f519,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f518]) ).

fof(f520,plain,
    ( ~ neq(sk2,nil)
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f429,f446]) ).

fof(f526,plain,
    ! [X0] :
      ( ~ segmentP(X0,sk1)
      | ~ segmentP(sk1,X0)
      | ~ ssList(X0)
      | sk1 = X0 ),
    inference(resolution,[status(thm)],[f334,f425]) ).

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

fof(f546,plain,
    ( ~ segmentP(nil,sk1)
    | spl0_11 ),
    inference(component_clause,[status(thm)],[f544]) ).

fof(f547,plain,
    ( spl0_12
  <=> sk1 = nil ),
    introduced(split_symbol_definition) ).

fof(f548,plain,
    ( sk1 = nil
    | ~ spl0_12 ),
    inference(component_clause,[status(thm)],[f547]) ).

fof(f550,plain,
    ( spl0_13
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f552,plain,
    ( ~ ssList(sk1)
    | spl0_13 ),
    inference(component_clause,[status(thm)],[f550]) ).

fof(f553,plain,
    ( ~ segmentP(nil,sk1)
    | ~ ssList(nil)
    | sk1 = nil
    | ~ ssList(sk1) ),
    inference(resolution,[status(thm)],[f526,f250]) ).

fof(f554,plain,
    ( ~ spl0_11
    | ~ spl0_6
    | spl0_12
    | ~ spl0_13 ),
    inference(split_clause,[status(thm)],[f553,f544,f488,f547,f550]) ).

fof(f566,plain,
    ( $false
    | spl0_13 ),
    inference(forward_subsumption_resolution,[status(thm)],[f552,f425]) ).

fof(f567,plain,
    spl0_13,
    inference(contradiction_clause,[status(thm)],[f566]) ).

fof(f597,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | neq(sk2,X0)
      | sk2 = X0 ),
    inference(resolution,[status(thm)],[f297,f426]) ).

fof(f599,plain,
    ( spl0_19
  <=> sk2 = nil ),
    introduced(split_symbol_definition) ).

fof(f600,plain,
    ( sk2 = nil
    | ~ spl0_19 ),
    inference(component_clause,[status(thm)],[f599]) ).

fof(f602,plain,
    ( ~ ssList(nil)
    | sk2 = nil
    | spl0_3 ),
    inference(resolution,[status(thm)],[f597,f520]) ).

fof(f603,plain,
    ( ~ spl0_6
    | spl0_19
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f602,f488,f599,f444]) ).

fof(f606,plain,
    ( singletonP(sk1)
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f430,f442]) ).

fof(f625,plain,
    ( segmentP(nil,sk1)
    | ~ spl0_19 ),
    inference(backward_demodulation,[status(thm)],[f600,f487]) ).

fof(f626,plain,
    ( $false
    | spl0_11
    | ~ spl0_19 ),
    inference(forward_subsumption_resolution,[status(thm)],[f625,f546]) ).

fof(f627,plain,
    ( spl0_11
    | ~ spl0_19 ),
    inference(contradiction_clause,[status(thm)],[f626]) ).

fof(f820,plain,
    ( ~ strictorderedP(nil)
    | ~ spl0_12
    | spl0_5 ),
    inference(backward_demodulation,[status(thm)],[f548,f453]) ).

fof(f821,plain,
    ( $false
    | ~ spl0_12
    | spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f820,f197]) ).

fof(f822,plain,
    ( ~ spl0_12
    | spl0_5 ),
    inference(contradiction_clause,[status(thm)],[f821]) ).

fof(f8613,plain,
    ( spl0_338
  <=> cons(skaf44(sk1),nil) = sk1 ),
    introduced(split_symbol_definition) ).

fof(f8614,plain,
    ( cons(skaf44(sk1),nil) = sk1
    | ~ spl0_338 ),
    inference(component_clause,[status(thm)],[f8613]) ).

fof(f8616,plain,
    ( ~ ssList(sk1)
    | cons(skaf44(sk1),nil) = sk1
    | ~ spl0_2 ),
    inference(resolution,[status(thm)],[f298,f606]) ).

fof(f8617,plain,
    ( ~ spl0_13
    | spl0_338
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f8616,f550,f8613,f441]) ).

fof(f8755,plain,
    ( spl0_346
  <=> ssItem(skaf44(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f8757,plain,
    ( ~ ssItem(skaf44(sk1))
    | spl0_346 ),
    inference(component_clause,[status(thm)],[f8755]) ).

fof(f8796,plain,
    ( ~ ssItem(skaf44(sk1))
    | strictorderedP(sk1)
    | ~ spl0_338 ),
    inference(paramodulation,[status(thm)],[f8614,f260]) ).

fof(f8797,plain,
    ( ~ spl0_346
    | spl0_5
    | ~ spl0_338 ),
    inference(split_clause,[status(thm)],[f8796,f8755,f451,f8613]) ).

fof(f8815,plain,
    ( $false
    | spl0_346 ),
    inference(forward_subsumption_resolution,[status(thm)],[f8757,f241]) ).

fof(f8816,plain,
    spl0_346,
    inference(contradiction_clause,[status(thm)],[f8815]) ).

fof(f8817,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f447,f454,f499,f519,f554,f567,f603,f627,f822,f8617,f8797,f8816]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC348-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 : n029.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 May 30 11:36:22 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 28.40/4.01  % Refutation found
% 28.40/4.01  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 28.40/4.01  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 29.11/4.06  % Elapsed time: 3.712953 seconds
% 29.11/4.06  % CPU time: 29.180395 seconds
% 29.11/4.06  % Memory used: 160.974 MB
%------------------------------------------------------------------------------