0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.33 % Computer : n014.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 1200 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Jul 13 10:51:04 EDT 2021 0.13/0.33 % CPUTime : 0.18/0.36 # No SInE strategy applied 0.18/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S00I 0.18/0.36 # and selection function NoSelection. 0.18/0.36 # 0.18/0.36 # Presaturation interreduction done 0.18/0.36 # Number of axioms: 33 Number of unprocessed: 33 0.18/0.36 # Tableaux proof search. 0.18/0.36 # APR header successfully linked. 0.18/0.36 # Hello from C++ 0.18/0.37 # The folding up rule is enabled... 0.18/0.37 # Local unification is enabled... 0.18/0.37 # Any saturation attempts will use folding labels... 0.18/0.37 # 33 beginning clauses after preprocessing and clausification 0.18/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. 0.18/0.37 # No conjectures. 0.18/0.37 # There are 33 start rule candidates: 0.18/0.37 # Found 10 unit axioms. 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.18/0.37 # 33 start rule tableaux created. 0.18/0.37 # 23 extension rule candidate clauses 0.18/0.37 # 10 unit axiom clauses 0.18/0.37 0.18/0.37 # Requested 8, 32 cores available to the main process. 0.18/0.38 # 14727 Satisfiable branch 0.18/0.38 # 14724 Satisfiable branch 0.18/0.39 # Satisfiable branch found. 0.18/0.39 # There were 1 total branch saturation attempts. 0.18/0.39 # There were 0 of these attempts blocked. 0.18/0.39 # There were 0 deferred branch saturation attempts. 0.18/0.39 # There were 0 free duplicated saturations. 0.18/0.39 # There were 0 total successful branch saturations. 0.18/0.39 # There were 0 successful branch saturations in interreduction. 0.18/0.39 # There were 0 successful branch saturations on the branch. 0.18/0.39 # There were 0 successful branch saturations after the branch. 0.18/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.39 # Begin clausification derivation 0.18/0.39 0.18/0.39 # End clausification derivation 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion 0.18/0.39 cnf(i_0_3, plain, (party_of_protocol(t))). 0.18/0.39 cnf(i_0_19, plain, (party_of_protocol(b))). 0.18/0.39 cnf(i_0_8, plain, (party_of_protocol(a))). 0.18/0.39 cnf(i_0_5, plain, (fresh_to_b(an_a_nonce))). 0.18/0.39 cnf(i_0_25, plain, (t_holds(key(bt,b)))). 0.18/0.39 cnf(i_0_29, plain, (t_holds(key(at,a)))). 0.18/0.39 cnf(i_0_18, plain, (a_holds(key(at,t)))). 0.18/0.39 cnf(i_0_23, plain, (a_stored(pair(b,an_a_nonce)))). 0.18/0.39 cnf(i_0_13, plain, (b_holds(key(bt,t)))). 0.18/0.39 cnf(i_0_24, plain, (message(sent(a,b,pair(a,an_a_nonce))))). 0.18/0.39 cnf(i_0_15, plain, (intruder_message(X1)|~intruder_message(pair(X2,X1)))). 0.18/0.39 cnf(i_0_16, plain, (intruder_message(X1)|~intruder_message(pair(X1,X2)))). 0.18/0.39 cnf(i_0_12, plain, (intruder_message(X1)|~message(sent(X2,X3,X1)))). 0.18/0.39 cnf(i_0_20, plain, (intruder_message(X1)|~intruder_message(triple(X2,X3,X1)))). 0.18/0.39 cnf(i_0_21, plain, (intruder_message(X1)|~intruder_message(triple(X2,X1,X3)))). 0.18/0.39 cnf(i_0_22, plain, (intruder_message(X1)|~intruder_message(triple(X1,X2,X3)))). 0.18/0.39 cnf(i_0_31, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X4,X1)))). 0.18/0.39 cnf(i_0_17, plain, (intruder_message(pair(X1,X2))|~intruder_message(X1)|~intruder_message(X2))). 0.18/0.39 cnf(i_0_32, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X1,X4)))). 0.18/0.39 cnf(i_0_33, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X1,X3,X4)))). 0.18/0.39 cnf(i_0_30, plain, (intruder_message(X1)|~intruder_message(quadruple(X1,X2,X3,X4)))). 0.18/0.39 cnf(i_0_11, plain, (intruder_holds(key(X1,X2))|~intruder_message(X1)|~party_of_protocol(X2))). 0.18/0.39 cnf(i_0_2, plain, (message(sent(X1,X2,X3))|~intruder_message(X3)|~party_of_protocol(X1)|~party_of_protocol(X2))). 0.18/0.39 cnf(i_0_14, plain, (intruder_message(X1)|~intruder_holds(key(X1,X2))|~intruder_message(encrypt(X3,X1))|~party_of_protocol(X2))). 0.18/0.39 cnf(i_0_28, plain, (intruder_message(encrypt(X1,X2))|~intruder_holds(key(X2,X3))|~intruder_message(X1)|~party_of_protocol(X3))). 0.18/0.39 cnf(i_0_26, plain, (intruder_message(triple(X1,X2,X3))|~intruder_message(X1)|~intruder_message(X3)|~intruder_message(X2))). 0.18/0.39 cnf(i_0_6, plain, (b_stored(pair(X1,X2))|~fresh_to_b(X2)|~message(sent(X1,b,pair(X1,X2))))). 0.18/0.39 cnf(i_0_4, plain, (intruder_message(quadruple(X1,X2,X3,X4))|~intruder_message(X1)|~intruder_message(X2)|~intruder_message(X4)|~intruder_message(X3))). 0.18/0.39 cnf(i_0_9, plain, (a_holds(key(X1,X2))|~a_stored(pair(X2,X3))|~message(sent(t,a,triple(encrypt(quadruple(X2,X3,X1,X4),at),X5,X6))))). 0.18/0.39 cnf(i_0_27, plain, (b_holds(key(X1,X2))|~b_stored(pair(X2,X3))|~message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1)))))). 0.18/0.39 cnf(i_0_10, plain, (message(sent(a,X1,pair(X2,encrypt(X3,X4))))|~a_stored(pair(X1,X5))|~message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3))))). 0.18/0.39 cnf(i_0_7, plain, (message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))|~fresh_to_b(X1)|~message(sent(X2,b,pair(X2,X1))))). 0.18/0.39 cnf(i_0_1, plain, (message(sent(t,X1,triple(encrypt(quadruple(X2,X3,generate_key(X3),X4),X5),encrypt(triple(X1,generate_key(X3),X4),X6),X7)))|~t_holds(key(X5,X1))|~t_holds(key(X6,X2))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))). 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.18/0.39 # Begin printing tableau 0.18/0.39 # Found 6 steps 0.18/0.39 cnf(i_0_3, plain, (party_of_protocol(t)), inference(start_rule)). 0.18/0.39 cnf(i_0_226, plain, (~intruder_message(pair(t,an_a_nonce))), inference(closure_rule, [i_0_0])). 0.18/0.39 cnf(i_0_34, plain, (party_of_protocol(t)), inference(extension_rule, [i_0_2])). 0.18/0.39 cnf(i_0_225, plain, (message(sent(t,b,pair(t,an_a_nonce)))), inference(extension_rule, [i_0_6])). 0.18/0.39 cnf(i_0_228, plain, (~party_of_protocol(b)), inference(closure_rule, [i_0_19])). 0.18/0.39 cnf(i_0_1616, plain, (~fresh_to_b(an_a_nonce)), inference(closure_rule, [i_0_5])). 0.18/0.39 # End printing tableau 0.18/0.39 # SZS output end 0.18/0.39 # Branches closed with saturat# Satisfiable branch found. 0.18/0.39 ion will be marked with an "s" 0.18/0.39 # There were 1 total branch saturation attempts. 0.18/0.39 # There were 0 of these attempts blocked. 0.18/0.39 # There were 0 deferred branch saturation attempts. 0.18/0.39 # There were 0 free duplicated saturations. 0.18/0.39 # There were 0 total successful branch saturations. 0.18/0.39 # There were 0 successful branch saturations in interreduction. 0.18/0.39 # There were 0 successful branch saturations on the branch. 0.18/0.39 # There were 0 successful branch saturations after the branch. 0.18/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.39 # Begin clausification derivation 0.18/0.39 0.18/0.39 # End clausification derivation 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion 0.18/0.39 cnf(i_0_3, plain, (party_of_protocol(t))). 0.18/0.39 cnf(i_0_19, plain, (party_of_protocol(b))). 0.18/0.39 cnf(i_0_8, plain, (party_of_protocol(a))). 0.18/0.39 cnf(i_0_5, plain, (fresh_to_b(an_a_nonce))). 0.18/0.39 cnf(i_0_25, plain, (t_holds(key(bt,b)))). 0.18/0.39 cnf(i_0_29, plain, (t_holds(key(at,a)))). 0.18/0.39 cnf(i_0_18, plain, (a_holds(key(at,t)))). 0.18/0.39 cnf(i_0_23, plain, (a_stored(pair(b,an_a_nonce)))). 0.18/0.39 cnf(i_0_13, plain, (b_holds(key(bt,t)))). 0.18/0.39 cnf(i_0_24, plain, (message(sent(a,b,pair(a,an_a_nonce))))). 0.18/0.39 cnf(i_0_15, plain, (intruder_message(X1)|~intruder_message(pair(X2,X1)))). 0.18/0.39 cnf(i_0_16, plain, (intruder_message(X1)|~intruder_message(pair(X1,X2)))). 0.18/0.39 cnf(i_0_12, plain, (intruder_message(X1)|~message(sent(X2,X3,X1)))). 0.18/0.39 cnf(i_0_20, plain, (intruder_message(X1)|~intruder_message(triple(X2,X3,X1)))). 0.18/0.39 cnf(i_0_21, plain, (intruder_message(X1)|~intruder_message(triple(X2,X1,X3)))). 0.18/0.39 cnf(i_0_22, plain, (intruder_message(X1)|~intruder_message(triple(X1,X2,X3)))). 0.18/0.39 cnf(i_0_31, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X4,X1)))). 0.18/0.39 cnf(i_0_17, plain, (intruder_message(pair(X1,X2))|~intruder_message(X1)|~intruder_message(X2))). 0.18/0.39 cnf(i_0_32, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X1,X4)))). 0.18/0.39 cnf(i_0_33, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X1,X3,X4)))). 0.18/0.39 cnf(i_0_30, plain, (intruder_message(X1)|~intruder_message(quadruple(X1,X2,X3,X4)))). 0.18/0.39 cnf(i_0_11, plain, (intruder_holds(key(X1,X2))|~intruder_message(X1)|~party_of_protocol(X2))). 0.18/0.39 cnf(i_0_2, plain, (message(sent(X1,X2,X3))|~intruder_message(X3)|~party_of_protocol(X1)|~party_of_protocol(X2))). 0.18/0.39 cnf(i_0_14, plain, (intruder_message(X1)|~intruder_holds(key(X1,X2))|~intruder_message(encrypt(X3,X1))|~party_of_protocol(X2))). 0.18/0.39 cnf(i_0_28, plain, (intruder_message(encrypt(X1,X2))|~intruder_holds(key(X2,X3))|~intruder_message(X1)|~party_of_protocol(X3))). 0.18/0.39 cnf(i_0_26, plain, (intruder_message(triple(X1,X2,X3))|~intruder_message(X1)|~intruder_message(X3)|~intruder_message(X2))). 0.18/0.39 cnf(i_0_6, plain, (b_stored(pair(X1,X2))|~fresh_to_b(X2)|~message(sent(X1,b,pair(X1,X2))))). 0.18/0.39 cnf(i_0_4, plain, (intruder_message(quadruple(X1,X2,X3,X4))|~intruder_message(X1)|~intruder_message(X2)|~intruder_message(X4)|~intruder_message(X3))). 0.18/0.39 cnf(i_0_9, plain, (a_holds(key(X1,X2))|~a_stored(pair(X2,X3))|~message(sent(t,a,triple(encrypt(quadruple(X2,X3,X1,X4),at),X5,X6))))). 0.18/0.39 cnf(i_0_27, plain, (b_holds(key(X1,X2))|~b_stored(pair(X2,X3))|~message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1)))))). 0.18/0.39 cnf(i_0_10, plain, (message(sent(a,X1,pair(X2,encrypt(X3,X4))))|~a_stored(pair(X1,X5))|~message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3))))). 0.18/0.39 cnf(i_0_7, plain, (message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))|~fresh_to_b(X1)|~message(sent(X2,b,pair(X2,X1))))). 0.18/0.39 cnf(i_0_1, plain, (message(sent(t,X1,triple(encrypt(quadruple(X2,X3,generate_key(X3),X4),X5),encrypt(triple(X1,generate_key(X3),X4),X6),X7)))|~t_holds(key(X5,X1))|~t_holds(key(X6,X2))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))). 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.18/0.39 # Begin printing tableau 0.18/0.39 # Found 4 steps 0.18/0.39 cnf(i_0_5, plain, (fresh_to_b(an_a_nonce)), inference(start_rule)). 0.18/0.39 cnf(i_0_37, plain, (fresh_to_b(an_a_nonce)), inference(extension_rule, [i_0_7])). 0.18/0.39 cnf(i_0_461, plain, (~message(sent(a,b,pair(a,an_a_nonce)))), inference(closure_rule, [i_0_24])). 0.18/0.39 cnf(i_0_459, plain, (message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))))), inference(extension_rule, [i_0_12])). 0.18/0.39 # End printing tableau 0.18/0.39 # SZS output end 0.18/0.39 # Branches closed with saturation will be marked with an "s" 0.18/0.39 # Child (14724) has found a proof. 0.18/0.39 0.18/0.39 # Proof search is over... 0.18/0.39 # Freeing feature tree 0.18/0.39 EOF