0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.34	% Computer   : n020.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 15:12:51 EDT 2021
0.12/0.34	% CPUTime    : 
0.12/0.38	# No SInE strategy applied
0.12/0.38	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
0.12/0.38	# and selection function SelectCQIPrecWNTNp.
0.12/0.38	#
0.12/0.38	# Presaturation interreduction done
0.12/0.38	# Number of axioms: 57 Number of unprocessed: 56
0.12/0.38	# Tableaux proof search.
0.12/0.38	# APR header successfully linked.
0.12/0.38	# 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	# 56 beginning clauses after preprocessing and clausification
0.12/0.38	# Creating start rules for all 2 conjectures.
0.12/0.38	# There are 2 start rule candidates:
0.12/0.38	# Found 18 unit axioms.
0.12/0.38	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.12/0.38	# 2 start rule tableaux created.
0.12/0.38	# 38 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 2
0.12/0.38	# Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
0.12/0.38	# We now have 16 tableaux to operate on
12.43/2.06	# Creating equality axioms
12.43/2.06	# Ran out of tableaux, making start rules for all clauses
13.02/2.15	# Creating equality axioms
13.02/2.15	# Ran out of tableaux, making start rules for all clauses
13.02/2.16	# Creating equality axioms
13.02/2.16	# Ran out of tableaux, making start rules for all clauses
13.02/2.17	# Creating equality axioms
13.02/2.17	# Ran out of tableaux, making start rules for all clauses
14.09/2.28	# There were 1 total branch saturation attempts.
14.09/2.28	# There were 0 of these attempts blocked.
14.09/2.28	# There were 0 deferred branch saturation attempts.
14.09/2.28	# There were 0 free duplicated saturations.
14.09/2.28	# There were 1 total successful branch saturations.
14.09/2.28	# There were 0 successful branch saturations in interreduction.
14.09/2.28	# There were 0 successful branch saturations on the branch.
14.09/2.28	# There were 1 successful branch saturations after the branch.
14.09/2.28	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
14.09/2.28	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
14.09/2.28	# Begin clausification derivation
14.09/2.28	
14.09/2.28	# End clausification derivation
14.09/2.28	# Begin listing active clauses obtained from FOF to CNF conversion
14.09/2.28	cnf(i_0_49, negated_conjecture, (element(esk14_0,e))).
14.09/2.28	cnf(i_0_34, plain, (morphism(g,b,e))).
14.09/2.28	cnf(i_0_54, plain, (injection(alpha))).
14.09/2.28	cnf(i_0_46, plain, (injection(gamma))).
14.09/2.28	cnf(i_0_47, plain, (surjection(delta))).
14.09/2.28	cnf(i_0_57, hypothesis, (surjection(h))).
14.09/2.28	cnf(i_0_33, plain, (surjection(beta))).
14.09/2.28	cnf(i_0_51, hypothesis, (surjection(f))).
14.09/2.28	cnf(i_0_50, plain, (exact(alpha,beta))).
14.09/2.28	cnf(i_0_52, plain, (exact(gammma,delta))).
14.09/2.28	cnf(i_0_45, plain, (morphism(delta,e,r))).
14.09/2.28	cnf(i_0_56, plain, (morphism(beta,b,c))).
14.09/2.28	cnf(i_0_37, plain, (morphism(alpha,a,b))).
14.09/2.28	cnf(i_0_55, plain, (morphism(h,c,r))).
14.09/2.28	cnf(i_0_36, plain, (morphism(f,a,d))).
14.09/2.28	cnf(i_0_53, plain, (morphism(gamma,d,e))).
14.09/2.28	cnf(i_0_35, plain, (commute(beta,h,g,delta))).
14.09/2.28	cnf(i_0_38, plain, (commute(alpha,g,f,gamma))).
14.09/2.28	cnf(i_0_48, negated_conjecture, (apply(g,subtract(b,X1,X2))!=esk14_0|~element(X2,b)|~element(X1,b))).
14.09/2.28	cnf(i_0_30, plain, (element(esk10_1(X1),b)|~element(X1,e))).
14.09/2.28	cnf(i_0_39, plain, (element(esk11_1(X1),b)|~element(X1,e))).
14.09/2.28	cnf(i_0_44, plain, (element(esk12_1(X1),e)|~element(X1,e))).
14.09/2.28	cnf(i_0_29, plain, (esk9_1(X1)=apply(delta,X1)|~element(X1,e))).
14.09/2.28	cnf(i_0_28, plain, (element(esk9_1(X1),r)|~element(X1,e))).
14.09/2.28	cnf(i_0_41, plain, (element(esk13_1(X1),a)|~element(X1,e))).
14.09/2.28	cnf(i_0_32, plain, (apply(delta,apply(g,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))).
14.09/2.28	cnf(i_0_43, plain, (apply(g,apply(alpha,esk13_1(X1)))=esk12_1(X1)|~element(X1,e))).
14.09/2.28	cnf(i_0_31, plain, (apply(h,apply(beta,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))).
14.09/2.28	cnf(i_0_27, plain, (subtract(X1,X2,X2)=zero(X1)|~element(X2,X1))).
14.09/2.28	cnf(i_0_3, plain, (injection(X1)|esk2_2(X1,X2)!=esk1_2(X1,X2)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_10, plain, (surjection(X1)|esk4_3(X1,X2,X3)!=apply(X1,X4)|~element(X4,X2)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_15, plain, (element(subtract(X1,X2,X3),X1)|~element(X2,X1)|~element(X3,X1))).
14.09/2.28	cnf(i_0_4, plain, (injection(X1)|element(esk1_2(X1,X2),X2)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_42, plain, (apply(gamma,apply(f,esk13_1(X1)))=esk12_1(X1)|~element(X1,e))).
14.09/2.28	cnf(i_0_40, plain, (subtract(e,apply(g,esk11_1(X1)),X1)=esk12_1(X1)|~element(X1,e))).
14.09/2.28	cnf(i_0_2, plain, (element(apply(X1,X2),X3)|~element(X2,X4)|~morphism(X1,X4,X3))).
14.09/2.28	cnf(i_0_12, plain, (subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1))).
14.09/2.28	cnf(i_0_1, plain, (zero(X1)=apply(X2,zero(X3))|~morphism(X2,X3,X1))).
14.09/2.28	cnf(i_0_5, plain, (injection(X1)|element(esk2_2(X1,X2),X2)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_11, plain, (surjection(X1)|element(esk4_3(X1,X2,X3),X3)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_8, plain, (element(esk3_4(X1,X2,X3,X4),X2)|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_17, plain, (X1=X2|apply(X3,X1)!=apply(X3,X2)|~injection(X3)|~element(X2,X4)|~element(X1,X4)|~morphism(X3,X4,X5))).
14.09/2.28	cnf(i_0_7, plain, (apply(X1,esk3_4(X1,X2,X3,X4))=X4|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_6, plain, (apply(X1,esk2_2(X1,X2))=apply(X1,esk1_2(X1,X2))|injection(X1)|~morphism(X1,X2,X3))).
14.09/2.28	cnf(i_0_9, plain, (apply(X1,subtract(X2,X3,X4))=subtract(X5,apply(X1,X3),apply(X1,X4))|~element(X3,X2)|~element(X4,X2)|~morphism(X1,X2,X5))).
14.09/2.28	cnf(i_0_24, plain, (zero(X1)=apply(X2,apply(X3,X4))|~exact(X3,X2)|~element(X4,X5)|~morphism(X3,X5,X6)|~morphism(X2,X6,X1))).
14.09/2.28	cnf(i_0_16, plain, (apply(X1,apply(X2,X3))=apply(X4,apply(X5,X3))|~commute(X2,X1,X5,X4)|~element(X3,X6)|~morphism(X4,X7,X8)|~morphism(X5,X6,X7)|~morphism(X1,X9,X8)|~morphism(X2,X6,X9))).
14.09/2.28	cnf(i_0_26, plain, (element(esk8_6(X1,X2,X3,X4,X5,X6),X3)|zero(X5)!=apply(X2,X6)|~exact(X1,X2)|~element(X6,X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
14.09/2.28	cnf(i_0_25, plain, (apply(X1,esk8_6(X1,X2,X3,X4,X5,X6))=X6|zero(X5)!=apply(X2,X6)|~exact(X1,X2)|~element(X6,X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
14.09/2.28	cnf(i_0_14, plain, (commute(X1,X2,X3,X4)|element(esk5_8(X1,X2,X3,X4,X5,X6,X7,X8),X5)|~morphism(X4,X7,X8)|~morphism(X3,X5,X7)|~morphism(X2,X6,X8)|~morphism(X1,X5,X6))).
14.09/2.28	cnf(i_0_22, plain, (exact(X1,X2)|apply(X2,esk6_5(X1,X2,X3,X4,X5))!=zero(X5)|apply(X1,X6)!=esk6_5(X1,X2,X3,X4,X5)|~element(esk6_5(X1,X2,X3,X4,X5),X4)|~element(X6,X3)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
14.09/2.28	cnf(i_0_20, 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))).
14.09/2.28	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(X1,X4,X5)|~morphism(X2,X3,X4))).
14.09/2.28	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))).
14.09/2.28	cnf(i_0_19, 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(X2,X4,X5)|~morphism(X1,X3,X4))).
14.09/2.28	cnf(i_0_13, plain, (commute(X1,X2,X3,X4)|apply(X2,apply(X1,esk5_8(X1,X2,X3,X4,X5,X6,X7,X8)))!=apply(X4,apply(X3,esk5_8(X1,X2,X3,X4,X5,X6,X7,X8)))|~morphism(X4,X7,X8)|~morphism(X3,X5,X7)|~morphism(X1,X5,X6)|~morphism(X2,X6,X8))).
14.09/2.28	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
14.09/2.28	# Begin printing tableau
14.09/2.28	# Found 4 steps
14.09/2.28	cnf(i_0_49, negated_conjecture, (element(esk14_0,e)), inference(start_rule)).
14.09/2.28	cnf(i_0_63, plain, (element(esk14_0,e)), inference(extension_rule, [i_0_30])).
14.09/2.28	cnf(i_0_340, plain, (element(esk10_1(esk14_0),b)), inference(extension_rule, [i_0_27])).
14.09/2.28	cnf(i_0_358, plain, (subtract(b,esk10_1(esk14_0),esk10_1(esk14_0))=zero(b)), inference(etableau_closure_rule, [i_0_358, ...])).
14.09/2.28	# End printing tableau
14.09/2.28	# SZS output end
14.09/2.28	# Branches closed with saturation will be marked with an "s"
14.33/2.30	# Child (11981) has found a proof.
14.33/2.30	
14.33/2.30	# Proof search is over...
14.33/2.30	# Freeing feature tree
14.33/2.34	EOF