TSTP Solution File: SWW965+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWW965+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 : Fri Sep 1 00:41:35 EDT 2023
% Result : Theorem 2.86s 1.17s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 136 ( 60 ~; 56 |; 10 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 9 sgn; 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f104,axiom,
! [X23,X24] : pred_eq_bitstring_bitstring(X23,X24),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax103) ).
fof(f132,axiom,
! [X60] :
( pred_attacker(tuple_client_B_out_6(X60))
=> pred_attacker(X60) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax131) ).
fof(f138,axiom,
! [X69] :
( pred_attacker(X69)
=> pred_attacker(tuple_client_B_in_5(X69)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax137) ).
fof(f140,axiom,
! [X71] :
( pred_attacker(X71)
=> pred_attacker(tuple_client_B_in_3(X71)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax139) ).
fof(f142,axiom,
! [X73] :
( pred_attacker(X73)
=> pred_attacker(tuple_client_B_in_2(X73)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax141) ).
fof(f172,axiom,
pred_attacker(name_A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax171) ).
fof(f185,axiom,
! [X115,X116,X117,X118] :
( ( pred_attacker(tuple_client_B_in_2(X118))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X118,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(X116))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X116,name_skB)))
& pred_attacker(tuple_client_B_in_5(X117))
& pred_eq_bitstring_bitstring(name_Nb(X115),constr_adec(X117,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax184) ).
fof(f188,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f189,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[],[f188]) ).
fof(f201,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(rectify,[],[f104]) ).
fof(f227,plain,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f132]) ).
fof(f233,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
inference(rectify,[],[f138]) ).
fof(f235,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
inference(rectify,[],[f140]) ).
fof(f237,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
inference(rectify,[],[f142]) ).
fof(f263,plain,
! [X0,X1,X2,X3] :
( ( pred_attacker(tuple_client_B_in_2(X3))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(X1))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
& pred_attacker(tuple_client_B_in_5(X2))
& pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(rectify,[],[f185]) ).
fof(f266,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f189]) ).
fof(f299,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(ennf_transformation,[],[f227]) ).
fof(f306,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f233]) ).
fof(f308,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f235]) ).
fof(f310,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f237]) ).
fof(f344,plain,
! [X0,X1,X2,X3] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) ),
inference(ennf_transformation,[],[f263]) ).
fof(f345,plain,
! [X0,X1,X2,X3] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) ),
inference(flattening,[],[f344]) ).
fof(f453,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f201]) ).
fof(f481,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(cnf_transformation,[],[f299]) ).
fof(f487,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f306]) ).
fof(f489,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f491,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f310]) ).
fof(f521,plain,
pred_attacker(name_A),
inference(cnf_transformation,[],[f172]) ).
fof(f533,plain,
! [X2,X3,X0,X1] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) ),
inference(cnf_transformation,[],[f345]) ).
fof(f536,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f266]) ).
cnf(c_152,plain,
pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f453]) ).
cnf(c_180,plain,
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f481]) ).
cnf(c_186,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_5(X0)) ),
inference(cnf_transformation,[],[f487]) ).
cnf(c_188,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_3(X0)) ),
inference(cnf_transformation,[],[f489]) ).
cnf(c_190,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(cnf_transformation,[],[f491]) ).
cnf(c_220,plain,
pred_attacker(name_A),
inference(cnf_transformation,[],[f521]) ).
cnf(c_232,plain,
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X0,constr_pkey(name_skS))))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(tuple_client_B_in_2(X0))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_235,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f536]) ).
cnf(c_243,plain,
( ~ pred_attacker(name_A)
| pred_attacker(tuple_client_B_in_3(name_A)) ),
inference(instantiation,[status(thm)],[c_188]) ).
cnf(c_244,plain,
( ~ pred_attacker(name_A)
| pred_attacker(tuple_client_B_in_5(name_A)) ),
inference(instantiation,[status(thm)],[c_186]) ).
cnf(c_323,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(prop_impl_just,[status(thm)],[c_190]) ).
cnf(c_634,plain,
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X0,constr_pkey(name_skS))))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(bin_hyper_res,[status(thm)],[c_232,c_323]) ).
cnf(c_668,plain,
( ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X1,name_skB))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X2,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(tuple_client_B_in_3(X2))
| ~ pred_attacker(X3)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_634,c_152]) ).
cnf(c_1203,plain,
( ~ pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X2)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_668,c_152,c_152]) ).
cnf(c_1204,plain,
( ~ pred_attacker(tuple_client_B_in_5(name_A))
| ~ pred_attacker(tuple_client_B_in_3(name_A))
| ~ pred_attacker(name_A)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(instantiation,[status(thm)],[c_1203]) ).
cnf(c_1205,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(global_subsumption_just,[status(thm)],[c_1203,c_220,c_243,c_244,c_1204]) ).
cnf(c_5090,plain,
pred_attacker(name_objective),
inference(superposition,[status(thm)],[c_1205,c_180]) ).
cnf(c_5091,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5090,c_235]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW965+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Aug 27 22:51:44 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.86/1.17 % SZS status Started for theBenchmark.p
% 2.86/1.17 % SZS status Theorem for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.86/1.17
% 2.86/1.17 ------ iProver source info
% 2.86/1.17
% 2.86/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.86/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.86/1.17 git: non_committed_changes: false
% 2.86/1.17 git: last_make_outside_of_git: false
% 2.86/1.17
% 2.86/1.17 ------ Parsing...
% 2.86/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.86/1.17
% 2.86/1.17 ------ 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
% 2.86/1.17
% 2.86/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.86/1.17
% 2.86/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.86/1.17 ------ Proving...
% 2.86/1.17 ------ Problem Properties
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 clauses 184
% 2.86/1.17 conjectures 1
% 2.86/1.17 EPR 104
% 2.86/1.17 Horn 183
% 2.86/1.17 unary 125
% 2.86/1.17 binary 43
% 2.86/1.17 lits 260
% 2.86/1.17 lits eq 105
% 2.86/1.17 fd_pure 0
% 2.86/1.17 fd_pseudo 0
% 2.86/1.17 fd_cond 1
% 2.86/1.17 fd_pseudo_cond 0
% 2.86/1.17 AC symbols 1
% 2.86/1.17
% 2.86/1.17 ------ Schedule dynamic 5 is on
% 2.86/1.17
% 2.86/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------
% 2.86/1.17 Current options:
% 2.86/1.17 ------
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------ Proving...
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 % SZS status Theorem for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.86/1.17
% 2.86/1.17
%------------------------------------------------------------------------------