↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n011.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 12:30:38 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.38s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   42 (   1 unt;   5 def)
%            Number of atoms       :  107 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  113 (  48   ~;  60   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :   11 (  10 usr;  11 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ( b
    | a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ( ~ b
    | ~ a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    ( ~ d
    | c
    | a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ( d
    | ~ c
    | a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ( d
    | c
    | ~ a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ( ~ d
    | ~ c
    | ~ a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,negated_conjecture,
    ( ~ e
    | c
    | b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,negated_conjecture,
    ( e
    | ~ c
    | b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ( e
    | c
    | ~ b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    ( ~ e
    | ~ c
    | ~ b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f11,negated_conjecture,
    ( ~ e
    | d ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    ( e
    | ~ d ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,plain,
    ( b
    | a ),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f14,plain,
    ( ~ b
    | ~ a ),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f15,plain,
    ( ~ d
    | c
    | a ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f16,plain,
    ( d
    | ~ c
    | a ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f17,plain,
    ( d
    | c
    | ~ a ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f18,plain,
    ( ~ d
    | ~ c
    | ~ a ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f19,plain,
    ( ~ e
    | c
    | b ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f20,plain,
    ( e
    | ~ c
    | b ),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f21,plain,
    ( e
    | c
    | ~ b ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f22,plain,
    ( ~ e
    | ~ c
    | ~ b ),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f23,plain,
    ( ~ e
    | d ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f24,plain,
    ( e
    | ~ d ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

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

fof(f28,definition,
    ( sQ1_spl
  <=> b ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f31,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f13,f25,f28]) ).

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

fof(f33,definition,
    ( sQ2_spl
  <=> c ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f36,definition,
    ( sQ3_spl
  <=> d ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f39,plain,
    ( ~ sQ3_spl
    | sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f15,f25,f33,f36]) ).

fof(f40,plain,
    ( sQ3_spl
    | ~ sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f16,f25,f33,f36]) ).

fof(f41,plain,
    ( sQ3_spl
    | sQ2_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f17,f25,f33,f36]) ).

fof(f42,plain,
    ( ~ sQ3_spl
    | ~ sQ2_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f18,f25,f33,f36]) ).

fof(f43,definition,
    ( sQ4_spl
  <=> e ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f46,plain,
    ( ~ sQ4_spl
    | sQ2_spl
    | sQ1_spl ),
    inference(split_clause,[status(thm)],[f19,f28,f33,f43]) ).

fof(f47,plain,
    ( sQ4_spl
    | ~ sQ2_spl
    | sQ1_spl ),
    inference(split_clause,[status(thm)],[f20,f28,f33,f43]) ).

fof(f48,plain,
    ( sQ4_spl
    | sQ2_spl
    | ~ sQ1_spl ),
    inference(split_clause,[status(thm)],[f21,f28,f33,f43]) ).

fof(f49,plain,
    ( ~ sQ4_spl
    | ~ sQ2_spl
    | ~ sQ1_spl ),
    inference(split_clause,[status(thm)],[f22,f28,f33,f43]) ).

fof(f50,plain,
    ( ~ sQ4_spl
    | sQ3_spl ),
    inference(split_clause,[status(thm)],[f23,f36,f43]) ).

fof(f51,plain,
    ( sQ4_spl
    | ~ sQ3_spl ),
    inference(split_clause,[status(thm)],[f24,f36,f43]) ).

fof(f52,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f31,f32,f39,f40,f41,f42,f46,f47,f48,f49,f50,f51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 18:16:11 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Drodi V4.1.1
% 0.09/0.38  % Refutation found
% 0.09/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.40  % Elapsed time: 0.031944 seconds
% 0.09/0.40  % CPU time: 0.070541 seconds
% 0.09/0.40  % Total memory used: 7.233 MB
% 0.09/0.40  % Net memory used: 7.009 MB
%------------------------------------------------------------------------------