0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.32	% Computer   : n020.cluster.edu
0.12/0.32	% Model      : x86_64 x86_64
0.12/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory     : 8042.1875MB
0.12/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1200
0.12/0.32	% WCLimit    : 120
0.12/0.32	% DateTime   : Wed Jul 14 17:13:35 EDT 2021
0.17/0.32	% CPUTime    : 
0.17/0.35	# No SInE strategy applied
0.17/0.35	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.17/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.17/0.35	#
0.17/0.35	# Presaturation interreduction done
0.17/0.35	# Number of axioms: 82 Number of unprocessed: 82
0.17/0.35	# Tableaux proof search.
0.17/0.35	# APR header successfully linked.
0.17/0.35	# Hello from C++
0.17/0.35	# The folding up rule is enabled...
0.17/0.35	# Local unification is enabled...
0.17/0.35	# Any saturation attempts will use folding labels...
0.17/0.35	# 82 beginning clauses after preprocessing and clausification
0.17/0.35	# Creating start rules for all 1 conjectures.
0.17/0.35	# There are 1 start rule candidates:
0.17/0.35	# Found 59 unit axioms.
0.17/0.35	# 1 start rule tableaux created.
0.17/0.35	# 23 extension rule candidate clauses
0.17/0.35	# 59 unit axiom clauses
0.17/0.35	
0.17/0.35	# Requested 8, 32 cores available to the main process.
0.17/0.35	# There are not enough tableaux to fork, creating more from the initial 1
0.17/0.35	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.17/0.35	# We now have 8 tableaux to operate on
0.17/0.36	# There were 1 total branch saturation attempts.
0.17/0.36	# There were 0 of these attempts blocked.
0.17/0.36	# There were 0 deferred branch saturation attempts.
0.17/0.36	# There were 0 free duplicated saturations.
0.17/0.36	# There were 1 total successful branch saturations.
0.17/0.36	# There were 0 successful branch saturations in interreduction.
0.17/0.36	# There were 0 successful branch saturations on the branch.
0.17/0.36	# There were 1 successful branch saturations after the branch.
0.17/0.36	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.17/0.36	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.17/0.36	# Begin clausification derivation
0.17/0.36	
0.17/0.36	# End clausification derivation
0.17/0.36	# Begin listing active clauses obtained from FOF to CNF conversion
0.17/0.36	cnf(i_0_41, plain, (pred_attacker(constr_CONST_4))).
0.17/0.36	cnf(i_0_3, plain, (pred_attacker(tuple_true))).
0.17/0.36	cnf(i_0_70, plain, (pred_attacker(name_c))).
0.17/0.36	cnf(i_0_11, plain, (pred_attacker(constr_CONST_0x30))).
0.17/0.36	cnf(i_0_55, plain, (pred_attacker(constr_CONST_3))).
0.17/0.36	cnf(i_0_29, plain, (pred_attacker(constr_CONST_1))).
0.17/0.36	cnf(i_0_18, plain, (pred_attacker(constr_CONST_2))).
0.17/0.36	cnf(i_0_72, plain, (pred_attacker(tuple_false))).
0.17/0.36	cnf(i_0_51, plain, (pred_equal(X1,X1))).
0.17/0.36	cnf(i_0_56, plain, (pred_attacker(name_new0x2Dname(X1)))).
0.17/0.36	cnf(i_0_27, plain, (pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))))).
0.17/0.36	cnf(i_0_15, plain, (constr_comm_dec(constr_comm_enc(X1,X2),X2)=X1)).
0.17/0.36	cnf(i_0_78, plain, (constr_dec(constr_enc(X1,X2),X2)=X1)).
0.17/0.36	cnf(i_0_42, plain, (name_objective!=name_Ka)).
0.17/0.36	cnf(i_0_34, negated_conjecture, (~pred_attacker(name_objective))).
0.17/0.36	cnf(i_0_47, plain, (name_objective!=name_m_9)).
0.17/0.36	cnf(i_0_61, plain, (constr_CONST_4!=name_objective)).
0.17/0.36	cnf(i_0_64, plain, (name_Kb!=name_objective)).
0.17/0.36	cnf(i_0_2, plain, (constr_CONST_4!=name_Kb)).
0.17/0.36	cnf(i_0_52, plain, (constr_CONST_4!=name_Ka)).
0.17/0.36	cnf(i_0_4, plain, (name_Kb!=name_Ka)).
0.17/0.36	cnf(i_0_5, plain, (constr_CONST_4!=name_m_9)).
0.17/0.36	cnf(i_0_80, plain, (name_Kb!=name_m_9)).
0.17/0.36	cnf(i_0_77, plain, (name_c!=name_objective)).
0.17/0.36	cnf(i_0_33, plain, (constr_CONST_0x30!=name_objective)).
0.17/0.36	cnf(i_0_10, plain, (constr_CONST_3!=name_objective)).
0.17/0.36	cnf(i_0_44, plain, (constr_CONST_1!=name_objective)).
0.17/0.36	cnf(i_0_60, plain, (constr_CONST_2!=name_objective)).
0.17/0.36	cnf(i_0_45, plain, (name_Ka!=name_m_9)).
0.17/0.36	cnf(i_0_32, plain, (constr_CONST_4!=name_c)).
0.17/0.36	cnf(i_0_12, plain, (name_Kb!=name_c)).
0.17/0.36	cnf(i_0_6, plain, (name_c!=name_Ka)).
0.17/0.36	cnf(i_0_23, plain, (name_c!=name_m_9)).
0.17/0.36	cnf(i_0_57, plain, (constr_CONST_4!=constr_CONST_0x30)).
0.17/0.36	cnf(i_0_50, plain, (name_Kb!=constr_CONST_0x30)).
0.17/0.36	cnf(i_0_36, plain, (constr_CONST_0x30!=name_Ka)).
0.17/0.36	cnf(i_0_8, plain, (constr_CONST_0x30!=name_m_9)).
0.17/0.36	cnf(i_0_46, plain, (constr_CONST_0x30!=name_c)).
0.17/0.36	cnf(i_0_19, plain, (constr_CONST_4!=constr_CONST_3)).
0.17/0.36	cnf(i_0_49, plain, (name_Kb!=constr_CONST_3)).
0.17/0.36	cnf(i_0_38, plain, (constr_CONST_3!=name_Ka)).
0.17/0.36	cnf(i_0_14, plain, (constr_CONST_3!=name_m_9)).
0.17/0.36	cnf(i_0_26, plain, (constr_CONST_3!=name_c)).
0.17/0.36	cnf(i_0_65, plain, (constr_CONST_3!=constr_CONST_0x30)).
0.17/0.36	cnf(i_0_13, plain, (constr_CONST_4!=constr_CONST_1)).
0.17/0.36	cnf(i_0_58, plain, (name_Kb!=constr_CONST_1)).
0.17/0.36	cnf(i_0_68, plain, (constr_CONST_1!=name_Ka)).
0.17/0.36	cnf(i_0_82, plain, (constr_CONST_1!=name_m_9)).
0.17/0.36	cnf(i_0_67, plain, (constr_CONST_1!=name_c)).
0.17/0.36	cnf(i_0_28, plain, (constr_CONST_1!=constr_CONST_0x30)).
0.17/0.36	cnf(i_0_39, plain, (constr_CONST_1!=constr_CONST_3)).
0.17/0.36	cnf(i_0_40, plain, (constr_CONST_4!=constr_CONST_2)).
0.17/0.36	cnf(i_0_22, plain, (name_Kb!=constr_CONST_2)).
0.17/0.36	cnf(i_0_24, plain, (constr_CONST_2!=name_Ka)).
0.17/0.36	cnf(i_0_59, plain, (constr_CONST_2!=name_m_9)).
0.17/0.36	cnf(i_0_37, plain, (constr_CONST_2!=name_c)).
0.17/0.36	cnf(i_0_35, plain, (constr_CONST_2!=constr_CONST_0x30)).
0.17/0.36	cnf(i_0_53, plain, (constr_CONST_2!=constr_CONST_3)).
0.17/0.36	cnf(i_0_76, plain, (constr_CONST_2!=constr_CONST_1)).
0.17/0.36	cnf(i_0_17, plain, (pred_attacker(X1)|~pred_attacker(tuple_A_out_1(X1)))).
0.17/0.36	cnf(i_0_9, plain, (pred_attacker(X1)|~pred_attacker(tuple_A_in_2(X1)))).
0.17/0.36	cnf(i_0_31, plain, (pred_attacker(X1)|~pred_attacker(tuple_B_in_3(X1)))).
0.17/0.36	cnf(i_0_25, plain, (pred_attacker(X1)|~pred_attacker(tuple_B_in_1(X1)))).
0.17/0.36	cnf(i_0_7, plain, (pred_attacker(tuple_A_out_1(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_20, plain, (pred_attacker(tuple_A_in_2(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_69, plain, (pred_attacker(X1)|~pred_attacker(tuple_A_out_4(X1)))).
0.17/0.36	cnf(i_0_73, plain, (pred_attacker(X1)|~pred_attacker(tuple_B_out_2(X1)))).
0.17/0.36	cnf(i_0_66, plain, (pred_attacker(X1)|~pred_attacker(tuple_A_out_3(X1)))).
0.17/0.36	cnf(i_0_16, plain, (pred_attacker(X1)|~pred_mess(X2,X1)|~pred_attacker(X2))).
0.17/0.36	cnf(i_0_21, plain, (pred_attacker(tuple_B_in_3(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_74, plain, (pred_attacker(tuple_B_in_1(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_63, plain, (pred_attacker(tuple_A_out_4(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_62, plain, (pred_attacker(tuple_B_out_2(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_71, plain, (pred_attacker(tuple_A_out_3(X1))|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_81, plain, (pred_mess(X1,X2)|~pred_attacker(X1)|~pred_attacker(X2))).
0.17/0.36	cnf(i_0_1, plain, (pred_attacker(constr_dec(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_54, plain, (pred_attacker(constr_comm_enc(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_48, plain, (pred_attacker(constr_comm_dec(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
0.17/0.36	cnf(i_0_43, plain, (pred_attacker(constr_enc(X1,X2))|~pred_attacker(X1)|~pred_attacker(X2))).
0.17/0.36	cnf(i_0_30, plain, (pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))|~pred_attacker(tuple_A_in_2(X1)))).
0.17/0.36	cnf(i_0_75, plain, (pred_attacker(tuple_B_out_2(constr_comm_enc(X1,name_Kb)))|~pred_attacker(tuple_B_in_1(X1)))).
0.17/0.36	cnf(i_0_79, plain, (pred_attacker(tuple_A_out_3(constr_comm_dec(X1,name_Ka)))|~pred_attacker(tuple_A_in_2(X1)))).
0.17/0.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.17/0.36	# Begin printing tableau
0.17/0.36	# Found 4 steps
0.17/0.36	cnf(i_0_34, negated_conjecture, (~pred_attacker(name_objective)), inference(start_rule)).
0.17/0.36	cnf(i_0_83, plain, (~pred_attacker(name_objective)), inference(extension_rule, [i_0_73])).
0.17/0.36	cnf(i_0_99, plain, (~pred_attacker(tuple_B_out_2(name_objective))), inference(extension_rule, [i_0_17])).
0.17/0.36	cnf(i_0_137, plain, (~pred_attacker(tuple_A_out_1(tuple_B_out_2(name_objective)))), inference(etableau_closure_rule, [i_0_137, ...])).
0.17/0.36	# End printing tableau
0.17/0.36	# SZS output end
0.17/0.36	# Branches closed with saturation will be marked with an "s"
0.17/0.36	# Child (32518) has found a proof.
0.17/0.36	
0.17/0.36	# Proof search is over...
0.17/0.36	# Freeing feature tree
0.17/0.36	EOF