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

View Problem - Process Solution

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

% Computer : n019.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:56 EDT 2023

% Result   : Unsatisfiable 0.16s 0.32s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   62 (  17 unt;   0 def)
%            Number of atoms       :  118 (  24 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  101 (  45   ~;  47   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  10 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    6 (;   6   !;   0   ?)

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

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

fof(f66,axiom,
    ! [U] :
      ( ~ ssItem(U)
      | strictorderedP(cons(U,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(f187,negated_conjecture,
    ssList(sk2),
    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,
    ~ strictorderedP(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f194,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

fof(f433,plain,
    ~ strictorderedP(sk1),
    inference(cnf_transformation,[status(esa)],[f192]) ).

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

fof(f435,plain,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f436,plain,
    ( cons(sk5,nil) = sk3
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[status(esa)],[f195]) ).

fof(f445,plain,
    ( spl0_2
  <=> nil = sk3 ),
    introduced(split_symbol_definition) ).

fof(f446,plain,
    ( nil = sk3
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f445]) ).

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

fof(f450,plain,
    ( nil != sk4
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f448]) ).

fof(f451,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f434,f445,f448]) ).

fof(f452,plain,
    ( spl0_4
  <=> ssItem(sk5) ),
    introduced(split_symbol_definition) ).

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

fof(f457,plain,
    ( ~ neq(sk4,nil)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f455]) ).

fof(f458,plain,
    ( spl0_4
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f435,f452,f455]) ).

fof(f459,plain,
    ( spl0_6
  <=> cons(sk5,nil) = sk3 ),
    introduced(split_symbol_definition) ).

fof(f460,plain,
    ( cons(sk5,nil) = sk3
    | ~ spl0_6 ),
    inference(component_clause,[status(thm)],[f459]) ).

fof(f462,plain,
    ( spl0_6
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f436,f459,f455]) ).

fof(f498,plain,
    ( nil != sk2
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f431,f450]) ).

fof(f499,plain,
    ( ~ neq(sk2,nil)
    | spl0_5 ),
    inference(forward_demodulation,[status(thm)],[f431,f457]) ).

fof(f506,plain,
    ( spl0_10
  <=> sk2 = nil ),
    introduced(split_symbol_definition) ).

fof(f507,plain,
    ( sk2 = nil
    | ~ spl0_10 ),
    inference(component_clause,[status(thm)],[f506]) ).

fof(f511,plain,
    ( spl0_11
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f513,plain,
    ( ~ ssList(nil)
    | spl0_11 ),
    inference(component_clause,[status(thm)],[f511]) ).

fof(f514,plain,
    ( spl0_12
  <=> ssList(sk2) ),
    introduced(split_symbol_definition) ).

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

fof(f517,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk2)
    | sk2 = nil
    | spl0_5 ),
    inference(resolution,[status(thm)],[f499,f299]) ).

fof(f518,plain,
    ( ~ spl0_11
    | ~ spl0_12
    | spl0_10
    | spl0_5 ),
    inference(split_clause,[status(thm)],[f517,f511,f514,f506,f455]) ).

fof(f519,plain,
    ( $false
    | spl0_12 ),
    inference(forward_subsumption_resolution,[status(thm)],[f516,f428]) ).

fof(f520,plain,
    spl0_12,
    inference(contradiction_clause,[status(thm)],[f519]) ).

fof(f521,plain,
    ( $false
    | spl0_11 ),
    inference(forward_subsumption_resolution,[status(thm)],[f513,f204]) ).

fof(f522,plain,
    spl0_11,
    inference(contradiction_clause,[status(thm)],[f521]) ).

fof(f523,plain,
    ( cons(sk5,nil) = sk1
    | ~ spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f432,f460]) ).

fof(f526,plain,
    ( spl0_13
  <=> strictorderedP(sk1) ),
    introduced(split_symbol_definition) ).

fof(f527,plain,
    ( strictorderedP(sk1)
    | ~ spl0_13 ),
    inference(component_clause,[status(thm)],[f526]) ).

fof(f529,plain,
    ( ~ ssItem(sk5)
    | strictorderedP(sk1)
    | ~ spl0_6 ),
    inference(paramodulation,[status(thm)],[f523,f262]) ).

fof(f530,plain,
    ( ~ spl0_4
    | spl0_13
    | ~ spl0_6 ),
    inference(split_clause,[status(thm)],[f529,f452,f526,f459]) ).

fof(f543,plain,
    ( $false
    | ~ spl0_13 ),
    inference(forward_subsumption_resolution,[status(thm)],[f527,f433]) ).

fof(f544,plain,
    ~ spl0_13,
    inference(contradiction_clause,[status(thm)],[f543]) ).

fof(f545,plain,
    ( $false
    | spl0_3
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f507,f498]) ).

fof(f546,plain,
    ( spl0_3
    | ~ spl0_10 ),
    inference(contradiction_clause,[status(thm)],[f545]) ).

fof(f547,plain,
    ( nil = sk1
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f432,f446]) ).

fof(f549,plain,
    ( ~ strictorderedP(nil)
    | ~ spl0_2 ),
    inference(backward_demodulation,[status(thm)],[f547,f433]) ).

fof(f550,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f549,f199]) ).

fof(f551,plain,
    ~ spl0_2,
    inference(contradiction_clause,[status(thm)],[f550]) ).

fof(f552,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f451,f458,f462,f518,f520,f522,f530,f544,f546,f551]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWC292-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n019.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue May 30 11:26:25 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.5.1
% 0.16/0.32  % Refutation found
% 0.16/0.32  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.32  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.54  % Elapsed time: 0.016404 seconds
% 0.16/0.54  % CPU time: 0.018018 seconds
% 0.16/0.54  % Memory used: 4.048 MB
%------------------------------------------------------------------------------