↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWW970+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n004.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 : Sun Sep 27 09:14:58 AM UTC 2026

% Result   : Theorem 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  11 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   19 (  10   ~;   5   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   5 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax79,axiom,
    ! [VAR_X_67,VAR_Y_68] : pred_eq_bitstring_bitstring(VAR_X_67,VAR_Y_68),
    file('theBenchmark.p',ax79) ).

fof(ax93,axiom,
    ! [VAR_V_112] :
      ( pred_attacker(tuple_client_B_out_2(VAR_V_112))
     => pred_attacker(VAR_V_112) ),
    file('theBenchmark.p',ax93) ).

fof(ax94,axiom,
    ! [VAR_V_115] :
      ( pred_attacker(VAR_V_115)
     => pred_attacker(tuple_client_B_in_1(VAR_V_115)) ),
    file('theBenchmark.p',ax94) ).

fof(ax135,axiom,
    ! [VAR_ENC_A_KAB_T_330X30] :
      ( ( pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(VAR_ENC_A_KAB_T_330X30,name_Kbs))) )
     => pred_attacker(tuple_client_B_out_2(name_objective)) ),
    file('theBenchmark.p',ax135) ).

fof(co0,conjecture,
    pred_attacker(name_objective),
    file('theBenchmark.p',co0) ).

fof(co0_neg,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(assume_negation,[status(cth)],[co0]) ).

cnf(c_79,plain,
    pred_eq_bitstring_bitstring(A,B),
    inference(clausify,[status(thm)],[ax79]) ).

cnf(c_93,plain,
    ( pred_attacker(A)
    | ~ pred_attacker(tuple_client_B_out_2(A)) ),
    inference(clausify,[status(thm)],[ax93]) ).

cnf(c_94,plain,
    ( pred_attacker(tuple_client_B_in_1(A))
    | ~ pred_attacker(A) ),
    inference(clausify,[status(thm)],[ax94]) ).

cnf(c_126,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_attacker(tuple_client_B_in_1(A))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(A,name_Kbs))) ),
    inference(clausify,[status(thm)],[ax135]) ).

fof(ax132,axiom,
    pred_attacker(name_A),
    file('theBenchmark.p',ax132) ).

cnf(c_246,plain,
    pred_attacker(name_A),
    inference(clausify,[status(thm)],[ax132]) ).

cnf(c_247,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(clausify,[status(thm)],[co0_neg]) ).

cnf(c_261,negated_conjecture,
    ~ pred_attacker(tuple_client_B_out_2(name_objective)),
    inference(resolve,[status(thm)],[c_93,c_247]) ).

cnf(c_269,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_attacker(tuple_client_B_in_1(A)) ),
    inference(resolve,[status(thm)],[c_79,c_126]) ).

cnf(c_266,plain,
    ~ pred_attacker(tuple_client_B_in_1(A)),
    inference(resolve,[status(thm)],[c_261,c_269]) ).

cnf(c_267,plain,
    ~ pred_attacker(A),
    inference(resolve,[status(thm)],[c_266,c_94]) ).

cnf(c_268,plain,
    $false,
    inference(resolve,[status(thm)],[c_267,c_246]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW970+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 16:39:07 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 2171799 was started by sandbox on n004,
% 0.10/0.37  % Sat Sep 26 16:39:07 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.10/0.38  
% 0.10/0.38  % SInE: 75 to sos, 63 to usable, of 138 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.13/0.39  
% 0.13/0.39  % SZS status Theorem for theBenchmark
% 0.13/0.39  
% 0.13/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.39  % Length of proof is 15.
% 0.13/0.39  % Level of proof is 5.
% 0.13/0.39  % Maximum clause weight is 107.000.
% 0.13/0.39  % Given clauses 4.
% 0.13/0.39  
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------