0.09/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.31 % Computer : n018.cluster.edu 0.09/0.31 % Model : x86_64 x86_64 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.31 % Memory : 8042.1875MB 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.31 % CPULimit : 960 0.09/0.31 % WCLimit : 120 0.09/0.31 % DateTime : Tue Aug 9 05:24:45 EDT 2022 0.09/0.31 % CPUTime : 0.70/1.00 ============================== Prover9 =============================== 0.70/1.00 Prover9 (32) version 2009-11A, November 2009. 0.70/1.00 Process 14440 was started by sandbox on n018.cluster.edu, 0.70/1.00 Tue Aug 9 05:24:46 2022 0.70/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_14287_n018.cluster.edu". 0.70/1.00 ============================== end of head =========================== 0.70/1.00 0.70/1.00 ============================== INPUT ================================= 0.70/1.00 0.70/1.00 % Reading from file /tmp/Prover9_14287_n018.cluster.edu 0.70/1.00 0.70/1.00 set(prolog_style_variables). 0.70/1.00 set(auto2). 0.70/1.00 % set(auto2) -> set(auto). 0.70/1.00 % set(auto) -> set(auto_inference). 0.70/1.00 % set(auto) -> set(auto_setup). 0.70/1.00 % set(auto_setup) -> set(predicate_elim). 0.70/1.00 % set(auto_setup) -> assign(eq_defs, unfold). 0.70/1.00 % set(auto) -> set(auto_limits). 0.70/1.00 % set(auto_limits) -> assign(max_weight, "100.000"). 0.70/1.00 % set(auto_limits) -> assign(sos_limit, 20000). 0.70/1.00 % set(auto) -> set(auto_denials). 0.70/1.00 % set(auto) -> set(auto_process). 0.70/1.00 % set(auto2) -> assign(new_constants, 1). 0.70/1.00 % set(auto2) -> assign(fold_denial_max, 3). 0.70/1.00 % set(auto2) -> assign(max_weight, "200.000"). 0.70/1.00 % set(auto2) -> assign(max_hours, 1). 0.70/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.70/1.00 % set(auto2) -> assign(max_seconds, 0). 0.70/1.00 % set(auto2) -> assign(max_minutes, 5). 0.70/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.70/1.00 % set(auto2) -> set(sort_initial_sos). 0.70/1.00 % set(auto2) -> assign(sos_limit, -1). 0.70/1.00 % set(auto2) -> assign(lrs_ticks, 3000). 0.70/1.00 % set(auto2) -> assign(max_megs, 400). 0.70/1.00 % set(auto2) -> assign(stats, some). 0.70/1.00 % set(auto2) -> clear(echo_input). 0.70/1.00 % set(auto2) -> set(quiet). 0.70/1.00 % set(auto2) -> clear(print_initial_clauses). 0.70/1.00 % set(auto2) -> clear(print_given). 0.70/1.00 assign(lrs_ticks,-1). 0.70/1.00 assign(sos_limit,10000). 0.70/1.00 assign(order,kbo). 0.70/1.00 set(lex_order_vars). 0.70/1.00 clear(print_given). 0.70/1.00 0.70/1.00 % formulas(sos). % not echoed (21 formulas) 0.70/1.00 0.70/1.00 ============================== end of input ========================== 0.70/1.00 0.70/1.00 % From the command line: assign(max_seconds, 960). 0.70/1.00 0.70/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.70/1.00 0.70/1.00 % Formulas that are not ordinary clauses: 0.70/1.00 1 (all E1 all E2 (knows(encrypt(E1,E2)) & knows(inverse(E2)) -> knows(E1))) # label(encrypt_equation) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 2 (all E all K E = extract(sign(E,inverse(K)),K)) # label(sign_axiom) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 3 (all X all Y (knows(Y) & knows(X) -> knows(mac(X,Y)))) # label(symmac_axiom) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 4 (all X all Y head(concatenate(X,Y)) = X) # label(head_axiom) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 5 (all X all Y tail(concatenate(X,Y)) = Y) # label(tail_axiom) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 6 (all E1 all E2 (knows(symmetric_encrypt(E1,E2)) & knows(E2) -> knows(E1))) # label(symmetric_encrypt_equation) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 7 (all E all K symmetric_decrypt(symmetric_encrypt(E,K),K) = E) # label(symmetric_decrypt_axiom) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 8 (all X third(X) = head(tail(tail(X)))) # label(third_axiom) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 9 (all E1 all E2 (knows(concatenate(E1,E2)) -> knows(E2) & knows(E1))) # label(construct_message_2) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 10 (all E1 all E2 (knows(E2) & knows(E1) -> knows(concatenate(E1,E2)) & knows(encrypt(E1,E2)) & knows(symmetric_encrypt(E1,E2)) & knows(symmetric_decrypt(E1,E2)) & knows(sign(E1,E2)) & knows(extract(E1,E2)) & knows(decrypt(E1,E2)))) # label(construct_message_1) # label(axiom) # label(non_clause). [assumption]. 0.70/1.00 11 (all Init_1 all Init_2 all Init_3 all Resp_1 all Resp_2 ((knows(Init_1) & knows(Init_2) & second(extract(Init_3,Init_2)) = Init_2 & knows(Init_3) -> knows(concatenate(encrypt(sign(concatenate(kgen(Init_2),concatenate(Init_1,eol)),inverse(k_s)),Init_2),sign(concatenate(s,concatenate(k_s,eol)),inverse(k_ca))))) & (knows(Resp_1) & knows(Resp_2) & s = first(extract(Resp_2,k_ca)) & second(extract(decrypt(Resp_1,inverse(k_c)),second(extractAlarm clock 119.58/120.10 Prover9 interrupted 119.58/120.10 EOF