TSTP Solution File: SWV253-2 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWV253-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:46:23 EDT 2024

% Result   : Unsatisfiable 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   3 unt;   0 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,
    ( v_K != v_K_H
    | c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K_H) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,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(f3,axiom,
    ! [V_y] : c_Message_OinvKey(c_Message_OinvKey(V_y)) = V_y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

fof(f7,plain,
    ( spl0_0
  <=> v_K = v_K_H ),
    introduced(split_symbol_definition) ).

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

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

fof(f10,plain,
    ( spl0_1
  <=> c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H) ),
    introduced(split_symbol_definition) ).

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

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

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

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

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

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

fof(f17,plain,
    ( $false
    | spl0_0
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f16,f9]) ).

fof(f18,plain,
    ( spl0_0
    | ~ spl0_1 ),
    inference(contradiction_clause,[status(thm)],[f17]) ).

fof(f19,plain,
    ( c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K)
    | ~ spl0_0
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f8,f12]) ).

fof(f20,plain,
    ( $false
    | ~ spl0_0
    | spl0_1 ),
    inference(trivial_equality_resolution,[status(esa)],[f19]) ).

fof(f21,plain,
    ( ~ spl0_0
    | spl0_1 ),
    inference(contradiction_clause,[status(thm)],[f20]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : SWV253-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Apr 30 00:57:18 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.022763 seconds
% 0.13/0.38  % CPU time: 0.025123 seconds
% 0.13/0.38  % Total memory used: 8.986 MB
% 0.13/0.38  % Net memory used: 8.858 MB
%------------------------------------------------------------------------------