↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n026.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:47:01 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   3 unt;   2 def)
%            Number of atoms       :   44 (  19 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   40 (  18   ~;  20   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    2 (   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ( c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K_H)
    | v_K != v_K_H ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ( v_K = v_K_H
    | c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [V_y] : c_Message_OinvKey(c_Message_OinvKey(V_y)) = V_y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,plain,
    ( c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K_H)
    | v_K != v_K_H ),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f5,plain,
    ( v_K = v_K_H
    | c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H) ),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f6,plain,
    ! [X0] : c_Message_OinvKey(c_Message_OinvKey(X0)) = X0,
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f7,definition,
    ( sQ0_spl
  <=> v_K = v_K_H ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f8,plain,
    ( ~ sQ0_spl
    | v_K = v_K_H ),
    inference(component_clause,[status(thm)],[f7]) ).

fof(f9,plain,
    ( sQ0_spl
    | v_K != v_K_H ),
    inference(component_clause,[status(thm)],[f7]) ).

fof(f10,definition,
    ( sQ1_spl
  <=> c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f11,plain,
    ( ~ sQ1_spl
    | c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H) ),
    inference(component_clause,[status(thm)],[f10]) ).

fof(f12,plain,
    ( sQ1_spl
    | c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K_H) ),
    inference(component_clause,[status(thm)],[f10]) ).

fof(f13,plain,
    ( ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f4,f7,f10]) ).

fof(f14,plain,
    ( sQ0_spl
    | sQ1_spl ),
    inference(split_clause,[status(thm)],[f5,f10,f7]) ).

fof(f16,plain,
    ( ~ sQ1_spl
    | c_Message_OinvKey(c_Message_OinvKey(v_K_H)) = v_K ),
    inference(paramodulation,[status(thm)],[f11,f6]) ).

fof(f17,plain,
    ( ~ sQ1_spl
    | v_K_H = v_K ),
    inference(forward_demodulation,[status(thm)],[f6,f16]) ).

fof(f18,plain,
    ( ~ sQ1_spl
    | sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f17,f9]) ).

fof(f19,plain,
    ( ~ sQ1_spl
    | sQ0_spl ),
    inference(contradiction_clause,[status(thm)],[f18]) ).

fof(f20,plain,
    ( sQ1_spl
    | ~ sQ0_spl
    | c_Message_OinvKey(v_K_H) != c_Message_OinvKey(v_K_H) ),
    inference(forward_demodulation,[status(thm)],[f8,f12]) ).

fof(f21,plain,
    ( sQ1_spl
    | ~ sQ0_spl
    | $false ),
    inference(trivial_equality_resolution,[status(thm)],[f20]) ).

fof(f22,plain,
    ( sQ1_spl
    | ~ sQ0_spl ),
    inference(contradiction_clause,[status(thm)],[f21]) ).

fof(f23,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f13,f14,f19,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV253-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n026.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep 21 08:39:07 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.38  % Drodi V4.1.1
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41  % Elapsed time: 0.040049 seconds
% 0.13/0.41  % CPU time: 0.073409 seconds
% 0.13/0.41  % Total memory used: 3.155 MB
% 0.13/0.41  % Net memory used: 3.143 MB
%------------------------------------------------------------------------------