↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWV001-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 : 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 02:46:24 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   54 (   8 unt;   7 def)
%            Number of atoms       :  123 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  128 (  59   ~;  62   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   8 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   47 (  47   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X,Y,Z] :
      ( q2(X,Y,Z)
      | ~ less_or_equalish(X,Y)
      | ~ q1(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X,Y,Z] :
      ( q3(X,Y,Z)
      | less_or_equalish(X,Y)
      | ~ q1(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X,Y,Z] :
      ( q4(X,Y,Y)
      | ~ q2(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [X,Y,Z] :
      ( q4(X,Y,X)
      | ~ q3(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [X] : less_or_equalish(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ! [X,Y] :
      ( less_or_equalish(Y,X)
      | less_or_equalish(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    q1(a,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ! [W] :
      ( ~ less_or_equalish(W,a)
      | ~ less_or_equalish(b,W)
      | ~ less_or_equalish(a,W)
      | ~ q4(a,b,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f14,negated_conjecture,
    ! [W] :
      ( ~ less_or_equalish(W,b)
      | ~ less_or_equalish(b,W)
      | ~ less_or_equalish(a,W)
      | ~ q4(a,b,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f19,plain,
    ! [X0,X1,X2] :
      ( q2(X0,X1,X2)
      | ~ less_or_equalish(X0,X1)
      | ~ q1(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( q3(X0,X1,X2)
      | less_or_equalish(X0,X1)
      | ~ q1(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f21,plain,
    ! [X,Y] :
      ( q4(X,Y,Y)
      | ! [Z] : ~ q2(X,Y,Z) ),
    inference(miniscoping,[status(thm)],[f5]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( q4(X0,X1,X1)
      | ~ q2(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f21]) ).

fof(f23,plain,
    ! [X,Y] :
      ( q4(X,Y,X)
      | ! [Z] : ~ q3(X,Y,Z) ),
    inference(miniscoping,[status(thm)],[f6]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( q4(X0,X1,X0)
      | ~ q3(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f23]) ).

fof(f25,plain,
    ! [X0] : less_or_equalish(X0,X0),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( less_or_equalish(X1,X0)
      | less_or_equalish(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f31,plain,
    q1(a,b,c),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ less_or_equalish(X0,a)
      | ~ less_or_equalish(b,X0)
      | ~ less_or_equalish(a,X0)
      | ~ q4(a,b,X0) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f33,plain,
    ! [X0] :
      ( ~ less_or_equalish(X0,b)
      | ~ less_or_equalish(b,X0)
      | ~ less_or_equalish(a,X0)
      | ~ q4(a,b,X0) ),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f41,plain,
    ! [X0,X1,X2] :
      ( q4(X0,X1,X1)
      | ~ less_or_equalish(X0,X1)
      | ~ q1(X0,X1,X2) ),
    inference(resolution,[status(thm)],[f19,f22]) ).

fof(f43,plain,
    ( q4(a,b,b)
    | ~ less_or_equalish(a,b) ),
    inference(resolution,[status(thm)],[f41,f31]) ).

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

fof(f46,plain,
    ( sQ0_spl
    | ~ less_or_equalish(a,b) ),
    inference(component_clause,[status(thm)],[f44]) ).

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

fof(f48,plain,
    ( ~ sQ1_spl
    | q4(a,b,b) ),
    inference(component_clause,[status(thm)],[f47]) ).

fof(f50,plain,
    ( sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f43,f44,f47]) ).

fof(f58,plain,
    ! [X0] :
      ( sQ0_spl
      | q3(a,b,X0)
      | ~ q1(a,b,X0) ),
    inference(resolution,[status(thm)],[f46,f20]) ).

fof(f60,plain,
    ( sQ0_spl
    | less_or_equalish(b,a) ),
    inference(resolution,[status(thm)],[f46,f29]) ).

fof(f66,plain,
    ! [X0] :
      ( sQ0_spl
      | q4(a,b,a)
      | ~ q1(a,b,X0) ),
    inference(resolution,[status(thm)],[f58,f24]) ).

fof(f67,definition,
    ! [X0] :
      ( sQ3_spl
    <=> ~ q1(a,b,X0) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f68,plain,
    ! [X0] :
      ( ~ sQ3_spl
      | ~ q1(a,b,X0) ),
    inference(component_clause,[status(thm)],[f67]) ).

fof(f70,definition,
    ( sQ4_spl
  <=> q4(a,b,a) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f71,plain,
    ( ~ sQ4_spl
    | q4(a,b,a) ),
    inference(component_clause,[status(thm)],[f70]) ).

fof(f73,plain,
    ( sQ0_spl
    | sQ4_spl
    | sQ3_spl ),
    inference(split_clause,[status(thm)],[f66,f67,f70,f44]) ).

fof(f74,plain,
    ( ~ sQ1_spl
    | ~ less_or_equalish(b,b)
    | ~ less_or_equalish(b,b)
    | ~ less_or_equalish(a,b) ),
    inference(resolution,[status(thm)],[f48,f33]) ).

fof(f76,definition,
    ( sQ5_spl
  <=> less_or_equalish(b,b) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f78,plain,
    ( sQ5_spl
    | ~ less_or_equalish(b,b) ),
    inference(component_clause,[status(thm)],[f76]) ).

fof(f79,plain,
    ( ~ sQ1_spl
    | ~ sQ5_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f74,f44,f76,f47]) ).

fof(f80,definition,
    ( sQ6_spl
  <=> less_or_equalish(b,a) ),
    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).

fof(f82,plain,
    ( sQ6_spl
    | ~ less_or_equalish(b,a) ),
    inference(component_clause,[status(thm)],[f80]) ).

fof(f97,plain,
    ( ~ sQ3_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f31,f68]) ).

fof(f98,plain,
    ~ sQ3_spl,
    inference(contradiction_clause,[status(thm)],[f97]) ).

fof(f99,plain,
    ( ~ sQ4_spl
    | ~ less_or_equalish(a,a)
    | ~ less_or_equalish(b,a)
    | ~ less_or_equalish(a,a) ),
    inference(resolution,[status(thm)],[f71,f32]) ).

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

fof(f102,plain,
    ( sQ7_spl
    | ~ less_or_equalish(a,a) ),
    inference(component_clause,[status(thm)],[f100]) ).

fof(f103,plain,
    ( ~ sQ4_spl
    | ~ sQ6_spl
    | ~ sQ7_spl ),
    inference(split_clause,[status(thm)],[f99,f100,f80,f70]) ).

fof(f104,plain,
    ( sQ5_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f78,f25]) ).

fof(f105,plain,
    sQ5_spl,
    inference(contradiction_clause,[status(thm)],[f104]) ).

fof(f106,plain,
    ( sQ7_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f102,f25]) ).

fof(f107,plain,
    sQ7_spl,
    inference(contradiction_clause,[status(thm)],[f106]) ).

fof(f114,plain,
    ( sQ6_spl
    | sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f82,f60]) ).

fof(f115,plain,
    ( sQ6_spl
    | sQ0_spl ),
    inference(contradiction_clause,[status(thm)],[f114]) ).

fof(f116,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f50,f73,f79,f98,f103,f105,f107,f115]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV001-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 : n007.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 : Mon Sep 21 08:24:35 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Drodi V4.1.1
% 0.14/0.40  % Refutation found
% 0.14/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.42  % Elapsed time: 0.055954 seconds
% 0.14/0.42  % CPU time: 0.163084 seconds
% 0.14/0.42  % Total memory used: 17.357 MB
% 0.14/0.42  % Net memory used: 16.921 MB
%------------------------------------------------------------------------------