0.11/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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   : n020.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 11:00:51 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.35	# No SInE strategy applied
0.12/0.35	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.12/0.35	# and selection function PSelectComplexExceptUniqMaxHorn.
0.12/0.35	#
0.12/0.35	# Number of axioms: 10 Number of unprocessed: 10
0.12/0.35	# Tableaux proof search.
0.12/0.35	# APR header successfully linked.
0.12/0.35	# Hello from C++
0.12/0.36	# The folding up rule is enabled...
0.12/0.36	# Local unification is enabled...
0.12/0.36	# Any saturation attempts will use folding labels...
0.12/0.36	# 10 beginning clauses after preprocessing and clausification
0.12/0.36	# Creating start rules for all 1 conjectures.
0.12/0.36	# There are 1 start rule candidates:
0.12/0.36	# Found 10 unit axioms.
0.12/0.36	# 1 start rule tableaux created.
0.12/0.36	# 0 extension rule candidate clauses
0.12/0.36	# 10 unit axiom clauses
0.12/0.36	
0.12/0.36	# Requested 8, 32 cores available to the main process.
0.12/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.36	# Creating equality axioms
0.12/0.36	# Ran out of tableaux, making start rules for all clauses
0.12/0.36	# Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
0.12/0.36	# We now have 24 tableaux to operate on
22.66/3.29	# There were 1 total branch saturation attempts.
22.66/3.29	# There were 0 of these attempts blocked.
22.66/3.29	# There were 0 deferred branch saturation attempts.
22.66/3.29	# There were 0 free duplicated saturations.
22.66/3.29	# There were 1 total successful branch saturations.
22.66/3.29	# There were 0 successful branch saturations in interreduction.
22.66/3.29	# There were 0 successful branch saturations on the branch.
22.66/3.29	# There were 1 successful branch saturations after the branch.
22.66/3.29	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
22.66/3.29	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
22.66/3.29	# Begin clausification derivation
22.66/3.29	
22.66/3.29	# End clausification derivation
22.66/3.29	# Begin listing active clauses obtained from FOF to CNF conversion
22.66/3.29	cnf(i_0_19, hypothesis, (equalish(a,b)=true)).
22.66/3.29	cnf(i_0_12, negated_conjecture, (equalish(inverse(a),inverse(b))!=true)).
22.66/3.29	cnf(i_0_17, plain, (product(identity,X1,X1)=true)).
22.66/3.29	cnf(i_0_16, plain, (product(inverse(X1),X1,identity)=true)).
22.66/3.29	cnf(i_0_20, plain, (product(X1,X2,multiply(X1,X2))=true)).
22.66/3.29	cnf(i_0_13, plain, (ifeq(X2,X2,X1,X3)=X1)).
22.66/3.29	cnf(i_0_18, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X2,X4),true,equalish(X4,X3),true),true)=true)).
22.66/3.29	cnf(i_0_14, plain, (ifeq(equalish(X1,X2),true,ifeq(product(X3,X4,X1),true,product(X3,X4,X2),true),true)=true)).
22.66/3.29	cnf(i_0_11, 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)).
22.66/3.29	cnf(i_0_15, 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)).
22.66/3.29	cnf(i_0_22, plain, (X7=X7)).
22.66/3.29	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
22.66/3.29	# Begin printing tableau
22.66/3.29	# Found 7 steps
22.66/3.29	cnf(i_0_19, hypothesis, (equalish(a,b)=true), inference(start_rule)).
22.66/3.29	cnf(i_0_31, plain, (equalish(a,b)=true), inference(extension_rule, [i_0_30])).
22.66/3.29	cnf(i_0_65, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
22.66/3.29	cnf(i_0_63, plain, (multiply(equalish(a,b),equalish(a,b))=multiply(true,true)), inference(extension_rule, [i_0_26])).
22.66/3.29	cnf(i_0_163, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
22.66/3.29	cnf(i_0_164, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
22.66/3.29	cnf(i_0_161, plain, (product(multiply(equalish(a,b),equalish(a,b)),equalish(a,b),equalish(a,b))=product(multiply(true,true),true,true)), inference(etableau_closure_rule, [i_0_161, ...])).
22.66/3.29	# End printing tableau
22.66/3.29	# SZS output end
22.66/3.29	# Branches closed with saturation will be marked with an "s"
23.44/3.31	# Child (24159) has found a proof.
23.44/3.31	
23.44/3.31	# Proof search is over...
23.44/3.31	# Freeing feature tree
23.44/3.36	EOF