TSTP Solution File: SWV235+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV235+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 : 600s
% DateTime : Wed Jul 20 21:10:58 EDT 2022
% Result : Theorem 9.65s 9.95s
% Output : Refutation 9.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV235+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 20:08:20 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.44/1.03 ============================== Prover9 ===============================
% 0.44/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.03 Process 10877 was started by sandbox2 on n023.cluster.edu,
% 0.44/1.03 Tue Jun 14 20:08:21 2022
% 0.44/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10724_n023.cluster.edu".
% 0.44/1.03 ============================== end of head ===========================
% 0.44/1.03
% 0.44/1.03 ============================== INPUT =================================
% 0.44/1.03
% 0.44/1.03 % Reading from file /tmp/Prover9_10724_n023.cluster.edu
% 0.44/1.03
% 0.44/1.03 set(prolog_style_variables).
% 0.44/1.03 set(auto2).
% 0.44/1.03 % set(auto2) -> set(auto).
% 0.44/1.03 % set(auto) -> set(auto_inference).
% 0.44/1.03 % set(auto) -> set(auto_setup).
% 0.44/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.03 % set(auto) -> set(auto_limits).
% 0.44/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.03 % set(auto) -> set(auto_denials).
% 0.44/1.03 % set(auto) -> set(auto_process).
% 0.44/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.03 % set(auto2) -> assign(stats, some).
% 0.44/1.03 % set(auto2) -> clear(echo_input).
% 0.44/1.03 % set(auto2) -> set(quiet).
% 0.44/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.03 % set(auto2) -> clear(print_given).
% 0.44/1.03 assign(lrs_ticks,-1).
% 0.44/1.03 assign(sos_limit,10000).
% 0.44/1.03 assign(order,kbo).
% 0.44/1.03 set(lex_order_vars).
% 0.44/1.03 clear(print_given).
% 0.44/1.03
% 0.44/1.03 % formulas(sos). % not echoed (29 formulas)
% 0.44/1.03
% 0.44/1.03 ============================== end of input ==========================
% 0.44/1.03
% 0.44/1.03 % From the command line: assign(max_seconds, 300).
% 0.44/1.03
% 0.44/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.03
% 0.44/1.03 % Formulas that are not ordinary clauses:
% 0.44/1.03 1 (all X1 all X2 xor(X1,X2) = xor(X2,X1)) # label(xor_commutative) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 2 (all X1 all X2 all X3 xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3)) # label(xor_associative) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 3 (all X1 all X2 decrypt(X1,crypt(X1,X2)) = X2) # label(encryption_decryption_cancellation) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 4 (all X1 xor(X1,id) = X1) # label(xor_rules_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 5 (all X1 xor(X1,X1) = id) # label(xor_rules_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 6 (all Xkek1 all Xtype1 all Xk1 all Xtype2 all Xkek2 (p(crypt(xor(Xkek1,Xtype1),Xk1)) & p(Xtype2) & p(crypt(xor(km,imp),Xkek2)) -> p(crypt(xor(km,Xtype2),decrypt(xor(Xkek2,Xtype2),crypt(xor(Xkek1,Xtype1),Xk1)))))) # label(key_import) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 7 (all Xtype all Xk1 all Xkek1 (p(crypt(xor(km,Xtype),Xk1)) & p(Xtype) & p(crypt(xor(km,exp),Xkek1)) -> p(crypt(xor(Xkek1,Xtype),Xk1)))) # label(key_export) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 8 (all Xk all Xtype (p(Xk) & p(Xtype) -> p(crypt(xor(km,xor(kp,Xtype)),Xk)))) # label(key_part_import___part_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 9 (all Xk1 all Xtype all Xk2 (p(Xk1) & p(crypt(xor(km,xor(kp,Xtype)),Xk2)) & p(Xtype) -> p(crypt(xor(km,xor(Xtype,kp)),xor(Xk1,Xk2))))) # label(key_part_import___part_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 10 (all Xk1 all Xtype all Xk2 (p(Xk1) & p(crypt(xor(km,xor(Xtype,kp)),Xk2)) & p(Xtype) -> p(crypt(xor(km,Xtype),xor(Xk2,Xk1))))) # label(key_part_import___part_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 11 (all X1 all Xk1 (p(X1) & p(crypt(xor(km,data),Xk1)) -> p(crypt(Xk1,X1)))) # label(encrypt_data) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 12 (all X1 all Xk1 (p(X1) & p(crypt(xor(km,data),Xk1)) -> p(decrypt(Xk1,X1)))) # label(decrypt_data) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 13 (all Xk all Xk1 all Xtype2 all Xkek1 all Xkek2 all Xtype (p(crypt(Xk,Xk1)) & p(Xtype2) & p(crypt(xor(km,imp),Xkek1)) & p(crypt(xor(km,exp),Xkek2)) -> p(crypt(xor(Xkek2,Xtype),decrypt(xor(Xtype2,Xkek1),crypt(Xk,Xk1)))))) # label(key_translate) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 14 (all X1 all X2 (p(X1) & p(X2) -> p(xor(X1,X2)))) # label(combine_with_XOR) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 15 (all X1 all X2 (p(crypt(X1,X2)) & p(X1) -> p(X2))) # label(decrypt_knowledge) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 16 (all X1 all X2 (p(X2) & p(X1) -> p(crypt(X1,X2)))) # label(encrypt_knowledge) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95
% 9.65/9.95 ============================== end of process non-clausal formulas ===
% 9.65/9.95
% 9.65/9.95 ============================== PROCESS INITIAL CLAUSES ===============
% 9.65/9.95
% 9.65/9.95 ============================== PREDICATE ELIMINATION =================
% 9.65/9.95
% 9.65/9.95 ============================== end predicate elimination =============
% 9.65/9.95
% 9.65/9.95 Auto_denials:
% 9.65/9.95 % copying label find_pin to answer in negative clause
% 9.65/9.95
% 9.65/9.95 Term ordering decisions:
% 9.65/9.95 Function symbol KB weights: km=1. imp=1. kp=1. exp=1. data=1. id=1. rand=1. kek=1. pin=1. a=1. pp=1. xor=1. crypt=1. decrypt=1.
% 9.65/9.95
% 9.65/9.95 ============================== end of process initial clauses ========
% 9.65/9.95
% 9.65/9.95 ============================== CLAUSES FOR SEARCH ====================
% 9.65/9.95
% 9.65/9.95 ============================== end of clauses for search =============
% 9.65/9.95
% 9.65/9.95 ============================== SEARCH ================================
% 9.65/9.95
% 9.65/9.95 % Starting search at 0.01 seconds.
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=22.000, iters=3402
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=18.000, iters=3418
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=16.000, iters=3479
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=14.000, iters=3479
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=12.000, iters=3351
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=10.000, iters=3441
% 9.65/9.95
% 9.65/9.95 Low Water (keep): wt=8.000, iters=3423
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=1324, wt=32.000
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=8571, wt=20.000
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=8942, wt=18.000
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=9014, wt=16.000
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=9128, wt=14.000
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=10796, wt=8.000
% 9.65/9.95
% 9.65/9.95 Low Water (displace): id=10829, wt=6.000
% 9.65/9.95
% 9.65/9.95 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 3011 (0.00 of 4.52 sec).
% 9.65/9.95
% 9.65/9.95 ============================== PROOF =================================
% 9.65/9.95 % SZS status Theorem
% 9.65/9.95 % SZS output start Refutation
% 9.65/9.95
% 9.65/9.95 % Proof 1 at 8.64 (+ 0.30) seconds: find_pin.
% 9.65/9.95 % Length of proof is 34.
% 9.65/9.95 % Level of proof is 6.
% 9.65/9.95 % Maximum clause weight is 20.000.
% 9.65/9.95 % Given clauses 587.
% 9.65/9.95
% 9.65/9.95 1 (all X1 all X2 xor(X1,X2) = xor(X2,X1)) # label(xor_commutative) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 2 (all X1 all X2 all X3 xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3)) # label(xor_associative) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 4 (all X1 xor(X1,id) = X1) # label(xor_rules_1) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 5 (all X1 xor(X1,X1) = id) # label(xor_rules_2) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 7 (all Xtype all Xk1 all Xkek1 (p(crypt(xor(km,Xtype),Xk1)) & p(Xtype) & p(crypt(xor(km,exp),Xkek1)) -> p(crypt(xor(Xkek1,Xtype),Xk1)))) # label(key_export) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 8 (all Xk all Xtype (p(Xk) & p(Xtype) -> p(crypt(xor(km,xor(kp,Xtype)),Xk)))) # label(key_part_import___part_1) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 14 (all X1 all X2 (p(X1) & p(X2) -> p(xor(X1,X2)))) # label(combine_with_XOR) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 15 (all X1 all X2 (p(crypt(X1,X2)) & p(X1) -> p(X2))) # label(decrypt_knowledge) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 16 (all X1 all X2 (p(X2) & p(X1) -> p(crypt(X1,X2)))) # label(encrypt_knowledge) # label(axiom) # label(non_clause). [assumption].
% 9.65/9.95 17 p(kp) # label(initial_knowledge_of_intruder_1) # label(axiom). [assumption].
% 9.65/9.95 21 p(pin) # label(initial_knowledge_of_intruder_5) # label(axiom). [assumption].
% 9.65/9.95 22 p(exp) # label(initial_knowledge_of_intruder_11) # label(axiom). [assumption].
% 9.65/9.95 23 p(a) # label(an_account_number) # label(axiom). [assumption].
% 9.65/9.95 24 xor(A,id) = A # label(xor_rules_1) # label(axiom). [clausify(4)].
% 9.65/9.95 25 xor(A,A) = id # label(xor_rules_2) # label(axiom). [clausify(5)].
% 9.65/9.95 26 p(crypt(xor(km,pin),pp)) # label(initial_knowledge_of_intruder_6) # label(axiom). [assumption].
% 9.65/9.95 29 xor(A,B) = xor(B,A) # label(xor_commutative) # label(axiom). [clausify(1)].
% 9.65/9.95 33 xor(xor(A,B),C) = xor(A,xor(B,C)) # label(xor_associative) # label(axiom). [clausify(2)].
% 9.65/9.95 34 xor(A,xor(B,C)) = xor(C,xor(A,B)). [copy(33),rewrite([29(2)]),flip(a)].
% 9.65/9.95 35 -p(crypt(pp,a)) # label(find_pin) # label(negated_conjecture) # answer(find_pin). [assumption].
% 9.65/9.95 36 -p(A) | -p(B) | p(xor(A,B)) # label(combine_with_XOR) # label(axiom). [clausify(14)].
% 9.65/9.95 37 -p(crypt(A,B)) | -p(A) | p(B) # label(decrypt_knowledge) # label(axiom). [clausify(15)].
% 9.65/9.95 38 -p(A) | -p(B) | p(crypt(B,A)) # label(encrypt_knowledge) # label(axiom). [clausify(16)].
% 9.65/9.95 39 -p(A) | -p(B) | p(crypt(xor(km,xor(kp,B)),A)) # label(key_part_import___part_1) # label(axiom). [clausify(8)].
% 9.65/9.95 40 -p(A) | -p(B) | p(crypt(xor(B,xor(km,kp)),A)). [copy(39),rewrite([29(5),34(6,R),29(5)])].
% 9.65/9.95 43 -p(crypt(xor(km,A),B)) | -p(A) | -p(crypt(xor(km,exp),C)) | p(crypt(xor(C,A),B)) # label(key_export) # label(axiom). [clausify(7)].
% 9.65/9.95 44 -p(crypt(xor(A,km),B)) | -p(A) | -p(crypt(xor(km,exp),C)) | p(crypt(xor(A,C),B)). [copy(43),rewrite([29(2),29(11)])].
% 9.65/9.95 80 p(xor(pin,a)). [hyper(36,a,23,a,b,21,a),rewrite([29(3)])].
% 9.65/9.95 88 p(xor(kp,exp)). [hyper(36,a,22,a,b,17,a),rewrite([29(3)])].
% 9.65/9.95 206 -p(pp) # answer(find_pin). [ur(38,a,23,a,c,35,a)].
% 9.65/9.95 636 -p(crypt(xor(pin,a),pp)) # answer(find_pin). [ur(37,b,80,a,c,206,a)].
% 9.65/9.95 1623 p(crypt(xor(km,exp),a)). [hyper(40,a,23,a,b,88,a),rewrite([29(7),34(7),29(6),34(6,R),25(5),24(4),29(3)])].
% 9.65/9.95 12425 -p(crypt(xor(km,pin),pp)) # answer(find_pin). [ur(44,b,21,a,c,1623,a,d,636,a),rewrite([29(3)])].
% 9.65/9.95 12426 $F # answer(find_pin). [resolve(12425,a,26,a)].
% 9.65/9.95
% 9.65/9.95 % SZS output end Refutation
% 9.65/9.95 ============================== end of proof ==========================
% 9.65/9.95
% 9.65/9.95 ============================== STATISTICS ============================
% 9.65/9.95
% 9.65/9.95 Given=587. Generated=542218. Kept=12403. proofs=1.
% 9.65/9.95 Usable=586. Sos=9999. Demods=6. Limbo=4, Disabled=1842. Hints=0.
% 9.65/9.95 Megabytes=7.24.
% 9.65/9.95 User_CPU=8.64, System_CPU=0.30, Wall_clock=9.
% 9.65/9.95
% 9.65/9.95 ============================== end of statistics =====================
% 9.65/9.95
% 9.65/9.95 ============================== end of search =========================
% 9.65/9.95
% 9.65/9.95 THEOREM PROVED
% 9.65/9.95 % SZS status Theorem
% 9.65/9.95
% 9.65/9.95 Exiting with 1 proof.
% 9.65/9.95
% 9.65/9.95 Process 10877 exit (max_proofs) Tue Jun 14 20:08:30 2022
% 9.65/9.95 Prover9 interrupted
%------------------------------------------------------------------------------