↑ Up

Drodi---4.1.1.UNS-CRf.s

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

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

% Result   : Unsatisfiable 0.14s 0.39s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   59 (  26 unt;   8 def)
%            Number of atoms       :  165 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  214 ( 108   ~;  98   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   19 (  18 usr;   9 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   74 (  74   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
      ( ~ p_10(X10,X1)
      | ~ p_9(X9,X10)
      | ~ p_8(X8,X9)
      | ~ p_7(X7,X8)
      | ~ p_6(X6,X7)
      | ~ p_5(X5,X6)
      | ~ p_4(X4,X5)
      | ~ p_3(X3,X4)
      | ~ p_2(X2,X3)
      | ~ p_1(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    p_1(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    p_2(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    p_3(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    p_4(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    p_5(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,negated_conjecture,
    p_6(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,negated_conjecture,
    p_7(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    p_8(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    p_9(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,negated_conjecture,
    p_10(a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,plain,
    ! [X1,X10] :
      ( ~ p_10(X10,X1)
      | ! [X9] :
          ( ~ p_9(X9,X10)
          | ! [X8] :
              ( ~ p_8(X8,X9)
              | ! [X7] :
                  ( ~ p_7(X7,X8)
                  | ! [X6] :
                      ( ~ p_6(X6,X7)
                      | ! [X5] :
                          ( ~ p_5(X5,X6)
                          | ! [X4] :
                              ( ~ p_4(X4,X5)
                              | ! [X3] :
                                  ( ~ p_3(X3,X4)
                                  | ! [X2] :
                                      ( ~ p_2(X2,X3)
                                      | ~ p_1(X1,X2) ) ) ) ) ) ) ) ) ),
    inference(miniscoping,[status(thm)],[f1]) ).

fof(f13,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
      ( ~ p_10(X9,X0)
      | ~ p_9(X8,X9)
      | ~ p_8(X7,X8)
      | ~ p_7(X6,X7)
      | ~ p_6(X5,X6)
      | ~ p_5(X4,X5)
      | ~ p_4(X3,X4)
      | ~ p_3(X2,X3)
      | ~ p_2(X1,X2)
      | ~ p_1(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f14,plain,
    p_1(a,a),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f15,plain,
    p_2(a,a),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f16,plain,
    p_3(a,a),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f17,plain,
    p_4(a,a),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f18,plain,
    p_5(a,a),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f19,plain,
    p_6(a,a),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f20,plain,
    p_7(a,a),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f21,plain,
    p_8(a,a),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f22,plain,
    p_9(a,a),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f23,plain,
    p_10(a,a),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f24,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( ~ p_10(X7,a)
      | ~ p_9(X6,X7)
      | ~ p_8(X5,X6)
      | ~ p_7(X4,X5)
      | ~ p_6(X3,X4)
      | ~ p_5(X2,X3)
      | ~ p_4(X1,X2)
      | ~ p_3(X0,X1)
      | ~ p_2(a,X0) ),
    inference(resolution,[status(thm)],[f13,f14]) ).

fof(f25,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ p_10(X5,a)
      | ~ p_9(X4,X5)
      | ~ p_8(X3,X4)
      | ~ p_7(X2,X3)
      | ~ p_6(X1,X2)
      | ~ p_5(X0,X1)
      | ~ p_4(a,X0)
      | ~ p_2(a,a) ),
    inference(resolution,[status(thm)],[f24,f16]) ).

fof(f26,definition,
    ( sQ0_spl
  <=> p_2(a,a) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f28,plain,
    ( sQ0_spl
    | ~ p_2(a,a) ),
    inference(component_clause,[status(thm)],[f26]) ).

fof(f29,definition,
    ! [X0,X1,X2,X3,X4,X5] :
      ( sQ1_spl
    <=> ( ~ p_10(X5,a)
        | ~ p_9(X4,X5)
        | ~ p_8(X3,X4)
        | ~ p_7(X2,X3)
        | ~ p_6(X1,X2)
        | ~ p_5(X0,X1)
        | ~ p_4(a,X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f30,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ sQ1_spl
      | ~ p_10(X5,a)
      | ~ p_9(X4,X5)
      | ~ p_8(X3,X4)
      | ~ p_7(X2,X3)
      | ~ p_6(X1,X2)
      | ~ p_5(X0,X1)
      | ~ p_4(a,X0) ),
    inference(component_clause,[status(thm)],[f29]) ).

fof(f32,plain,
    ( sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f25,f26,f29]) ).

fof(f33,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f28,f15]) ).

fof(f34,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f33]) ).

fof(f35,plain,
    ! [X0,X1,X2,X3] :
      ( ~ sQ1_spl
      | ~ p_10(X3,a)
      | ~ p_9(X2,X3)
      | ~ p_8(X1,X2)
      | ~ p_7(X0,X1)
      | ~ p_6(a,X0)
      | ~ p_4(a,a) ),
    inference(resolution,[status(thm)],[f30,f18]) ).

fof(f36,definition,
    ( sQ2_spl
  <=> p_4(a,a) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f38,plain,
    ( sQ2_spl
    | ~ p_4(a,a) ),
    inference(component_clause,[status(thm)],[f36]) ).

fof(f39,definition,
    ! [X0,X1,X2,X3] :
      ( sQ3_spl
    <=> ( ~ p_10(X3,a)
        | ~ p_9(X2,X3)
        | ~ p_8(X1,X2)
        | ~ p_7(X0,X1)
        | ~ p_6(a,X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f40,plain,
    ! [X0,X1,X2,X3] :
      ( ~ sQ3_spl
      | ~ p_10(X3,a)
      | ~ p_9(X2,X3)
      | ~ p_8(X1,X2)
      | ~ p_7(X0,X1)
      | ~ p_6(a,X0) ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,plain,
    ( ~ sQ1_spl
    | sQ3_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f35,f36,f39,f29]) ).

fof(f43,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f38,f17]) ).

fof(f44,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f43]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ~ sQ3_spl
      | ~ p_10(X1,a)
      | ~ p_9(X0,X1)
      | ~ p_8(a,X0)
      | ~ p_6(a,a) ),
    inference(resolution,[status(thm)],[f40,f20]) ).

fof(f46,definition,
    ( sQ4_spl
  <=> p_6(a,a) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f48,plain,
    ( sQ4_spl
    | ~ p_6(a,a) ),
    inference(component_clause,[status(thm)],[f46]) ).

fof(f49,definition,
    ! [X0,X1] :
      ( sQ5_spl
    <=> ( ~ p_10(X1,a)
        | ~ p_9(X0,X1)
        | ~ p_8(a,X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f50,plain,
    ! [X0,X1] :
      ( ~ sQ5_spl
      | ~ p_10(X1,a)
      | ~ p_9(X0,X1)
      | ~ p_8(a,X0) ),
    inference(component_clause,[status(thm)],[f49]) ).

fof(f52,plain,
    ( ~ sQ3_spl
    | sQ5_spl
    | ~ sQ4_spl ),
    inference(split_clause,[status(thm)],[f45,f46,f49,f39]) ).

fof(f53,plain,
    ( sQ4_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f48,f19]) ).

fof(f54,plain,
    sQ4_spl,
    inference(contradiction_clause,[status(thm)],[f53]) ).

fof(f55,plain,
    ( ~ sQ5_spl
    | ~ p_10(a,a)
    | ~ p_8(a,a) ),
    inference(resolution,[status(thm)],[f50,f22]) ).

fof(f56,definition,
    ( sQ6_spl
  <=> p_8(a,a) ),
    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).

fof(f58,plain,
    ( sQ6_spl
    | ~ p_8(a,a) ),
    inference(component_clause,[status(thm)],[f56]) ).

fof(f59,definition,
    ( sQ7_spl
  <=> p_10(a,a) ),
    introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).

fof(f61,plain,
    ( sQ7_spl
    | ~ p_10(a,a) ),
    inference(component_clause,[status(thm)],[f59]) ).

fof(f62,plain,
    ( ~ sQ5_spl
    | ~ sQ7_spl
    | ~ sQ6_spl ),
    inference(split_clause,[status(thm)],[f55,f56,f59,f49]) ).

fof(f63,plain,
    ( sQ6_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f58,f21]) ).

fof(f64,plain,
    sQ6_spl,
    inference(contradiction_clause,[status(thm)],[f63]) ).

fof(f65,plain,
    ( sQ7_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f61,f23]) ).

fof(f66,plain,
    sQ7_spl,
    inference(contradiction_clause,[status(thm)],[f65]) ).

fof(f67,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f32,f34,f42,f44,f52,f54,f62,f64,f66]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN005-1.010 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n016.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 10:43:37 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % 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.42  % Elapsed time: 0.043572 seconds
% 0.14/0.42  % CPU time: 0.137430 seconds
% 0.14/0.42  % Total memory used: 55.643 MB
% 0.14/0.42  % Net memory used: 55.214 MB
%------------------------------------------------------------------------------