↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n019.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:54 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.40s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   53 (  13 unt;   5 def)
%            Number of atoms       :  116 (  21 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  121 (  58   ~;  58   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   14 (  14   !;   0   ?)

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

fof(f115,axiom,
    ! [U,V] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | ~ neq(U,V)
      | U != V ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f189,negated_conjecture,
    ssList(sk4),
    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(f193,negated_conjecture,
    ! [A] :
      ( ~ segmentP(sk1,A)
      | ~ segmentP(sk2,A)
      | ~ neq(A,nil)
      | ~ ssList(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f197,negated_conjecture,
    ( segmentP(sk4,sk3)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f254,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f57]) ).

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

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

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

fof(f431,plain,
    ssList(sk4),
    inference(cnf_transformation,[status(thm)],[f189]) ).

fof(f432,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(thm)],[f190]) ).

fof(f433,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(thm)],[f191]) ).

fof(f434,plain,
    neq(sk2,nil),
    inference(cnf_transformation,[status(thm)],[f192]) ).

fof(f435,plain,
    ! [X0] :
      ( ~ segmentP(sk1,X0)
      | ~ segmentP(sk2,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f193]) ).

fof(f436,plain,
    ( neq(sk3,nil)
    | nil = sk4 ),
    inference(cnf_transformation,[status(thm)],[f194]) ).

fof(f437,plain,
    ( segmentP(sk4,sk3)
    | nil = sk4 ),
    inference(cnf_transformation,[status(thm)],[f195]) ).

fof(f438,plain,
    ( neq(sk3,nil)
    | nil = sk3 ),
    inference(cnf_transformation,[status(thm)],[f196]) ).

fof(f439,plain,
    ( segmentP(sk4,sk3)
    | nil = sk3 ),
    inference(cnf_transformation,[status(thm)],[f197]) ).

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

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

fof(f450,definition,
    ( sQ3_spl
  <=> neq(sk3,nil) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f453,plain,
    ( sQ3_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f436,f447,f450]) ).

fof(f454,definition,
    ( sQ4_spl
  <=> segmentP(sk4,sk3) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f457,plain,
    ( sQ4_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f437,f447,f454]) ).

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

fof(f459,plain,
    ( ~ sQ5_spl
    | nil = sk3 ),
    inference(component_clause,[status(thm)],[f458]) ).

fof(f461,plain,
    ( sQ3_spl
    | sQ5_spl ),
    inference(split_clause,[status(thm)],[f438,f458,f450]) ).

fof(f462,plain,
    ( sQ4_spl
    | sQ5_spl ),
    inference(split_clause,[status(thm)],[f439,f458,f454]) ).

fof(f470,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(destructive_equality_resolution,[status(thm)],[f319]) ).

fof(f471,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,X0) ),
    inference(duplicate_literals_removal,[status(thm)],[f470]) ).

fof(f495,plain,
    ( ~ sQ5_spl
    | ~ sQ2_spl
    | nil = sk4 ),
    inference(backward_demodulation,[status(thm)],[f498,f459]) ).

fof(f498,plain,
    ( ~ sQ2_spl
    | ~ sQ5_spl
    | sk3 = sk4 ),
    inference(forward_demodulation,[status(thm)],[f459,f448]) ).

fof(f499,plain,
    neq(sk4,nil),
    inference(forward_demodulation,[status(thm)],[f432,f434]) ).

fof(f500,plain,
    ( ~ sQ5_spl
    | ~ sQ2_spl
    | neq(sk4,sk4) ),
    inference(forward_demodulation,[status(thm)],[f495,f499]) ).

fof(f501,plain,
    ( ~ sQ5_spl
    | ~ sQ2_spl
    | ~ ssList(sk4) ),
    inference(resolution,[status(thm)],[f471,f500]) ).

fof(f502,plain,
    ( ~ sQ5_spl
    | ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f501,f431]) ).

fof(f503,plain,
    ( ~ sQ5_spl
    | ~ sQ2_spl ),
    inference(contradiction_clause,[status(thm)],[f502]) ).

fof(f504,plain,
    ! [X0] :
      ( ~ segmentP(sk1,X0)
      | ~ segmentP(sk4,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(forward_demodulation,[status(thm)],[f432,f435]) ).

fof(f505,plain,
    ! [X0] :
      ( ~ segmentP(sk3,X0)
      | ~ segmentP(sk4,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(forward_demodulation,[status(thm)],[f433,f504]) ).

fof(f510,plain,
    ( ~ ssList(sk3)
    | ~ segmentP(sk4,sk3)
    | ~ neq(sk3,nil)
    | ~ ssList(sk3) ),
    inference(resolution,[status(thm)],[f505,f254]) ).

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

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

fof(f542,plain,
    ( ~ sQ4_spl
    | ~ sQ3_spl
    | ~ sQ6_spl ),
    inference(split_clause,[status(thm)],[f510,f511,f450,f454]) ).

fof(f543,plain,
    ( sQ6_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f513,f430]) ).

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

fof(f545,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f453,f457,f461,f462,f503,f542,f544]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC086-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n019.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep 21 07:54:49 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.13/0.37  % Drodi V4.1.1
% 0.13/0.40  % Refutation found
% 0.13/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.43  % Elapsed time: 0.069686 seconds
% 0.13/0.43  % CPU time: 0.172261 seconds
% 0.13/0.43  % Total memory used: 108.454 MB
% 0.13/0.43  % Net memory used: 108.307 MB
%------------------------------------------------------------------------------