↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n007.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:07:27 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.40s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (   9 unt;   2 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  17   ~;  15   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X,Y] :
      ( equalish(Y,X)
      | ~ equalish(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X,Y] :
      ( there_exists(compose(X,Y))
      | ~ equalish(domain(X),codomain(Y))
      | ~ there_exists(domain(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,hypothesis,
    there_exists(domain(c2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f11,hypothesis,
    equalish(domain(c2),codomain(c1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    ~ there_exists(compose(c2,c1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f14,plain,
    ! [X0,X1] :
      ( equalish(X1,X0)
      | ~ equalish(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( there_exists(compose(X0,X1))
      | ~ equalish(domain(X0),codomain(X1))
      | ~ there_exists(domain(X0)) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f22,plain,
    there_exists(domain(c2)),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f24,plain,
    equalish(domain(c2),codomain(c1)),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f25,plain,
    ~ there_exists(compose(c2,c1)),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( there_exists(compose(X1,X0))
      | ~ there_exists(domain(X1))
      | ~ equalish(codomain(X0),domain(X1)) ),
    inference(resolution,[status(thm)],[f14,f18]) ).

fof(f27,plain,
    ( ~ there_exists(domain(c2))
    | ~ equalish(codomain(c1),domain(c2)) ),
    inference(resolution,[status(thm)],[f26,f25]) ).

fof(f28,definition,
    ( sQ0_spl
  <=> equalish(codomain(c1),domain(c2)) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f30,plain,
    ( sQ0_spl
    | ~ equalish(codomain(c1),domain(c2)) ),
    inference(component_clause,[status(thm)],[f28]) ).

fof(f31,definition,
    ( sQ1_spl
  <=> there_exists(domain(c2)) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f33,plain,
    ( sQ1_spl
    | ~ there_exists(domain(c2)) ),
    inference(component_clause,[status(thm)],[f31]) ).

fof(f34,plain,
    ( ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f27,f28,f31]) ).

fof(f35,plain,
    ( sQ0_spl
    | ~ equalish(domain(c2),codomain(c1)) ),
    inference(resolution,[status(thm)],[f30,f14]) ).

fof(f49,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f24,f35]) ).

fof(f50,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f49]) ).

fof(f51,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f33,f22]) ).

fof(f52,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f51]) ).

fof(f53,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f34,f50,f52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 13:53:35 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.40  % Refutation found
% 0.10/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.43  % Elapsed time: 0.044574 seconds
% 0.10/0.43  % CPU time: 0.114415 seconds
% 0.10/0.43  % Total memory used: 16.698 MB
% 0.10/0.43  % Net memory used: 16.227 MB
%------------------------------------------------------------------------------