%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV017+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n026.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 18:18:57 EDT 2022 % Result : Satisfiable 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWV017+1 : TPTP v8.1.0. Released v2.4.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n026.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 : Wed Jun 15 16:43:07 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.14/0.39 # and selection function SelectCQIPrecWNTNp. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 43 Number of unprocessed: 43 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 43 beginning clauses after preprocessing and clausification % 0.14/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.14/0.39 # No conjectures. % 0.14/0.39 # There are 43 start rule candidates: % 0.14/0.39 # Found 16 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 43 start rule tableaux created. % 0.14/0.39 # 27 extension rule candidate clauses % 0.14/0.39 # 16 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.20/0.41 # 10396 Satisfiable branch % 0.20/0.41 # 10394 Satisfiable branch % 0.20/0.41 # 10397 Satisfiable branch % 0.20/0.41 # Satisfiable branch found. % 0.20/0.41 # There were 1 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 0 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 0 successful branch saturations after the branch. % 0.20/0.41 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_15, plain, (party_of_protocol(t))). % 0.20/0.41 cnf(i_0_2, plain, (party_of_protocol(a))). % 0.20/0.41 cnf(i_0_8, plain, (party_of_protocol(b))). % 0.20/0.41 cnf(i_0_9, plain, (fresh_to_b(an_a_nonce))). % 0.20/0.41 cnf(i_0_34, plain, (a_nonce(an_a_nonce))). % 0.20/0.41 cnf(i_0_40, plain, (fresh_intruder_nonce(an_intruder_nonce))). % 0.20/0.41 cnf(i_0_39, plain, (a_key(generate_key(X1)))). % 0.20/0.41 cnf(i_0_36, plain, (a_nonce(generate_b_nonce(X1)))). % 0.20/0.41 cnf(i_0_37, plain, (a_nonce(generate_expiration_time(X1)))). % 0.20/0.41 cnf(i_0_1, plain, (a_holds(key(at,t)))). % 0.20/0.41 cnf(i_0_4, plain, (a_stored(pair(b,an_a_nonce)))). % 0.20/0.41 cnf(i_0_7, plain, (b_holds(key(bt,t)))). % 0.20/0.41 cnf(i_0_13, plain, (t_holds(key(at,a)))). % 0.20/0.41 cnf(i_0_14, plain, (t_holds(key(bt,b)))). % 0.20/0.41 cnf(i_0_3, plain, (message(sent(a,b,pair(a,an_a_nonce))))). % 0.20/0.41 cnf(i_0_35, plain, (~a_nonce(generate_key(X1)))). % 0.20/0.41 cnf(i_0_38, plain, (~a_nonce(X1)|~a_key(X1))). % 0.20/0.41 cnf(i_0_42, plain, (intruder_message(X1)|~fresh_intruder_nonce(X1))). % 0.20/0.41 cnf(i_0_43, plain, (fresh_to_b(X1)|~fresh_intruder_nonce(X1))). % 0.20/0.41 cnf(i_0_41, plain, (fresh_intruder_nonce(generate_intruder_nonce(X1))|~fresh_intruder_nonce(X1))). % 0.20/0.41 cnf(i_0_18, plain, (intruder_message(X1)|~intruder_message(pair(X2,X1)))). % 0.20/0.41 cnf(i_0_19, plain, (intruder_message(X1)|~intruder_message(pair(X1,X2)))). % 0.20/0.41 cnf(i_0_17, plain, (intruder_message(X1)|~message(sent(X2,X3,X1)))). % 0.20/0.41 cnf(i_0_20, plain, (intruder_message(X1)|~intruder_message(triple(X2,X3,X1)))). % 0.20/0.41 cnf(i_0_21, plain, (intruder_message(X1)|~intruder_message(triple(X2,X1,X3)))). % 0.20/0.41 cnf(i_0_22, plain, (intruder_message(X1)|~intruder_message(triple(X1,X2,X3)))). % 0.20/0.41 cnf(i_0_23, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X4,X1)))). % 0.20/0.41 cnf(i_0_24, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X1,X4)))). % 0.20/0.41 cnf(i_0_27, plain, (intruder_message(pair(X1,X2))|~intruder_message(X2)|~intruder_message(X1))). % 0.20/0.41 cnf(i_0_25, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X1,X3,X4)))). % 0.20/0.41 cnf(i_0_26, plain, (intruder_message(X1)|~intruder_message(quadruple(X1,X2,X3,X4)))). % 0.20/0.41 cnf(i_0_32, plain, (intruder_holds(key(X1,X2))|~intruder_message(X1)|~party_of_protocol(X2))). % 0.20/0.41 cnf(i_0_30, plain, (intruder_message(X1)|~intruder_holds(key(X1,X2))|~intruder_message(encrypt(X3,X1))|~party_of_protocol(X2))). % 0.20/0.41 cnf(i_0_31, plain, (message(sent(X1,X2,X3))|~intruder_message(X3)|~party_of_protocol(X2)|~party_of_protocol(X1))). % 0.20/0.41 cnf(i_0_28, plain, (intruder_message(triple(X1,X2,X3))|~intruder_message(X3)|~intruder_message(X2)|~intruder_message(X1))). % 0.20/0.41 cnf(i_0_33, plain, (intruder_message(encrypt(X1,X2))|~intruder_holds(key(X2,X3))|~intruder_message(X1)|~party_of_protocol(X3))). % 0.20/0.41 cnf(i_0_10, plain, (b_stored(pair(X1,X2))|~fresh_to_b(X2)|~message(sent(X1,b,pair(X1,X2))))). % 0.20/0.41 cnf(i_0_29, plain, (intruder_message(quadruple(X1,X2,X3,X4))|~intruder_message(X4)|~intruder_message(X3)|~intruder_message(X2)|~intruder_message(X1))). % 0.20/0.41 cnf(i_0_11, 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.20/0.41 cnf(i_0_5, 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.20/0.41 cnf(i_0_12, plain, (b_holds(key(X1,X2))|~a_key(X1)|~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.20/0.41 cnf(i_0_6, 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.20/0.41 cnf(i_0_16, plain, (message(sent(t,X1,triple(encrypt(quadruple(X2,X3,generate_key(X3),X4),X5),encrypt(triple(X1,generate_key(X3),X4),X6),X7)))|~a_nonce(X3)|~t_holds(key(X5,X1))|~t_holds(key(X6,X2))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 4 steps % 0.20/0.41 cnf(i_0_40, plain, (fresh_intruder_nonce(an_intruder_nonce)), inference(start_rule)). % 0.20/0.41 cnf(i_0_49, plain, (fresh_intruder_nonce(an_intruder_nonce)), inference(extension_rule, [i_0_42])). % 0.20/0.41 cnf(i_0_138, plain, (intruder_message(an_intruder_nonce)), inference(extension_rule, [i_0_27])). % 0.20/0.41 cnf(i_0_164, plain, (~intruder_message(an_intruder_nonce)), inference(closure_rule, [i_0_138])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Satisfiable branch found. % 0.20/0.41 # There were 1 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 0 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 0 successful branch saturations after the branch. % 0.20/0.41 # Child (10396) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------