0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.34	% Computer   : n010.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 12:47:06 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.13/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.13/0.37	#
0.13/0.37	# Presaturation interreduction done
0.13/0.37	# Number of axioms: 18 Number of unprocessed: 18
0.13/0.37	# Tableaux proof search.
0.13/0.37	# APR header successfully linked.
0.13/0.37	# Hello from C++
0.13/0.37	# The folding up rule is enabled...
0.13/0.37	# Local unification is enabled...
0.13/0.37	# Any saturation attempts will use folding labels...
0.13/0.37	# 18 beginning clauses after preprocessing and clausification
0.13/0.37	# Creating start rules for all 6 conjectures.
0.13/0.37	# There are 6 start rule candidates:
0.13/0.37	# Found 18 unit axioms.
0.13/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.13/0.37	# 6 start rule tableaux created.
0.13/0.37	# 0 extension rule candidate clauses
0.13/0.37	# 18 unit axiom clauses
0.13/0.37	
0.13/0.37	# Requested 8, 32 cores available to the main process.
0.13/0.37	# There are not enough tableaux to fork, creating more from the initial 6
0.13/0.37	# Creating equality axioms
0.13/0.37	# Ran out of tableaux, making start rules for all clauses
0.13/0.37	# Returning from population with 34 new_tableaux and 0 remaining starting tableaux.
0.13/0.37	# We now have 34 tableaux to operate on
4.16/0.89	# There were 1 total branch saturation attempts.
4.16/0.89	# There were 0 of these attempts blocked.
4.16/0.89	# There were 0 deferred branch saturation attempts.
4.16/0.89	# There were 0 free duplicated saturations.
4.16/0.89	# There were 1 total successful branch saturations.
4.16/0.89	# There were 0 successful branch saturations in interreduction.
4.16/0.89	# There were 0 successful branch saturations on the branch.
4.16/0.89	# There were 1 successful branch saturations after the branch.
4.16/0.89	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.16/0.89	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.16/0.89	# Begin clausification derivation
4.16/0.89	
4.16/0.89	# End clausification derivation
4.16/0.89	# Begin listing active clauses obtained from FOF to CNF conversion
4.16/0.89	cnf(i_0_23, negated_conjecture, (product(a,b,c)=true)).
4.16/0.89	cnf(i_0_33, negated_conjecture, (product(h,b,j)=true)).
4.16/0.89	cnf(i_0_19, negated_conjecture, (product(c,inverse(a),d)=true)).
4.16/0.89	cnf(i_0_34, negated_conjecture, (product(j,inverse(h),k)=true)).
4.16/0.89	cnf(i_0_25, plain, (product(X1,identity,X1)=true)).
4.16/0.89	cnf(i_0_28, negated_conjecture, (product(d,inverse(b),h)=true)).
4.16/0.89	cnf(i_0_27, plain, (product(identity,X1,X1)=true)).
4.16/0.89	cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
4.16/0.89	cnf(i_0_36, plain, (ifeq(X1,X1,X2,X3)=X2)).
4.16/0.89	cnf(i_0_24, plain, (product(inverse(X1),X1,identity)=true)).
4.16/0.89	cnf(i_0_22, plain, (product(X1,inverse(X1),identity)=true)).
4.16/0.89	cnf(i_0_35, plain, (product(X1,X2,multiply(X1,X2))=true)).
4.16/0.89	cnf(i_0_32, hypothesis, (ifeq(product(X1,X1,X2),true,product(X2,X1,identity),true)=true)).
4.16/0.89	cnf(i_0_29, hypothesis, (ifeq(product(X1,X1,X2),true,product(X1,X2,identity),true)=true)).
4.16/0.89	cnf(i_0_26, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
4.16/0.89	cnf(i_0_30, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true)=true)).
4.16/0.89	cnf(i_0_21, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true)=true)).
4.16/0.89	cnf(i_0_31, negated_conjecture, (product(k,inverse(b),identity)!=true)).
4.16/0.89	cnf(i_0_43, plain, (X7=X7)).
4.16/0.89	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
4.16/0.89	# Begin printing tableau
4.16/0.89	# Found 8 steps
4.16/0.89	cnf(i_0_23, negated_conjecture, (product(a,b,c)=true), inference(start_rule)).
4.16/0.89	cnf(i_0_52, plain, (product(a,b,c)=true), inference(extension_rule, [i_0_49])).
4.16/0.89	cnf(i_0_85, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_23])).
4.16/0.89	cnf(i_0_86, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_23])).
4.16/0.89	cnf(i_0_88, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_23])).
4.16/0.89	cnf(i_0_84, plain, (ifeq2(product(a,b,c),product(a,b,c),product(a,b,c),product(a,b,c))=ifeq2(true,true,true,true)), inference(extension_rule, [i_0_46])).
4.16/0.89	cnf(i_0_103, plain, (ifeq2(true,true,true,true)!=true), inference(closure_rule, [i_0_20])).
4.16/0.89	cnf(i_0_101, plain, (ifeq2(product(a,b,c),product(a,b,c),product(a,b,c),product(a,b,c))=true), inference(etableau_closure_rule, [i_0_101, ...])).
4.16/0.89	# End printing tableau
4.16/0.89	# SZS output end
4.16/0.89	# Branches closed with saturation will be marked with an "s"
4.16/0.89	# There were 1 total branch saturation attempts.
4.16/0.89	# There were 0 of these attempts blocked.
4.16/0.89	# There were 0 deferred branch saturation attempts.
4.16/0.89	# There were 0 free duplicated saturations.
4.16/0.89	# There were 1 total successful branch saturations.
4.16/0.89	# There were 0 successful branch saturations in interreduction.
4.16/0.89	# There were 0 successful branch saturations on the branch.
4.16/0.89	# There were 1 successful branch saturations after the branch.
4.16/0.89	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.16/0.89	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.16/0.89	# Begin clausification derivation
4.16/0.89	
4.16/0.89	# End clausification derivation
4.16/0.89	# Begin listing active clauses obtained from FOF to CNF conversion
4.16/0.89	cnf(i_0_23, negated_conjecture, (product(a,b,c)=true)).
4.16/0.89	cnf(i_0_33, negated_conjecture, (product(h,b,j)=true)).
4.16/0.89	cnf(i_0_19, negated_conjecture, (product(c,inverse(a),d)=true)).
4.16/0.89	cnf(i_0_34, negated_conjecture, (product(j,inverse(h),k)=true)).
4.16/0.89	cnf(i_0_25, plain, (product(X1,identity,X1)=true)).
4.16/0.89	cnf(i_0_28, negated_conjecture, (product(d,inverse(b),h)=true)).
4.16/0.89	cnf(i_0_27, plain, (product(identity,X1,X1)=true)).
4.16/0.89	cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
4.16/0.89	cnf(i_0_36, plain, (ifeq(X1,X1,X2,X3)=X2)).
4.16/0.89	cnf(i_0_24, plain, (product(inverse(X1),X1,identity)=true)).
4.16/0.89	cnf(i_0_22, plain, (product(X1,inverse(X1),identity)=true)).
4.16/0.89	cnf(i_0_35, plain, (product(X1,X2,multiply(X1,X2))=true)).
4.16/0.89	cnf(i_0_32, hypothesis, (ifeq(product(X1,X1,X2),true,product(X2,X1,identity),true)=true)).
4.16/0.89	cnf(i_0_29, hypothesis, (ifeq(product(X1,X1,X2),true,product(X1,X2,identity),true)=true)).
4.16/0.89	cnf(i_0_26, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
4.16/0.89	cnf(i_0_30, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true)=true)).
4.16/0.89	cnf(i_0_21, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true)=true)).
4.16/0.89	cnf(i_0_31, negated_conjecture, (product(k,inverse(b),identity)!=true)).
4.16/0.89	cnf(i_0_43, plain, (X7=X7)).
4.16/0.89	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
4.16/0.89	# Begin printing tableau
4.16/0.89	# Found 5 steps
4.16/0.89	cnf(i_0_23, negated_conjecture, (product(a,b,c)=true), inference(start_rule)).
4.16/0.89	cnf(i_0_52, plain, (product(a,b,c)=true), inference(extension_rule, [i_0_51])).
4.16/0.89	cnf(i_0_95, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_23])).
4.16/0.89	cnf(i_0_94, plain, (multiply(product(a,b,c),product(a,b,c))=multiply(true,true)), inference(extension_rule, [i_0_47])).
4.16/0.89	cnf(i_0_200, plain, (inverse(multiply(product(a,b,c),product(a,b,c)))=inverse(multiply(true,true))), inference(etableau_closure_rule, [i_0_200, ...])).
4.16/0.89	# End printing tableau
4.16/0.89	# SZS output end
4.16/0.89	# Branches closed with saturation will be marked with an "s"
4.16/0.90	# Child (15029) has found a proof.
4.16/0.90	
4.16/0.90	# Proof search is over...
4.16/0.90	# Freeing feature tree
4.16/0.90	EOF