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.33	Computer   : n012.cluster.edu
0.12/0.33	Model      : x86_64 x86_64
0.12/0.33	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	RAMPerCPU  : 8042.1875MB
0.12/0.33	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Aug  9 02:09:14 EDT 2022
0.12/0.33	% CPUTime    : 
0.12/0.37	# No SInE strategy applied
0.12/0.37	# Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.12/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.37	#
0.12/0.37	# Presaturation interreduction done
0.12/0.37	# Number of axioms: 59 Number of unprocessed: 58
0.12/0.37	# Tableaux proof search.
0.12/0.37	# APR header successfully linked.
0.12/0.37	# Hello from C++
0.12/0.38	# The folding up rule is enabled...
0.12/0.38	# Local unification is enabled...
0.12/0.38	# Any saturation attempts will use folding labels...
0.12/0.38	# 58 beginning clauses after preprocessing and clausification
0.12/0.38	# Creating start rules for all 1 conjectures.
0.12/0.38	# There are 1 start rule candidates:
0.12/0.38	# Found 18 unit axioms.
0.12/0.38	# 1 start rule tableaux created.
0.12/0.38	# 40 extension rule candidate clauses
0.12/0.38	# 18 unit axiom clauses
0.12/0.38	
0.12/0.38	# Requested 8, 32 cores available to the main process.
0.12/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.38	# There were 1 total branch saturation attempts.
0.12/0.38	# There were 0 of these attempts blocked.
0.12/0.38	# There were 0 deferred branch saturation attempts.
0.12/0.38	# There were 0 free duplicated saturations.
0.12/0.38	# There were 1 total successful branch saturations.
0.12/0.38	# There were 0 successful branch saturations in interreduction.
0.12/0.38	# There were 0 successful branch saturations on the branch.
0.12/0.38	# There were 1 successful branch saturations after the branch.
0.12/0.38	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.38	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.38	# Begin clausification derivation
0.12/0.38	
0.12/0.38	# End clausification derivation
0.12/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.12/0.38	cnf(i_0_41, hypothesis, (surjection(h))).
0.12/0.38	cnf(i_0_43, plain, (surjection(beta))).
0.12/0.38	cnf(i_0_33, plain, (surjection(delta))).
0.12/0.38	cnf(i_0_50, hypothesis, (surjection(f))).
0.12/0.38	cnf(i_0_42, plain, (injection(alpha))).
0.12/0.38	cnf(i_0_45, plain, (injection(gamma))).
0.12/0.38	cnf(i_0_49, plain, (exact(alpha,beta))).
0.12/0.38	cnf(i_0_44, plain, (exact(gammma,delta))).
0.12/0.38	cnf(i_0_58, plain, (morphism(h,c,r))).
0.12/0.38	cnf(i_0_40, plain, (morphism(beta,b,c))).
0.12/0.38	cnf(i_0_37, plain, (morphism(g,b,e))).
0.12/0.38	cnf(i_0_38, plain, (morphism(delta,e,r))).
0.12/0.38	cnf(i_0_51, plain, (morphism(alpha,a,b))).
0.12/0.38	cnf(i_0_47, plain, (morphism(gamma,d,e))).
0.12/0.38	cnf(i_0_46, plain, (morphism(f,a,d))).
0.12/0.38	cnf(i_0_59, plain, (commute(beta,h,g,delta))).
0.12/0.38	cnf(i_0_48, plain, (commute(alpha,g,f,gamma))).
0.12/0.38	cnf(i_0_39, negated_conjecture, (~surjection(g))).
0.12/0.38	cnf(i_0_29, plain, (esk9_1(X1)=apply(delta,X1)|~element(X1,e))).
0.12/0.38	cnf(i_0_28, plain, (element(esk9_1(X1),r)|~element(X1,e))).
0.12/0.38	cnf(i_0_30, plain, (element(esk10_1(X1),b)|~element(X1,e))).
0.12/0.38	cnf(i_0_34, plain, (element(esk11_1(X1),b)|~element(X1,e))).
0.12/0.38	cnf(i_0_36, plain, (element(esk12_1(X1),b)|~element(X1,e))).
0.12/0.38	cnf(i_0_52, plain, (element(esk13_1(X1),b)|~element(X1,e))).
0.12/0.38	cnf(i_0_53, plain, (element(esk14_1(X1),e)|~element(X1,e))).
0.12/0.38	cnf(i_0_54, plain, (element(esk15_1(X1),a)|~element(X1,e))).
0.12/0.38	cnf(i_0_17, plain, (subtract(X1,X2,X2)=zero(X1)|~element(X2,X1))).
0.12/0.38	cnf(i_0_32, plain, (apply(h,apply(beta,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))).
0.12/0.38	cnf(i_0_31, plain, (apply(delta,apply(g,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))).
0.12/0.38	cnf(i_0_9, plain, (injection(X1)|esk4_2(X1,X2)!=esk3_2(X1,X2)|~morphism(X1,X2,X3))).
0.12/0.38	cnf(i_0_6, plain, (surjection(X1)|esk2_3(X1,X2,X3)!=apply(X1,X4)|~morphism(X1,X2,X3)|~element(X4,X2))).
0.12/0.38	cnf(i_0_1, plain, (element(subtract(X1,X2,X3),X1)|~element(X3,X1)|~element(X2,X1))).
0.12/0.38	cnf(i_0_10, plain, (injection(X1)|element(esk3_2(X1,X2),X2)|~morphism(X1,X2,X3))).
0.12/0.38	cnf(i_0_55, plain, (apply(g,apply(alpha,esk15_1(X1)))=esk14_1(X1)|~element(X1,e))).
0.12/0.38	cnf(i_0_7, plain, (surjection(X1)|element(esk2_3(X1,X2,X3),X3)|~morphism(X1,X2,X3))).
0.12/0.38	cnf(i_0_56, plain, (apply(gamma,apply(f,esk15_1(X1)))=esk14_1(X1)|~element(X1,e))).
0.12/0.38	cnf(i_0_23, plain, (zero(X1)=apply(X2,zero(X3))|~morphism(X2,X3,X1))).
0.12/0.38	cnf(i_0_57, plain, (subtract(e,apply(g,esk13_1(X1)),X1)=esk14_1(X1)|~element(X1,e))).
0.12/0.38	cnf(i_0_11, plain, (injection(X1)|element(esk4_2(X1,X2),X2)|~morphism(X1,X2,X3))).
0.12/0.38	cnf(i_0_35, plain, (apply(g,subtract(b,esk11_1(X1),esk12_1(X1)))=X1|~element(X1,e))).
0.12/0.38	cnf(i_0_24, plain, (element(apply(X1,X2),X3)|~morphism(X1,X4,X3)|~element(X2,X4))).
0.12/0.38	cnf(i_0_3, plain, (element(esk1_4(X1,X2,X3,X4),X2)|~surjection(X1)|~morphism(X1,X2,X3)|~element(X4,X3))).
0.12/0.38	cnf(i_0_5, plain, (subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1))).
0.12/0.38	cnf(i_0_25, plain, (X1=X2|apply(X3,X1)!=apply(X3,X2)|~injection(X3)|~morphism(X3,X4,X5)|~element(X2,X4)|~element(X1,X4))).
0.12/0.38	cnf(i_0_4, plain, (apply(X1,esk1_4(X1,X2,X3,X4))=X4|~surjection(X1)|~morphism(X1,X2,X3)|~element(X4,X3))).
0.12/0.38	cnf(i_0_12, plain, (apply(X1,esk4_2(X1,X2))=apply(X1,esk3_2(X1,X2))|injection(X1)|~morphism(X1,X2,X3))).
0.12/0.38	cnf(i_0_14, plain, (zero(X1)=apply(X2,apply(X3,X4))|~exact(X3,X2)|~morphism(X3,X5,X6)|~morphism(X2,X6,X1)|~element(X4,X5))).
0.12/0.38	cnf(i_0_8, plain, (apply(X1,subtract(X2,X3,X4))=subtract(X5,apply(X1,X3),apply(X1,X4))|~morphism(X1,X2,X5)|~element(X4,X2)|~element(X3,X2))).
0.12/0.38	cnf(i_0_15, plain, (element(esk5_6(X1,X2,X3,X4,X5,X6),X3)|zero(X5)!=apply(X2,X6)|~exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4)|~element(X6,X4))).
0.12/0.38	cnf(i_0_16, plain, (apply(X1,esk5_6(X1,X2,X3,X4,X5,X6))=X6|zero(X5)!=apply(X2,X6)|~exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4)|~element(X6,X4))).
0.12/0.38	cnf(i_0_27, plain, (commute(X1,X2,X3,X4)|element(esk8_7(X1,X2,X3,X4,X5,X6,X7),X5)|~morphism(X4,X7,X8)|~morphism(X3,X5,X7)|~morphism(X2,X6,X8)|~morphism(X1,X5,X6))).
0.12/0.38	cnf(i_0_22, plain, (exact(X1,X2)|apply(X2,esk6_5(X1,X2,X3,X4,X5))!=zero(X5)|esk6_5(X1,X2,X3,X4,X5)!=apply(X1,X6)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4)|~element(esk6_5(X1,X2,X3,X4,X5),X4)|~element(X6,X3))).
0.12/0.38	cnf(i_0_19, plain, (exact(X1,X2)|element(esk7_5(X1,X2,X3,X4,X5),X3)|element(esk6_5(X1,X2,X3,X4,X5),X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
0.12/0.38	cnf(i_0_18, plain, (apply(X1,esk6_5(X2,X1,X3,X4,X5))=zero(X5)|exact(X2,X1)|element(esk7_5(X2,X1,X3,X4,X5),X3)|~morphism(X2,X3,X4)|~morphism(X1,X4,X5))).
0.12/0.38	cnf(i_0_21, plain, (apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|exact(X1,X2)|element(esk6_5(X1,X2,X3,X4,X5),X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
0.12/0.38	cnf(i_0_2, plain, (apply(X1,apply(X2,X3))=apply(X4,apply(X5,X3))|~morphism(X4,X6,X7)|~morphism(X5,X8,X6)|~morphism(X1,X9,X7)|~morphism(X2,X8,X9)|~commute(X2,X1,X5,X4)|~element(X3,X8))).
0.12/0.38	cnf(i_0_20, plain, (apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|apply(X2,esk6_5(X1,X2,X3,X4,X5))=zero(X5)|exact(X1,X2)|~morphism(X1,X3,X4)|~morphism(X2,X4,X5))).
0.12/0.38	cnf(i_0_26, plain, (commute(X1,X2,X3,X4)|apply(X2,apply(X1,esk8_7(X1,X2,X3,X4,X5,X6,X7)))!=apply(X4,apply(X3,esk8_7(X1,X2,X3,X4,X5,X6,X7)))|~morphism(X4,X7,X8)|~morphism(X3,X5,X7)|~morphism(X1,X5,X6)|~morphism(X2,X6,X8))).
0.12/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.12/0.38	# Begin printing tableau
0.12/0.38	# Found 5 steps
0.12/0.38	cnf(i_0_39, negated_conjecture, (~surjection(g)), inference(start_rule)).
0.12/0.38	cnf(i_0_62, plain, (~surjection(g)), inference(extension_rule, [i_0_7])).
0.12/0.38	cnf(i_0_102, plain, (~morphism(g,b,e)), inference(closure_rule, [i_0_37])).
0.12/0.38	cnf(i_0_101, plain, (element(esk2_3(g,b,e),e)), inference(extension_rule, [i_0_29])).
0.12/0.38	cnf(i_0_204, plain, (esk9_1(esk2_3(g,b,e))=apply(delta,esk2_3(g,b,e))), inference(etableau_closure_rule, [i_0_204, ...])).
0.12/0.38	# End printing tableau
0.12/0.38	# SZS output end
0.12/0.38	# Branches closed with saturation will be marked with an "s"
0.12/0.38	# Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
0.12/0.38	# We now have 2 tableaux to operate on
0.12/0.38	# Found closed tableau during pool population.
0.12/0.38	# Proof search is over...
0.12/0.38	# Freeing feature tree
0.12/0.38	EOF