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

View Problem - Process Solution

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

% Computer : n009.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:53 EDT 2024

% Result   : Unsatisfiable 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   40 (  20 unt;   0 def)
%            Number of atoms       :   78 (  15 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   70 (  32   ~;  33   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f191,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    ! [A,B,C,D] :
      ( ~ ssItem(A)
      | ~ ssItem(B)
      | ~ ssList(C)
      | ~ ssList(D)
      | A = B
      | app(app(app(C,cons(A,nil)),cons(B,nil)),D) != sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f193,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f194,negated_conjecture,
    ssItem(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    ssList(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f196,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f197,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f198,negated_conjecture,
    sk5 != sk6,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f435,plain,
    ! [X0,X1,X2,X3] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | X0 = X1
      | app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sk3 ),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f436,plain,
    ssItem(sk5),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f437,plain,
    ssItem(sk6),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f438,plain,
    ssList(sk7),
    inference(cnf_transformation,[status(esa)],[f195]) ).

fof(f439,plain,
    ssList(sk8),
    inference(cnf_transformation,[status(esa)],[f196]) ).

fof(f440,plain,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    inference(cnf_transformation,[status(esa)],[f197]) ).

fof(f441,plain,
    sk5 != sk6,
    inference(cnf_transformation,[status(esa)],[f198]) ).

fof(f494,plain,
    ( spl0_3
  <=> ssList(sk8) ),
    introduced(split_symbol_definition) ).

fof(f496,plain,
    ( ~ ssList(sk8)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f494]) ).

fof(f515,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f496,f439]) ).

fof(f516,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f515]) ).

fof(f517,plain,
    ( spl0_8
  <=> ssItem(sk6) ),
    introduced(split_symbol_definition) ).

fof(f519,plain,
    ( ~ ssItem(sk6)
    | spl0_8 ),
    inference(component_clause,[status(thm)],[f517]) ).

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

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

fof(f532,plain,
    ( spl0_11
  <=> ssList(sk7) ),
    introduced(split_symbol_definition) ).

fof(f534,plain,
    ( ~ ssList(sk7)
    | spl0_11 ),
    inference(component_clause,[status(thm)],[f532]) ).

fof(f537,plain,
    ( $false
    | spl0_11 ),
    inference(forward_subsumption_resolution,[status(thm)],[f534,f438]) ).

fof(f538,plain,
    spl0_11,
    inference(contradiction_clause,[status(thm)],[f537]) ).

fof(f557,plain,
    ! [X0,X1,X2,X3] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | X0 = X1
      | app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sk1 ),
    inference(forward_demodulation,[status(thm)],[f434,f435]) ).

fof(f558,plain,
    ( spl0_12
  <=> ssItem(sk5) ),
    introduced(split_symbol_definition) ).

fof(f560,plain,
    ( ~ ssItem(sk5)
    | spl0_12 ),
    inference(component_clause,[status(thm)],[f558]) ).

fof(f561,plain,
    ( spl0_13
  <=> sk5 = sk6 ),
    introduced(split_symbol_definition) ).

fof(f562,plain,
    ( sk5 = sk6
    | ~ spl0_13 ),
    inference(component_clause,[status(thm)],[f561]) ).

fof(f564,plain,
    ( ~ ssItem(sk5)
    | ~ ssItem(sk6)
    | ~ ssList(sk7)
    | ~ ssList(sk8)
    | sk5 = sk6 ),
    inference(resolution,[status(thm)],[f557,f440]) ).

fof(f565,plain,
    ( ~ spl0_12
    | ~ spl0_8
    | ~ spl0_11
    | ~ spl0_3
    | spl0_13 ),
    inference(split_clause,[status(thm)],[f564,f558,f517,f532,f494,f561]) ).

fof(f571,plain,
    ( $false
    | spl0_12 ),
    inference(forward_subsumption_resolution,[status(thm)],[f560,f436]) ).

fof(f572,plain,
    spl0_12,
    inference(contradiction_clause,[status(thm)],[f571]) ).

fof(f573,plain,
    ( $false
    | ~ spl0_13 ),
    inference(forward_subsumption_resolution,[status(thm)],[f562,f441]) ).

fof(f574,plain,
    ~ spl0_13,
    inference(contradiction_clause,[status(thm)],[f573]) ).

fof(f575,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f516,f528,f538,f565,f572,f574]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC189-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 : n009.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 Apr 30 00:07:41 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.027129 seconds
% 0.13/0.38  % CPU time: 0.046711 seconds
% 0.13/0.38  % Total memory used: 14.412 MB
% 0.13/0.38  % Net memory used: 14.391 MB
%------------------------------------------------------------------------------