TSTP Solution File: SWV237+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV237+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 May 3 03:13:48 EDT 2024
% Result : Theorem 3.67s 1.20s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',enc_dec_cancel) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( p(X2)
& p(X1)
& p(X0) )
=> p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_a_stored_comms_key) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( p(X2)
& p(X1)
& p(X0) )
=> p(enc(tc,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_clear_key_as_Tcomms_key) ).
fof(f16,axiom,
! [X0,X1,X2] :
( ( p(X2)
& p(X1)
& p(X0) )
=> p(enc(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',attacker_can_encrypt) ).
fof(f17,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intruder_knows_1) ).
fof(f24,axiom,
p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intruder_knows_8) ).
fof(f25,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f26,negated_conjecture,
~ p(enc(pp,a)),
inference(negated_conjecture,[],[f25]) ).
fof(f27,plain,
~ p(enc(pp,a)),
inference(flattening,[],[f26]) ).
fof(f37,plain,
! [X0,X1,X2] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f38,plain,
! [X0,X1,X2] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( p(enc(tc,X0))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f40,plain,
! [X0,X1,X2] :
( p(enc(tc,X0))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(flattening,[],[f39]) ).
fof(f51,plain,
! [X0,X1,X2] :
( p(enc(X0,X1))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f52,plain,
! [X0,X1,X2] :
( p(enc(X0,X1))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
fof(f61,plain,
! [X2,X0,X1] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f62,plain,
! [X2,X0,X1] :
( p(enc(tc,X0))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f68,plain,
! [X2,X0,X1] :
( p(enc(X0,X1))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f69,plain,
p(enc(tmk,pp)),
inference(cnf_transformation,[],[f17]) ).
fof(f76,plain,
p(a),
inference(cnf_transformation,[],[f24]) ).
fof(f77,plain,
~ p(enc(pp,a)),
inference(cnf_transformation,[],[f27]) ).
cnf(c_49,plain,
enc(i(X0),enc(X0,X1)) = X1,
inference(cnf_transformation,[],[f53]) ).
cnf(c_57,plain,
( ~ p(X0)
| ~ p(X1)
| ~ p(X2)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_58,plain,
( ~ p(X0)
| ~ p(X1)
| ~ p(X2)
| p(enc(tc,X0)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_64,plain,
( ~ p(X0)
| ~ p(X1)
| ~ p(X2)
| p(enc(X0,X1)) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_65,plain,
p(enc(tmk,pp)),
inference(cnf_transformation,[],[f69]) ).
cnf(c_72,plain,
p(a),
inference(cnf_transformation,[],[f76]) ).
cnf(c_73,negated_conjecture,
~ p(enc(pp,a)),
inference(cnf_transformation,[],[f77]) ).
cnf(c_318,plain,
( ~ p(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_64]) ).
cnf(c_327,plain,
( ~ p(X0)
| p(enc(tc,X0))
| ~ sP5_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP5_iProver_def])],[c_58]) ).
cnf(c_328,plain,
( sP0_iProver_def
| sP5_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_58]) ).
cnf(c_329,plain,
( ~ p(X0)
| ~ p(X1)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ sP6_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP6_iProver_def])],[c_57]) ).
cnf(c_330,plain,
( sP0_iProver_def
| sP6_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_57]) ).
cnf(c_339,plain,
enc(pp,a) = sP11_iProver_def,
definition ).
cnf(c_340,negated_conjecture,
~ p(sP11_iProver_def),
inference(demodulation,[status(thm)],[c_73,c_339]) ).
cnf(c_715,plain,
~ sP0_iProver_def,
inference(superposition,[status(thm)],[c_65,c_318]) ).
cnf(c_727,plain,
sP6_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_330,c_715]) ).
cnf(c_728,plain,
sP5_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_328,c_715]) ).
cnf(c_798,plain,
( p(enc(tc,X0))
| ~ p(X0) ),
inference(global_subsumption_just,[status(thm)],[c_327,c_327,c_728]) ).
cnf(c_799,plain,
( ~ p(X0)
| p(enc(tc,X0)) ),
inference(renaming,[status(thm)],[c_798]) ).
cnf(c_3253,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X1)
| ~ p(X0) ),
inference(global_subsumption_just,[status(thm)],[c_329,c_329,c_727]) ).
cnf(c_3254,plain,
( ~ p(X0)
| ~ p(X1)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(renaming,[status(thm)],[c_3253]) ).
cnf(c_3261,plain,
( ~ p(enc(tmk,X0))
| ~ p(X1)
| p(enc(X0,enc(i(tc),X1))) ),
inference(superposition,[status(thm)],[c_49,c_3254]) ).
cnf(c_3348,plain,
( ~ p(enc(tmk,X0))
| ~ p(enc(tc,X1))
| p(enc(X0,X1)) ),
inference(superposition,[status(thm)],[c_49,c_3261]) ).
cnf(c_3595,plain,
( ~ p(enc(tc,X0))
| p(enc(pp,X0)) ),
inference(superposition,[status(thm)],[c_65,c_3348]) ).
cnf(c_3626,plain,
( ~ p(X0)
| p(enc(pp,X0)) ),
inference(superposition,[status(thm)],[c_799,c_3595]) ).
cnf(c_3676,plain,
( ~ p(a)
| p(sP11_iProver_def) ),
inference(superposition,[status(thm)],[c_339,c_3626]) ).
cnf(c_3680,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3676,c_340,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV237+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 00:21:55 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.67/1.20 % SZS status Started for theBenchmark.p
% 3.67/1.20 % SZS status Theorem for theBenchmark.p
% 3.67/1.20
% 3.67/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.67/1.20
% 3.67/1.20 ------ iProver source info
% 3.67/1.20
% 3.67/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.67/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.67/1.20 git: non_committed_changes: false
% 3.67/1.20
% 3.67/1.20 ------ Parsing...
% 3.67/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.67/1.20
% 3.67/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.67/1.20
% 3.67/1.20 ------ Preprocessing... gs_s sp: 22 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.67/1.20
% 3.67/1.20 ------ Preprocessing... sf_s rm: 12 0s sf_e sf_s rm: 0 0s sf_e
% 3.67/1.20 ------ Proving...
% 3.67/1.20 ------ Problem Properties
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20 clauses 37
% 3.67/1.20 conjectures 1
% 3.67/1.20 EPR 14
% 3.67/1.20 Horn 27
% 3.67/1.20 unary 13
% 3.67/1.20 binary 12
% 3.67/1.20 lits 83
% 3.67/1.20 lits eq 4
% 3.67/1.20 fd_pure 0
% 3.67/1.20 fd_pseudo 0
% 3.67/1.20 fd_cond 0
% 3.67/1.20 fd_pseudo_cond 0
% 3.67/1.20 AC symbols 0
% 3.67/1.20
% 3.67/1.20 ------ Schedule dynamic 5 is on
% 3.67/1.20
% 3.67/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20 ------
% 3.67/1.20 Current options:
% 3.67/1.20 ------
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20 ------ Proving...
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20 % SZS status Theorem for theBenchmark.p
% 3.67/1.20
% 3.67/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.67/1.20
% 3.67/1.20
%------------------------------------------------------------------------------