↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   40 (   4 unt;   5 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   93 (  43   ~;  45   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   6 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

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

fof(f2,axiom,
    ! [X] :
      ( ~ big_r(X)
      | ~ big_g(X)
      | ~ big_f(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X] :
      ( big_f(X)
      | ~ big_p(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X] :
      ( big_g(X)
      | ~ big_p(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X] :
      ( big_p(b)
      | big_q(X)
      | ~ big_p(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ! [X] :
      ( big_r(b)
      | big_q(X)
      | ~ big_p(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,negated_conjecture,
    ! [X] :
      ( ~ big_p(X)
      | ~ big_q(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,plain,
    big_p(a),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ big_r(X0)
      | ~ big_g(X0)
      | ~ big_f(X0) ),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f10,plain,
    ! [X0] :
      ( big_f(X0)
      | ~ big_p(X0) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f11,plain,
    ! [X0] :
      ( big_g(X0)
      | ~ big_p(X0) ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f12,plain,
    ( big_p(b)
    | ! [X] :
        ( big_q(X)
        | ~ big_p(X) ) ),
    inference(miniscoping,[status(thm)],[f5]) ).

fof(f13,plain,
    ! [X0] :
      ( big_p(b)
      | big_q(X0)
      | ~ big_p(X0) ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f14,plain,
    ( big_r(b)
    | ! [X] :
        ( big_q(X)
        | ~ big_p(X) ) ),
    inference(miniscoping,[status(thm)],[f6]) ).

fof(f15,plain,
    ! [X0] :
      ( big_r(b)
      | big_q(X0)
      | ~ big_p(X0) ),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ big_p(X0)
      | ~ big_q(X0) ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f17,definition,
    ! [X0] :
      ( sQ0_spl
    <=> ( big_q(X0)
        | ~ big_p(X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f18,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | big_q(X0)
      | ~ big_p(X0) ),
    inference(component_clause,[status(thm)],[f17]) ).

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

fof(f21,plain,
    ( ~ sQ1_spl
    | big_p(b) ),
    inference(component_clause,[status(thm)],[f20]) ).

fof(f23,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f13,f17,f20]) ).

fof(f24,definition,
    ( sQ2_spl
  <=> big_r(b) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f25,plain,
    ( ~ sQ2_spl
    | big_r(b) ),
    inference(component_clause,[status(thm)],[f24]) ).

fof(f27,plain,
    ( sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f15,f17,f24]) ).

fof(f28,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | ~ big_p(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f18,f16]) ).

fof(f29,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f8,f28]) ).

fof(f30,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f29]) ).

fof(f31,plain,
    ( ~ sQ2_spl
    | ~ big_g(b)
    | ~ big_f(b) ),
    inference(resolution,[status(thm)],[f25,f9]) ).

fof(f32,definition,
    ( sQ3_spl
  <=> big_f(b) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f34,plain,
    ( sQ3_spl
    | ~ big_f(b) ),
    inference(component_clause,[status(thm)],[f32]) ).

fof(f35,definition,
    ( sQ4_spl
  <=> big_g(b) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f37,plain,
    ( sQ4_spl
    | ~ big_g(b) ),
    inference(component_clause,[status(thm)],[f35]) ).

fof(f38,plain,
    ( ~ sQ2_spl
    | ~ sQ4_spl
    | ~ sQ3_spl ),
    inference(split_clause,[status(thm)],[f31,f32,f35,f24]) ).

fof(f39,plain,
    ( sQ3_spl
    | ~ big_p(b) ),
    inference(resolution,[status(thm)],[f10,f34]) ).

fof(f40,plain,
    ( sQ3_spl
    | ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f39,f21]) ).

fof(f41,plain,
    ( sQ3_spl
    | ~ sQ1_spl ),
    inference(contradiction_clause,[status(thm)],[f40]) ).

fof(f42,plain,
    ( sQ4_spl
    | ~ big_p(b) ),
    inference(resolution,[status(thm)],[f11,f37]) ).

fof(f44,plain,
    ( sQ4_spl
    | ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f42,f21]) ).

fof(f45,plain,
    ( sQ4_spl
    | ~ sQ1_spl ),
    inference(contradiction_clause,[status(thm)],[f44]) ).

fof(f46,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f23,f27,f30,f38,f41,f45]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN055-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n006.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Mon Sep 21 10:40:42 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.46  % Drodi V4.1.1
% 0.18/0.48  % Refutation found
% 0.18/0.48  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.50  % Elapsed time: 0.049282 seconds
% 0.18/0.50  % CPU time: 0.126671 seconds
% 0.18/0.50  % Total memory used: 12.905 MB
% 0.18/0.50  % Net memory used: 12.480 MB
%------------------------------------------------------------------------------