↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWC041-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:39:42 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.39s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   43 (  22 unt;   4 def)
%            Number of atoms       :   80 (  30 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   72 (  35   ~;  33   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f118,axiom,
    ! [U,V] :
      ( nil = U
      | ~ ssList(U)
      | ~ ssList(V)
      | app(U,V) != nil ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f188,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f190,negated_conjecture,
    nil = sk2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f191,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f194,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f325,plain,
    ! [U] :
      ( nil = U
      | ~ ssList(U)
      | ! [V] :
          ( ~ ssList(V)
          | app(U,V) != nil ) ),
    inference(miniscoping,[status(thm)],[f118]) ).

fof(f326,plain,
    ! [X0,X1] :
      ( nil = X0
      | ~ ssList(X0)
      | ~ ssList(X1)
      | app(X0,X1) != nil ),
    inference(cnf_transformation,[status(thm)],[f325]) ).

fof(f431,plain,
    ssList(sk3),
    inference(cnf_transformation,[status(thm)],[f188]) ).

fof(f433,plain,
    nil = sk2,
    inference(cnf_transformation,[status(thm)],[f190]) ).

fof(f434,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(thm)],[f191]) ).

fof(f435,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(thm)],[f192]) ).

fof(f436,plain,
    nil != sk1,
    inference(cnf_transformation,[status(thm)],[f193]) ).

fof(f437,plain,
    ssList(sk5),
    inference(cnf_transformation,[status(thm)],[f194]) ).

fof(f438,plain,
    app(sk3,sk5) = sk4,
    inference(cnf_transformation,[status(thm)],[f195]) ).

fof(f450,definition,
    ( sQ2_spl
  <=> nil = sk4 ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f451,plain,
    ( ~ sQ2_spl
    | nil = sk4 ),
    inference(component_clause,[status(thm)],[f450]) ).

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

fof(f486,plain,
    nil = sk4,
    inference(backward_demodulation,[status(thm)],[f434,f433]) ).

fof(f489,plain,
    nil != sk3,
    inference(forward_demodulation,[status(thm)],[f435,f436]) ).

fof(f506,definition,
    ( sQ4_spl
  <=> ssList(sk5) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f508,plain,
    ( sQ4_spl
    | ~ ssList(sk5) ),
    inference(component_clause,[status(thm)],[f506]) ).

fof(f509,definition,
    ( sQ5_spl
  <=> ssList(sk3) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f511,plain,
    ( sQ5_spl
    | ~ ssList(sk3) ),
    inference(component_clause,[status(thm)],[f509]) ).

fof(f521,plain,
    ! [X0,X1] :
      ( ~ sQ2_spl
      | nil = X0
      | ~ ssList(X0)
      | ~ ssList(X1)
      | app(X0,X1) != sk4 ),
    inference(forward_demodulation,[status(thm)],[f451,f326]) ).

fof(f522,plain,
    ! [X0,X1] :
      ( ~ sQ2_spl
      | sk4 = X0
      | ~ ssList(X0)
      | ~ ssList(X1)
      | app(X0,X1) != sk4 ),
    inference(forward_demodulation,[status(thm)],[f451,f521]) ).

fof(f524,plain,
    ( ~ sQ2_spl
    | sk4 = sk3
    | ~ ssList(sk3)
    | ~ ssList(sk5) ),
    inference(resolution,[status(thm)],[f522,f438]) ).

fof(f531,definition,
    ( sQ8_spl
  <=> sk4 = sk3 ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f532,plain,
    ( ~ sQ8_spl
    | sk4 = sk3 ),
    inference(component_clause,[status(thm)],[f531]) ).

fof(f534,plain,
    ( ~ sQ2_spl
    | sQ8_spl
    | ~ sQ5_spl
    | ~ sQ4_spl ),
    inference(split_clause,[status(thm)],[f524,f506,f509,f531,f450]) ).

fof(f537,plain,
    ( sQ4_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f508,f437]) ).

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

fof(f549,plain,
    sk4 != sk3,
    inference(forward_demodulation,[status(thm)],[f486,f489]) ).

fof(f552,plain,
    ( sQ2_spl
    | sk4 != sk4 ),
    inference(forward_demodulation,[status(thm)],[f486,f452]) ).

fof(f553,plain,
    ( sQ2_spl
    | $false ),
    inference(trivial_equality_resolution,[status(thm)],[f552]) ).

fof(f554,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f553]) ).

fof(f555,plain,
    ( sQ5_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f511,f431]) ).

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

fof(f557,plain,
    ( ~ sQ8_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f532,f549]) ).

fof(f558,plain,
    ~ sQ8_spl,
    inference(contradiction_clause,[status(thm)],[f557]) ).

fof(f559,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f534,f538,f554,f556,f558]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC041-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 07:52:03 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.14/0.38  % Drodi V4.1.1
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41  % Elapsed time: 0.040127 seconds
% 0.14/0.41  % CPU time: 0.089207 seconds
% 0.14/0.41  % Total memory used: 20.519 MB
% 0.14/0.41  % Net memory used: 20.493 MB
%------------------------------------------------------------------------------