↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SYN082-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 : 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 03:15:11 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [Y] :
      ( big_f(Y,f(a))
      | ~ big_f(Y,b)
      | big_f(a,f(a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f5,negated_conjecture,
    ! [X] :
      ( ~ big_f(a,f(a))
      | ~ big_f(a,X)
      | big_f(g(X),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,negated_conjecture,
    ! [X] :
      ( ~ big_f(a,f(a))
      | ~ big_f(a,X)
      | ~ big_f(g(X),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,plain,
    ! [X0] :
      ( big_f(X0,f(a))
      | ~ big_f(X0,b)
      | big_f(a,f(a)) ),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f10,plain,
    ( big_f(a,b)
    | big_f(a,f(a)) ),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f15,plain,
    ( ~ big_f(a,f(a))
    | ! [X] :
        ( ~ big_f(a,X)
        | big_f(g(X),X) ) ),
    inference(miniscoping,[status(thm)],[f5]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ big_f(a,f(a))
      | ~ big_f(a,X0)
      | big_f(g(X0),X0) ),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f21,plain,
    ( ~ big_f(a,f(a))
    | ! [X] :
        ( ~ big_f(a,X)
        | ~ big_f(g(X),X) ) ),
    inference(miniscoping,[status(thm)],[f8]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ big_f(a,f(a))
      | ~ big_f(a,X0)
      | ~ big_f(g(X0),X0) ),
    inference(cnf_transformation,[status(thm)],[f21]) ).

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

fof(f24,plain,
    ( ~ sQ0_spl
    | big_f(a,f(a)) ),
    inference(component_clause,[status(thm)],[f23]) ).

fof(f25,plain,
    ( sQ0_spl
    | ~ big_f(a,f(a)) ),
    inference(component_clause,[status(thm)],[f23]) ).

fof(f26,definition,
    ! [X0] :
      ( sQ1_spl
    <=> ( big_f(X0,f(a))
        | ~ big_f(X0,b) ) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f27,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | big_f(X0,f(a))
      | ~ big_f(X0,b) ),
    inference(component_clause,[status(thm)],[f26]) ).

fof(f29,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f9,f23,f26]) ).

fof(f30,definition,
    ( sQ2_spl
  <=> big_f(a,b) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f31,plain,
    ( ~ sQ2_spl
    | big_f(a,b) ),
    inference(component_clause,[status(thm)],[f30]) ).

fof(f33,plain,
    ( sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f10,f23,f30]) ).

fof(f34,definition,
    ! [X0] :
      ( sQ3_spl
    <=> ( ~ big_f(a,X0)
        | big_f(g(X0),X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f35,plain,
    ! [X0] :
      ( ~ sQ3_spl
      | ~ big_f(a,X0)
      | big_f(g(X0),X0) ),
    inference(component_clause,[status(thm)],[f34]) ).

fof(f39,plain,
    ( ~ sQ0_spl
    | sQ3_spl ),
    inference(split_clause,[status(thm)],[f16,f34,f23]) ).

fof(f40,definition,
    ! [X0] :
      ( sQ4_spl
    <=> ( ~ big_f(a,X0)
        | ~ big_f(g(X0),X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f41,plain,
    ! [X0] :
      ( ~ sQ4_spl
      | ~ big_f(a,X0)
      | ~ big_f(g(X0),X0) ),
    inference(component_clause,[status(thm)],[f40]) ).

fof(f45,plain,
    ( ~ sQ0_spl
    | sQ4_spl ),
    inference(split_clause,[status(thm)],[f22,f40,f23]) ).

fof(f46,plain,
    ( ~ sQ2_spl
    | ~ sQ3_spl
    | ~ sQ4_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f31,f47]) ).

fof(f47,plain,
    ! [X0] :
      ( ~ sQ3_spl
      | ~ sQ4_spl
      | ~ big_f(a,X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f35,f41]) ).

fof(f48,plain,
    ( ~ sQ2_spl
    | ~ sQ3_spl
    | ~ sQ4_spl ),
    inference(contradiction_clause,[status(thm)],[f46]) ).

fof(f49,plain,
    ( ~ sQ1_spl
    | ~ sQ2_spl
    | big_f(a,f(a)) ),
    inference(resolution,[status(thm)],[f31,f27]) ).

fof(f50,plain,
    ( ~ sQ1_spl
    | ~ sQ2_spl
    | sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f49,f25]) ).

fof(f51,plain,
    ( ~ sQ1_spl
    | ~ sQ2_spl
    | sQ0_spl ),
    inference(contradiction_clause,[status(thm)],[f50]) ).

fof(f52,plain,
    ( ~ sQ0_spl
    | ~ sQ3_spl
    | ~ sQ4_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f24,f47]) ).

fof(f53,plain,
    ( ~ sQ0_spl
    | ~ sQ3_spl
    | ~ sQ4_spl ),
    inference(contradiction_clause,[status(thm)],[f52]) ).

fof(f54,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f29,f33,f39,f45,f48,f51,f53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN082-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.36  % Computer : n019.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:42:52 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.42  % Elapsed time: 0.048387 seconds
% 0.09/0.42  % CPU time: 0.117018 seconds
% 0.09/0.42  % Total memory used: 16.614 MB
% 0.09/0.42  % Net memory used: 16.098 MB
%------------------------------------------------------------------------------