↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n003.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:05 PM UTC 2026

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

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

fof(f2,negated_conjecture,
    ! [X,Y] :
      ( big_p(Y)
      | big_p(c)
      | big_p(X)
      | ~ big_p(a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ big_p(c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f9,plain,
    ( ! [Y] : big_p(Y)
    | big_p(c)
    | ! [X] : big_p(X)
    | ~ big_p(a) ),
    inference(miniscoping,[status(thm)],[f2]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( big_p(X1)
      | big_p(c)
      | big_p(X0)
      | ~ big_p(a) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f12,plain,
    ~ big_p(c),
    inference(cnf_transformation,[status(thm)],[f4]) ).

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

fof(f20,plain,
    ( sQ0_spl
    | ~ big_p(a) ),
    inference(component_clause,[status(thm)],[f18]) ).

fof(f21,definition,
    ! [X0] :
      ( sQ1_spl
    <=> big_p(X0) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | big_p(X0) ),
    inference(component_clause,[status(thm)],[f21]) ).

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

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

fof(f27,plain,
    ( sQ2_spl
    | sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f10,f18,f21,f24]) ).

fof(f41,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f22]) ).

fof(f42,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f41]) ).

fof(f43,plain,
    ( ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f25]) ).

fof(f44,plain,
    ~ sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f43]) ).

fof(f45,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f8,f20]) ).

fof(f46,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f45]) ).

fof(f47,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f27,f42,f44,f46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN063-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n003.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 10:43:16 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % 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.41  % Elapsed time: 0.037358 seconds
% 0.10/0.41  % CPU time: 0.103844 seconds
% 0.10/0.41  % Total memory used: 13.993 MB
% 0.10/0.41  % Net memory used: 13.524 MB
%------------------------------------------------------------------------------