%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV360-2 : TPTP v8.1.0. Released v3.2.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 : n032.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:20:42 EDT 2022 % Result : Unsatisfiable 0.14s 0.32s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SWV360-2 : TPTP v8.1.0. Released v3.2.0. % 0.00/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 600 % 0.10/0.29 % DateTime : Wed Jun 15 15:35:14 EDT 2022 % 0.10/0.29 % CPUTime : % 0.14/0.31 # No SInE strategy applied % 0.14/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.31 # % 0.14/0.31 # Presaturation interreduction done % 0.14/0.31 # Number of axioms: 7 Number of unprocessed: 7 % 0.14/0.31 # Tableaux proof search. % 0.14/0.31 # APR header successfully linked. % 0.14/0.31 # Hello from C++ % 0.14/0.32 # The folding up rule is enabled... % 0.14/0.32 # Local unification is enabled... % 0.14/0.32 # Any saturation attempts will use folding labels... % 0.14/0.32 # 7 beginning clauses after preprocessing and clausification % 0.14/0.32 # Creating start rules for all 6 conjectures. % 0.14/0.32 # There are 6 start rule candidates: % 0.14/0.32 # Found 6 unit axioms. % 0.14/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.32 # 6 start rule tableaux created. % 0.14/0.32 # 1 extension rule candidate clauses % 0.14/0.32 # 6 unit axiom clauses % 0.14/0.32 % 0.14/0.32 # Requested 8, 32 cores available to the main process. % 0.14/0.32 # There are not enough tableaux to fork, creating more from the initial 6 % 0.14/0.32 # Creating equality axioms % 0.14/0.32 # Ran out of tableaux, making start rules for all clauses % 0.14/0.32 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.14/0.32 # We now have 8 tableaux to operate on % 0.14/0.32 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done. % 0.14/0.32 # There were 0 total branch saturation attempts. % 0.14/0.32 # There were 0 of these attempts blocked. % 0.14/0.32 # There were 0 deferred branch saturation attempts. % 0.14/0.32 # There were 0 free duplicated saturations. % 0.14/0.32 # There were 0 total successful branch saturations. % 0.14/0.32 # There were 0 successful branch saturations in interreduction. % 0.14/0.32 # There were 0 successful branch saturations on the branch. % 0.14/0.32 # There were 0 successful branch saturations after the branch. % 0.14/0.32 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # Begin clausification derivation % 0.14/0.32 % 0.14/0.32 # End clausification derivation % 0.14/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.32 cnf(i_0_14, negated_conjecture, (c_in(v_Ba,c_Event_Obad,tc_Message_Oagent))). % 0.14/0.32 cnf(i_0_10, negated_conjecture, (c_in(v_evs3,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)))). % 0.14/0.32 cnf(i_0_11, negated_conjecture, (c_in(c_Event_Oevent_OGets(c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Ba),c_Message_Omsg_OCrypt(c_Public_OshrK(v_Ba),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Aa),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NAa),c_Message_Omsg_ONonce(v_NB)))))),c_List_Oset(v_evs3,tc_Event_Oevent),tc_Event_Oevent))). % 0.14/0.32 cnf(i_0_12, negated_conjecture, (c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_ONonce(v_NB)))))),c_List_Oset(v_evs3,tc_Event_Oevent),tc_Event_Oevent))). % 0.14/0.32 cnf(i_0_9, negated_conjecture, (~c_in(v_B,c_Event_Obad,tc_Message_Oagent))). % 0.14/0.32 cnf(i_0_13, negated_conjecture, (~c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg))). % 0.14/0.32 cnf(i_0_8, plain, (X1=X2|c_in(X3,c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,X4)),tc_Message_Omsg)|~c_in(c_Event_Oevent_OSays(X5,X6,c_Message_Omsg_OMPair(X7,c_Message_Omsg_OCrypt(c_Public_OshrK(X2),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(X8),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(X9),X3))))),c_List_Oset(X4,tc_Event_Oevent),tc_Event_Oevent)|~c_in(c_Event_Oevent_OGets(X10,c_Message_Omsg_OMPair(X11,c_Message_Omsg_OCrypt(c_Public_OshrK(X1),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(X12),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(X13),X3))))),c_List_Oset(X4,tc_Event_Oevent),tc_Event_Oevent)|~c_in(X4,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)))). % 0.14/0.32 cnf(i_0_71, plain, (X14=X14)). % 0.14/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.32 # Begin printing tableau % 0.14/0.32 # Found 10 steps % 0.14/0.32 cnf(i_0_14, negated_conjecture, (c_in(v_Ba,c_Event_Obad,tc_Message_Oagent)), inference(start_rule)). % 0.14/0.32 cnf(i_0_87, plain, (c_in(v_Ba,c_Event_Obad,tc_Message_Oagent)), inference(extension_rule, [i_0_76])). % 0.14/0.32 cnf(i_0_113, plain, (c_in(v_B,c_Event_Obad,tc_Message_Oagent)), inference(closure_rule, [i_0_9])). % 0.14/0.32 cnf(i_0_115, plain, ($false), inference(closure_rule, [i_0_71])). % 0.14/0.32 cnf(i_0_116, plain, ($false), inference(closure_rule, [i_0_71])). % 0.14/0.32 cnf(i_0_114, plain, (v_Ba!=v_B), inference(extension_rule, [i_0_8])). % 0.14/0.32 cnf(i_0_146, plain, (c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg)), inference(closure_rule, [i_0_13])). % 0.14/0.32 cnf(i_0_147, plain, (~c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_ONonce(v_NB)))))),c_List_Oset(v_evs3,tc_Event_Oevent),tc_Event_Oevent)), inference(closure_rule, [i_0_12])). % 0.14/0.32 cnf(i_0_148, plain, (~c_in(c_Event_Oevent_OGets(c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Ba),c_Message_Omsg_OCrypt(c_Public_OshrK(v_Ba),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Aa),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NAa),c_Message_Omsg_ONonce(v_NB)))))),c_List_Oset(v_evs3,tc_Event_Oevent),tc_Event_Oevent)), inference(closure_rule, [i_0_11])). % 0.14/0.32 cnf(i_0_149, plain, (~c_in(v_evs3,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent))), inference(closure_rule, [i_0_10])). % 0.14/0.32 # End printing tableau % 0.14/0.32 # SZS output end % 0.14/0.32 # Branches closed with saturation will be marked with an "s" % 0.14/0.32 # Child (3160) has found a proof. % 0.14/0.32 % 0.14/0.32 # Proof search is over... % 0.14/0.32 # Freeing feature tree %------------------------------------------------------------------------------