TSTP Solution File: SWV236+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Fri May 3 03:13:48 EDT 2024
% Result : Theorem 3.70s 1.14s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : decrypt(X0,crypt(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encryption_decryption_cancellation) ).
fof(f7,axiom,
! [X8,X5,X3] :
( ( p(crypt(xor(km,exp),X3))
& p(X8)
& p(crypt(xor(km,X8),X5)) )
=> p(crypt(xor(X3,X8),X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_export) ).
fof(f12,axiom,
! [X0,X5] :
( ( p(crypt(xor(km,data),X5))
& p(X0) )
=> p(decrypt(X5,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',decrypt_data) ).
fof(f17,axiom,
! [X0,X1] :
( p(crypt(xor(X0,data),X1))
=> p(crypt(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',data_cv_is_known_to_be_zero) ).
fof(f20,axiom,
p(data),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_3) ).
fof(f24,axiom,
p(crypt(xor(km,exp),eurk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_7) ).
fof(f25,axiom,
p(crypt(xor(km,data),eurk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_8) ).
fof(f28,conjecture,
? [X11] :
( p(X11)
& p(crypt(xor(km,exp),X11)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_known_exporter) ).
fof(f29,negated_conjecture,
~ ? [X11] :
( p(X11)
& p(crypt(xor(km,exp),X11)) ),
inference(negated_conjecture,[],[f28]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( p(crypt(xor(km,exp),X2))
& p(X0)
& p(crypt(xor(km,X0),X1)) )
=> p(crypt(xor(X2,X0),X1)) ),
inference(rectify,[],[f7]) ).
fof(f36,plain,
! [X0,X1] :
( ( p(crypt(xor(km,data),X1))
& p(X0) )
=> p(decrypt(X1,X0)) ),
inference(rectify,[],[f12]) ).
fof(f38,plain,
~ ? [X0] :
( p(X0)
& p(crypt(xor(km,exp),X0)) ),
inference(rectify,[],[f29]) ).
fof(f41,plain,
! [X0,X1,X2] :
( p(crypt(xor(X2,X0),X1))
| ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| ~ p(crypt(xor(km,X0),X1)) ),
inference(ennf_transformation,[],[f31]) ).
fof(f42,plain,
! [X0,X1,X2] :
( p(crypt(xor(X2,X0),X1))
| ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| ~ p(crypt(xor(km,X0),X1)) ),
inference(flattening,[],[f41]) ).
fof(f51,plain,
! [X0,X1] :
( p(decrypt(X1,X0))
| ~ p(crypt(xor(km,data),X1))
| ~ p(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f52,plain,
! [X0,X1] :
( p(decrypt(X1,X0))
| ~ p(crypt(xor(km,data),X1))
| ~ p(X0) ),
inference(flattening,[],[f51]) ).
fof(f61,plain,
! [X0,X1] :
( p(crypt(X0,X1))
| ~ p(crypt(xor(X0,data),X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f62,plain,
! [X0] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(ennf_transformation,[],[f38]) ).
fof(f65,plain,
! [X0,X1] : decrypt(X0,crypt(X0,X1)) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f69,plain,
! [X2,X0,X1] :
( p(crypt(xor(X2,X0),X1))
| ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| ~ p(crypt(xor(km,X0),X1)) ),
inference(cnf_transformation,[],[f42]) ).
fof(f74,plain,
! [X0,X1] :
( p(decrypt(X1,X0))
| ~ p(crypt(xor(km,data),X1))
| ~ p(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f79,plain,
! [X0,X1] :
( p(crypt(X0,X1))
| ~ p(crypt(xor(X0,data),X1)) ),
inference(cnf_transformation,[],[f61]) ).
fof(f82,plain,
p(data),
inference(cnf_transformation,[],[f20]) ).
fof(f86,plain,
p(crypt(xor(km,exp),eurk)),
inference(cnf_transformation,[],[f24]) ).
fof(f87,plain,
p(crypt(xor(km,data),eurk)),
inference(cnf_transformation,[],[f25]) ).
fof(f90,plain,
! [X0] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_51,plain,
decrypt(X0,crypt(X0,X1)) = X1,
inference(cnf_transformation,[],[f65]) ).
cnf(c_55,plain,
( ~ p(crypt(xor(km,X0),X1))
| ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| p(crypt(xor(X2,X0),X1)) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_60,plain,
( ~ p(crypt(xor(km,data),X0))
| ~ p(X1)
| p(decrypt(X0,X1)) ),
inference(cnf_transformation,[],[f74]) ).
cnf(c_65,plain,
( ~ p(crypt(xor(X0,data),X1))
| p(crypt(X0,X1)) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_68,plain,
p(data),
inference(cnf_transformation,[],[f82]) ).
cnf(c_72,plain,
p(crypt(xor(km,exp),eurk)),
inference(cnf_transformation,[],[f86]) ).
cnf(c_73,plain,
p(crypt(xor(km,data),eurk)),
inference(cnf_transformation,[],[f87]) ).
cnf(c_76,negated_conjecture,
( ~ p(crypt(xor(km,exp),X0))
| ~ p(X0) ),
inference(cnf_transformation,[],[f90]) ).
cnf(c_298,plain,
xor(km,exp) = sP0_iProver_def,
definition ).
cnf(c_299,negated_conjecture,
( ~ p(crypt(sP0_iProver_def,X0))
| ~ p(X0) ),
inference(demodulation,[status(thm)],[c_76,c_298]) ).
cnf(c_624,plain,
p(crypt(sP0_iProver_def,eurk)),
inference(light_normalisation,[status(thm)],[c_72,c_298]) ).
cnf(c_625,plain,
~ p(eurk),
inference(superposition,[status(thm)],[c_624,c_299]) ).
cnf(c_876,plain,
( ~ p(X0)
| p(decrypt(eurk,X0)) ),
inference(superposition,[status(thm)],[c_73,c_60]) ).
cnf(c_880,plain,
( ~ p(crypt(xor(km,X0),X1))
| ~ p(crypt(sP0_iProver_def,X2))
| ~ p(X0)
| p(crypt(xor(X2,X0),X1)) ),
inference(light_normalisation,[status(thm)],[c_55,c_298]) ).
cnf(c_892,plain,
( ~ p(crypt(sP0_iProver_def,X0))
| ~ p(data)
| p(crypt(xor(X0,data),eurk)) ),
inference(superposition,[status(thm)],[c_73,c_880]) ).
cnf(c_900,plain,
( ~ p(crypt(sP0_iProver_def,X0))
| p(crypt(xor(X0,data),eurk)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_892,c_68]) ).
cnf(c_1099,plain,
( ~ p(crypt(eurk,X0))
| p(X0) ),
inference(superposition,[status(thm)],[c_51,c_876]) ).
cnf(c_2791,plain,
( ~ p(crypt(sP0_iProver_def,X0))
| p(crypt(X0,eurk)) ),
inference(superposition,[status(thm)],[c_900,c_65]) ).
cnf(c_3235,plain,
p(crypt(eurk,eurk)),
inference(superposition,[status(thm)],[c_624,c_2791]) ).
cnf(c_3237,plain,
p(eurk),
inference(superposition,[status(thm)],[c_3235,c_1099]) ).
cnf(c_3238,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3237,c_625]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:16:21 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.70/1.14 % SZS status Started for theBenchmark.p
% 3.70/1.14 % SZS status Theorem for theBenchmark.p
% 3.70/1.14
% 3.70/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.70/1.14
% 3.70/1.14 ------ iProver source info
% 3.70/1.14
% 3.70/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.70/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.70/1.14 git: non_committed_changes: false
% 3.70/1.14
% 3.70/1.14 ------ Parsing...
% 3.70/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.70/1.14
% 3.70/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.70/1.14
% 3.70/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.70/1.14
% 3.70/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.70/1.14 ------ Proving...
% 3.70/1.14 ------ Problem Properties
% 3.70/1.14
% 3.70/1.14
% 3.70/1.14 clauses 29
% 3.70/1.14 conjectures 1
% 3.70/1.14 EPR 7
% 3.70/1.14 Horn 29
% 3.70/1.14 unary 16
% 3.70/1.14 binary 2
% 3.70/1.14 lits 59
% 3.70/1.14 lits eq 6
% 3.70/1.14 fd_pure 0
% 3.70/1.14 fd_pseudo 0
% 3.70/1.14 fd_cond 0
% 3.70/1.14 fd_pseudo_cond 0
% 3.70/1.14 AC symbols 1
% 3.70/1.14
% 3.70/1.14 ------ Schedule dynamic 5 is on
% 3.70/1.14
% 3.70/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.70/1.14
% 3.70/1.14
% 3.70/1.14 ------
% 3.70/1.14 Current options:
% 3.70/1.14 ------
% 3.70/1.14
% 3.70/1.14
% 3.70/1.14
% 3.70/1.14
% 3.70/1.14 ------ Proving...
% 3.70/1.14
% 3.70/1.14
% 3.70/1.14 % SZS status Theorem for theBenchmark.p
% 3.70/1.14
% 3.70/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/1.14
% 3.70/1.14
%------------------------------------------------------------------------------