↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWW970+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n012.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 : Fri Sep 25 03:30:36 PM UTC 2026

% Result   : Theorem 1.91s 1.07s
% Output   : CNFRefutation 1.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  15 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  24   ~;  19   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            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   :   22 (   0 sgn  22   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f80,axiom,
    ! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).

fof(f94,axiom,
    ! [X0] :
      ( pred_attacker(tuple_client_B_out_2(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax93) ).

fof(f95,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_client_B_in_1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax94) ).

fof(f133,axiom,
    pred_attacker(name_A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax132) ).

fof(f136,axiom,
    ! [X0] :
      ( ( pred_attacker(tuple_client_B_in_1(X0))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs))) )
     => pred_attacker(tuple_client_B_out_2(name_objective)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax135) ).

fof(f139,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).

fof(f140,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(negated_conjecture,[status(cth)],[f139]) ).

fof(f141,plain,
    ~ pred_attacker(name_objective),
    inference(flattening,[],[f140]) ).

fof(f155,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_client_B_out_2(X0))
      | pred_attacker(X0) ),
    inference(ennf_transformation,[],[f94]) ).

fof(f156,plain,
    ! [X0] :
      ( ~ pred_attacker(X0)
      | pred_attacker(tuple_client_B_in_1(X0)) ),
    inference(ennf_transformation,[],[f95]) ).

fof(f199,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_client_B_in_1(X0))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
      | pred_attacker(tuple_client_B_out_2(name_objective)) ),
    inference(ennf_transformation,[],[f136]) ).

fof(f200,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_client_B_in_1(X0))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
      | pred_attacker(tuple_client_B_out_2(name_objective)) ),
    inference(flattening,[],[f199]) ).

fof(f282,plain,
    ! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
    inference(cnf_transformation,[],[f80]) ).

fof(f296,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_client_B_out_2(X0))
      | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f155]) ).

fof(f297,plain,
    ! [X0] :
      ( ~ pred_attacker(X0)
      | pred_attacker(tuple_client_B_in_1(X0)) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f335,plain,
    pred_attacker(name_A),
    inference(cnf_transformation,[],[f133]) ).

fof(f337,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_client_B_in_1(X0))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
      | pred_attacker(tuple_client_B_out_2(name_objective)) ),
    inference(cnf_transformation,[],[f200]) ).

fof(f340,plain,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f141]) ).

tcf(c_128,plain,
    ! [X0: $i,X1: $i] : pred_eq_bitstring_bitstring(X0,X1),
    inference(cnf_transformation,[],[f282]) ).

tcf(c_142,plain,
    ! [X0: $i] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_client_B_out_2(X0)) ),
    inference(cnf_transformation,[],[f296]) ).

tcf(c_143,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_client_B_in_1(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f297]) ).

tcf(c_181,plain,
    pred_attacker(name_A),
    inference(cnf_transformation,[],[f335]) ).

tcf(c_183,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_client_B_out_2(name_objective))
      | ~ pred_attacker(tuple_client_B_in_1(X0))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs))) ),
    inference(cnf_transformation,[],[f337]) ).

tcf(c_186,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f340]) ).

tcf(c_245,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_client_B_in_1(X0))
      | ~ pred_attacker(X0) ),
    inference(prop_impl_just,[status(thm)],[c_143]) ).

tcf(c_486,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_client_B_out_2(name_objective))
      | ~ pred_attacker(X0)
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs))) ),
    inference(bin_hyper_res,[status(thm)],[c_183,c_245]) ).

tcf(c_512,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_client_B_out_2(name_objective))
      | ~ pred_attacker(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_486,c_128]) ).

tcf(c_513,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_attacker(name_A) ),
    inference(instantiation,[status(thm)],[c_512]) ).

tcf(c_514,plain,
    pred_attacker(tuple_client_B_out_2(name_objective)),
    inference(global_subsumption_just,[status(thm)],[c_512,c_181,c_513]) ).

tcf(c_2025,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(demodulation,[status(thm)],[c_186]) ).

tcf(c_3798,plain,
    pred_attacker(name_objective),
    inference(superposition,[status(thm)],[c_514,c_142]) ).

tcf(c_3799,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3798,c_2025]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWW970+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.02  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.31  % Computer : n012.cluster.edu
% 0.03/0.31  % Model    : x86_64 x86_64
% 0.03/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31  % Memory   : 8046.5625MB
% 0.03/0.31  % OS       : Linux 6.8.0-71-generic
% 0.03/0.31  % CPULimit : 300
% 0.03/0.31  % WCLimit  : 300
% 0.03/0.31  % DateTime : Thu Sep 24 23:17:35 UTC 2026
% 0.03/0.31  % CPUTime  : 
% 0.03/0.31  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34  
% 0.07/0.34  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.34  
% 0.07/0.34  % Detected problem language: tptp
% 0.07/0.34  % Proving...
% 1.91/1.07  % SZS status Started for theBenchmark.p
% 1.91/1.07  % SZS status Theorem for theBenchmark.p
% 1.91/1.07  
% 1.91/1.07  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.91/1.07  
% 1.91/1.07  % ------  iProver source info
% 1.91/1.07  
% 1.91/1.07  % git: date: 2026-07-19 20:42:38 +0200
% 1.91/1.07  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.91/1.07  % git: non_committed_changes: false
% 1.91/1.07  
% 1.91/1.07  % ------ Parsing...
% 1.91/1.07  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.91/1.07  
% 1.91/1.07  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.91/1.07  
% 1.91/1.07  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.91/1.07  
% 1.91/1.07  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.91/1.07  % ------ Proving...
% 1.91/1.07  % ------ Problem Properties 
% 1.91/1.07  
% 1.91/1.07  % 
% 1.91/1.07  % clauses                               135
% 1.91/1.07  % conjectures                           1
% 1.91/1.07  % EPR                                   78
% 1.91/1.07  % Horn                                  135
% 1.91/1.07  % unary                                 93
% 1.91/1.07  % binary                                30
% 1.91/1.07  % lits                                  198
% 1.91/1.07  % lits eq                               79
% 1.91/1.07  % fd_pure                               0
% 1.91/1.07  % fd_pseudo                             0
% 1.91/1.07  % fd_cond                               0
% 1.91/1.07  % fd_pseudo_cond                        0
% 1.91/1.07  % AC symbols                            0
% 1.91/1.07  
% 1.91/1.07  % ------ Schedule dynamic 5 is on 
% 1.91/1.07  
% 1.91/1.07  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.91/1.07  
% 1.91/1.07  
% 1.91/1.07  % ------ 
% 1.91/1.07  % Current options:
% 1.91/1.07  % ------ 
% 1.91/1.07  
% 1.91/1.07  
% 1.91/1.07  % 
% 1.91/1.07  
% 1.91/1.07  % ------ Proving...
% 1.91/1.07  % 
% 1.91/1.07  
% 1.91/1.07  % SZS status Theorem for theBenchmark.p
% 1.91/1.07  
% 1.91/1.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.91/1.08  
% 1.91/1.08  
%------------------------------------------------------------------------------