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

View Problem - Process Solution

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

% Computer : n014.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:15 EDT 2023

% Result   : Unsatisfiable 0.15s 0.35s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   64 (  17 unt;   0 def)
%            Number of atoms       :  129 (  13 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  123 (  58   ~;  56   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   14 (  12 usr;  10 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(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(f194,negated_conjecture,
    ( ~ neq(sk1,nil)
    | ~ frontsegP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

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

fof(f435,plain,
    ( ~ neq(sk1,nil)
    | ~ frontsegP(sk2,sk1) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

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

fof(f437,plain,
    ( ~ neq(sk4,nil)
    | frontsegP(sk4,sk3) ),
    inference(cnf_transformation,[status(esa)],[f196]) ).

fof(f452,plain,
    ( spl0_4
  <=> neq(sk1,nil) ),
    introduced(split_symbol_definition) ).

fof(f454,plain,
    ( ~ neq(sk1,nil)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f452]) ).

fof(f455,plain,
    ( spl0_5
  <=> frontsegP(sk2,sk1) ),
    introduced(split_symbol_definition) ).

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

fof(f459,plain,
    ( spl0_6
  <=> neq(sk4,nil) ),
    introduced(split_symbol_definition) ).

fof(f461,plain,
    ( ~ neq(sk4,nil)
    | spl0_6 ),
    inference(component_clause,[status(thm)],[f459]) ).

fof(f462,plain,
    ( spl0_7
  <=> neq(sk3,nil) ),
    introduced(split_symbol_definition) ).

fof(f463,plain,
    ( neq(sk3,nil)
    | ~ spl0_7 ),
    inference(component_clause,[status(thm)],[f462]) ).

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

fof(f466,plain,
    ( spl0_8
  <=> frontsegP(sk4,sk3) ),
    introduced(split_symbol_definition) ).

fof(f467,plain,
    ( frontsegP(sk4,sk3)
    | ~ spl0_8 ),
    inference(component_clause,[status(thm)],[f466]) ).

fof(f469,plain,
    ( ~ spl0_6
    | spl0_8 ),
    inference(split_clause,[status(thm)],[f437,f459,f466]) ).

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

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

fof(f501,plain,
    ( spl0_9
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f503,plain,
    ( ~ ssList(nil)
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f501]) ).

fof(f511,plain,
    ( $false
    | spl0_9 ),
    inference(forward_subsumption_resolution,[status(thm)],[f503,f204]) ).

fof(f512,plain,
    spl0_9,
    inference(contradiction_clause,[status(thm)],[f511]) ).

fof(f526,plain,
    ( spl0_14
  <=> sk1 = nil ),
    introduced(split_symbol_definition) ).

fof(f527,plain,
    ( sk1 = nil
    | ~ spl0_14 ),
    inference(component_clause,[status(thm)],[f526]) ).

fof(f531,plain,
    ( spl0_15
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f533,plain,
    ( ~ ssList(sk1)
    | spl0_15 ),
    inference(component_clause,[status(thm)],[f531]) ).

fof(f534,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk1)
    | sk1 = nil
    | spl0_4 ),
    inference(resolution,[status(thm)],[f454,f299]) ).

fof(f535,plain,
    ( ~ spl0_9
    | ~ spl0_15
    | spl0_14
    | spl0_4 ),
    inference(split_clause,[status(thm)],[f534,f501,f531,f526,f452]) ).

fof(f536,plain,
    ( $false
    | spl0_15 ),
    inference(forward_subsumption_resolution,[status(thm)],[f533,f427]) ).

fof(f537,plain,
    spl0_15,
    inference(contradiction_clause,[status(thm)],[f536]) ).

fof(f538,plain,
    ( nil = sk3
    | ~ spl0_14 ),
    inference(backward_demodulation,[status(thm)],[f527,f432]) ).

fof(f540,plain,
    ( ~ neq(sk2,nil)
    | spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f431,f461]) ).

fof(f541,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f540,f433]) ).

fof(f542,plain,
    spl0_6,
    inference(contradiction_clause,[status(thm)],[f541]) ).

fof(f543,plain,
    ( neq(nil,nil)
    | ~ spl0_14
    | ~ spl0_7 ),
    inference(forward_demodulation,[status(thm)],[f538,f463]) ).

fof(f544,plain,
    ( frontsegP(sk2,sk3)
    | ~ spl0_8 ),
    inference(forward_demodulation,[status(thm)],[f431,f467]) ).

fof(f554,plain,
    ( ~ ssList(nil)
    | ~ spl0_14
    | ~ spl0_7 ),
    inference(resolution,[status(thm)],[f543,f478]) ).

fof(f555,plain,
    ( ~ spl0_9
    | ~ spl0_14
    | ~ spl0_7 ),
    inference(split_clause,[status(thm)],[f554,f501,f526,f462]) ).

fof(f562,plain,
    ( spl0_18
  <=> ssList(sk2) ),
    introduced(split_symbol_definition) ).

fof(f564,plain,
    ( ~ ssList(sk2)
    | spl0_18 ),
    inference(component_clause,[status(thm)],[f562]) ).

fof(f570,plain,
    ( $false
    | spl0_18 ),
    inference(forward_subsumption_resolution,[status(thm)],[f564,f428]) ).

fof(f571,plain,
    spl0_18,
    inference(contradiction_clause,[status(thm)],[f570]) ).

fof(f580,plain,
    ( frontsegP(sk2,sk1)
    | ~ spl0_8 ),
    inference(backward_demodulation,[status(thm)],[f432,f544]) ).

fof(f581,plain,
    ( spl0_5
    | ~ spl0_8 ),
    inference(split_clause,[status(thm)],[f580,f455,f466]) ).

fof(f582,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f458,f465,f469,f512,f535,f537,f542,f555,f571,f581]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC103-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33  % Computer : n014.cluster.edu
% 0.10/0.33  % Model    : x86_64 x86_64
% 0.10/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33  % Memory   : 8042.1875MB
% 0.10/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33  % CPULimit : 300
% 0.10/0.33  % WCLimit  : 300
% 0.10/0.33  % DateTime : Tue May 30 11:21:18 EDT 2023
% 0.10/0.33  % CPUTime  : 
% 0.15/0.34  % Drodi V3.5.1
% 0.15/0.35  % Refutation found
% 0.15/0.35  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.57  % Elapsed time: 0.018823 seconds
% 0.16/0.57  % CPU time: 0.019684 seconds
% 0.16/0.57  % Memory used: 4.058 MB
%------------------------------------------------------------------------------