%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV011+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 : n004.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:55 EDT 2022 % Result : Theorem 0.13s 0.36s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0. % 0.06/0.12 % 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 : n004.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 : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Wed Jun 15 07:18:54 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 17 Number of unprocessed: 17 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 17 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 16 unit axioms. % 0.13/0.36 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.13/0.36 # Found closed tableau while making start rule % 0.13/0.36 # There were 0 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 0 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 0 successful branch saturations after the branch. % 0.13/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_2, plain, (party_of_protocol(a))). % 0.13/0.36 cnf(i_0_6, plain, (party_of_protocol(b))). % 0.13/0.36 cnf(i_0_10, plain, (party_of_protocol(t))). % 0.13/0.36 cnf(i_0_7, plain, (fresh_to_b(an_a_nonce))). % 0.13/0.36 cnf(i_0_1, plain, (a_holds(key(at,t)))). % 0.13/0.36 cnf(i_0_5, plain, (b_holds(key(bt,t)))). % 0.13/0.36 cnf(i_0_4, plain, (a_stored(pair(b,an_a_nonce)))). % 0.13/0.36 cnf(i_0_8, plain, (t_holds(key(at,a)))). % 0.13/0.36 cnf(i_0_9, plain, (t_holds(key(bt,b)))). % 0.13/0.36 cnf(i_0_16, plain, (b_stored(pair(a,an_a_nonce)))). % 0.13/0.36 cnf(i_0_13, plain, (a_holds(key(generate_key(an_a_nonce),b)))). % 0.13/0.36 cnf(i_0_11, plain, (b_holds(key(generate_key(an_a_nonce),a)))). % 0.13/0.36 cnf(i_0_3, plain, (message(sent(a,b,pair(a,an_a_nonce))))). % 0.13/0.36 cnf(i_0_15, 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)))))). % 0.13/0.36 cnf(i_0_12, plain, (message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce))))))). % 0.13/0.36 cnf(i_0_14, plain, (message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),at),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce)))))). % 0.13/0.36 cnf(i_0_17, negated_conjecture, (~b_holds(key(X1,a))|~a_holds(key(X1,b)))). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 3 steps % 0.13/0.36 cnf(i_0_17, negated_conjecture, (~b_holds(key(generate_key(an_a_nonce),a))|~a_holds(key(generate_key(an_a_nonce),b))), inference(start_rule)). % 0.13/0.36 cnf(i_0_18, plain, (~b_holds(key(generate_key(an_a_nonce),a))), inference(closure_rule, [i_0_11])). % 0.13/0.36 cnf(i_0_19, plain, (~a_holds(key(generate_key(an_a_nonce),b))), inference(closure_rule, [i_0_13])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # NOT attempting initial tableau saturation % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 1 extension rule candidate clauses % 0.13/0.36 # 16 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Proof search is over... % 0.13/0.36 # Freeing feature tree %------------------------------------------------------------------------------