TSTP Solution File: SWV236+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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 0.74s 1.08s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n007.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 : 600
% 0.11/0.32 % DateTime : Tue Jun 14 22:02:55 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 12499 was started by sandbox on n007.cluster.edu,
% 0.41/1.00 Tue Jun 14 22:02:55 2022
% 0.41/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12343_n007.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_12343_n007.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (28 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00 1 (all X1 all X2 xor(X1,X2) = xor(X2,X1)) # label(xor_commutative) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 3 (all X1 all X2 decrypt(X1,crypt(X1,X2)) = X2) # label(encryption_decryption_cancellation) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 4 (all X1 xor(X1,id) = X1) # label(xor_rules_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 5 (all X1 xor(X1,X1) = id) # label(xor_rules_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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].
% 0.74/1.08 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].
% 0.74/1.08 14 (all X1 all X2 (p(X1) & p(X2) -> p(xor(X1,X2)))) # label(combine_with_XOR) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 15 (all X1 all X2 (p(crypt(X1,X2)) & p(X1) -> p(X2))) # label(decrypt_knowledge) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 16 (all X1 all X2 (p(X2) & p(X1) -> p(crypt(X1,X2)))) # label(encrypt_knowledge) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 17 (all X1 all X2 (p(crypt(xor(X1,data),X2)) -> p(crypt(X1,X2)))) # label(data_cv_is_known_to_be_zero) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 18 -(exists X (p(crypt(xor(km,exp),X)) & p(X))) # label(find_known_exporter) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.08
% 0.74/1.08 ============================== end of process non-clausal formulas ===
% 0.74/1.08
% 0.74/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.08
% 0.74/1.08 ============================== PREDICATE ELIMINATION =================
% 0.74/1.08
% 0.74/1.08 ============================== end predicate elimination =============
% 0.74/1.08
% 0.74/1.08 Auto_denials:
% 0.74/1.08 % copying label find_known_exporter to answer in negative clause
% 0.74/1.08
% 0.74/1.08 Term ordering decisions:
% 0.74/1.08 Function symbol KB weights: km=1. data=1. kp=1. exp=1. id=1. imp=1. eurk=1. pin=1. a=1. pp=1. xor=1. crypt=1. decrypt=1.
% 0.74/1.08
% 0.74/1.08 ============================== end of process initial clauses ========
% 0.74/1.08
% 0.74/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.08
% 0.74/1.08 ============================== end of clauses for search =============
% 0.74/1.08
% 0.74/1.08 ============================== SEARCH ================================
% 0.74/1.08
% 0.74/1.08 % Starting search at 0.01 seconds.
% 0.74/1.08
% 0.74/1.08 ============================== PROOF =================================
% 0.74/1.08 % SZS status Theorem
% 0.74/1.08 % SZS output start Refutation
% 0.74/1.08
% 0.74/1.08 % Proof 1 at 0.09 (+ 0.01) seconds: find_known_exporter.
% 0.74/1.08 % Length of proof is 23.
% 0.74/1.08 % Level of proof is 4.
% 0.74/1.08 % Maximum clause weight is 12.000.
% 0.74/1.08 % Given clauses 53.
% 0.74/1.08
% 0.74/1.08 1 (all X1 all X2 xor(X1,X2) = xor(X2,X1)) # label(xor_commutative) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 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.74/1.08 4 (all X1 xor(X1,id) = X1) # label(xor_rules_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 5 (all X1 xor(X1,X1) = id) # label(xor_rules_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 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.74/1.08 14 (all X1 all X2 (p(X1) & p(X2) -> p(xor(X1,X2)))) # label(combine_with_XOR) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.08 18 -(exists X (p(crypt(xor(km,exp),X)) & p(X))) # label(find_known_exporter) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.08 19 p(kp) # label(initial_knowledge_of_intruder_1) # label(axiom). [assumption].
% 0.74/1.08 20 p(imp) # label(initial_knowledge_of_intruder_2) # label(axiom). [assumption].
% 0.74/1.08 24 p(exp) # label(initial_knowledge_of_intruder_9) # label(axiom). [assumption].
% 0.74/1.08 26 xor(A,id) = A # label(xor_rules_1) # label(axiom). [clausify(4)].
% 0.74/1.08 27 xor(A,A) = id # label(xor_rules_2) # label(axiom). [clausify(5)].
% 0.74/1.08 31 xor(A,B) = xor(B,A) # label(xor_commutative) # label(axiom). [clausify(1)].
% 0.74/1.08 33 xor(xor(A,B),C) = xor(A,xor(B,C)) # label(xor_associative) # label(axiom). [clausify(2)].
% 0.74/1.08 34 xor(A,xor(B,C)) = xor(C,xor(A,B)). [copy(33),rewrite([31(2)]),flip(a)].
% 0.74/1.08 35 -p(crypt(xor(km,exp),A)) | -p(A) # label(find_known_exporter) # label(negated_conjecture) # answer(find_known_exporter). [clausify(18)].
% 0.74/1.08 36 -p(A) | -p(B) | p(xor(A,B)) # label(combine_with_XOR) # label(axiom). [clausify(14)].
% 0.74/1.08 40 -p(A) | -p(B) | p(crypt(xor(km,xor(kp,B)),A)) # label(key_part_import___part_1) # label(axiom). [clausify(8)].
% 0.74/1.08 41 -p(A) | -p(B) | p(crypt(xor(B,xor(km,kp)),A)). [copy(40),rewrite([31(5),34(6,R),31(5)])].
% 0.74/1.08 97 p(xor(exp,imp)). [hyper(36,a,24,a,b,20,a)].
% 0.74/1.08 98 p(xor(kp,exp)). [hyper(36,a,24,a,b,19,a),rewrite([31(3)])].
% 0.74/1.08 1202 -p(crypt(xor(km,exp),xor(exp,imp))) # answer(find_known_exporter). [ur(35,b,97,a)].
% 0.74/1.08 1206 $F # answer(find_known_exporter). [hyper(41,a,97,a,b,98,a),rewrite([31(7),34(7),31(6),34(6,R),27(5),26(4),31(3)]),unit_del(a,1202)].
% 0.74/1.08
% 0.74/1.08 % SZS output end Refutation
% 0.74/1.08 ============================== end of proof ==========================
% 0.74/1.08
% 0.74/1.08 ============================== STATISTICS ============================
% 0.74/1.08
% 0.74/1.08 Given=53. Generated=1588. Kept=1181. proofs=1.
% 0.74/1.08 Usable=52. Sos=1122. Demods=6. Limbo=3, Disabled=32. Hints=0.
% 0.74/1.08 Megabytes=0.78.
% 0.74/1.08 User_CPU=0.09, System_CPU=0.01, Wall_clock=1.
% 0.74/1.08
% 0.74/1.08 ============================== end of statistics =====================
% 0.74/1.08
% 0.74/1.08 ============================== end of search =========================
% 0.74/1.08
% 0.74/1.08 THEOREM PROVED
% 0.74/1.08 % SZS status Theorem
% 0.74/1.08
% 0.74/1.08 Exiting with 1 proof.
% 0.74/1.08
% 0.74/1.08 Process 12499 exit (max_proofs) Tue Jun 14 22:02:56 2022
% 0.74/1.08 Prover9 interrupted
%------------------------------------------------------------------------------