0.12/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/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   : n014.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   : Tue Jul 13 14:10:04 EDT 2021
0.12/0.33	% CPUTime    : 
0.18/0.35	# No SInE strategy applied
0.18/0.35	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.18/0.35	# and selection function SelectNewComplexAHP.
0.18/0.35	#
0.18/0.35	# Presaturation interreduction done
0.18/0.35	# Number of axioms: 19 Number of unprocessed: 19
0.18/0.35	# Tableaux proof search.
0.18/0.35	# APR header successfully linked.
0.18/0.35	# Hello from C++
0.18/0.35	# The folding up rule is enabled...
0.18/0.35	# Local unification is enabled...
0.18/0.35	# Any saturation attempts will use folding labels...
0.18/0.35	# 19 beginning clauses after preprocessing and clausification
0.18/0.35	# Creating start rules for all 1 conjectures.
0.18/0.35	# There are 1 start rule candidates:
0.18/0.35	# Found 19 unit axioms.
0.18/0.35	# 1 start rule tableaux created.
0.18/0.35	# 0 extension rule candidate clauses
0.18/0.35	# 19 unit axiom clauses
0.18/0.35	
0.18/0.35	# Requested 8, 32 cores available to the main process.
0.18/0.35	# There are not enough tableaux to fork, creating more from the initial 1
0.18/0.35	# Creating equality axioms
0.18/0.35	# Ran out of tableaux, making start rules for all clauses
0.18/0.35	# Returning from population with 28 new_tableaux and 0 remaining starting tableaux.
0.18/0.35	# We now have 28 tableaux to operate on
11.79/1.86	# There were 1 total branch saturation attempts.
11.79/1.86	# There were 0 of these attempts blocked.
11.79/1.86	# There were 0 deferred branch saturation attempts.
11.79/1.86	# There were 0 free duplicated saturations.
11.79/1.86	# There were 1 total successful branch saturations.
11.79/1.86	# There were 0 successful branch saturations in interreduction.
11.79/1.86	# There were 0 successful branch saturations on the branch.
11.79/1.86	# There were 1 successful branch saturations after the branch.
11.79/1.86	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
11.79/1.86	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
11.79/1.86	# Begin clausification derivation
11.79/1.86	
11.79/1.86	# End clausification derivation
11.79/1.86	# Begin listing active clauses obtained from FOF to CNF conversion
11.79/1.86	cnf(i_0_37, hypothesis, (inverse(identity)=identity)).
11.79/1.86	cnf(i_0_35, hypothesis, (inverse(inverse(X1))=X1)).
11.79/1.86	cnf(i_0_21, plain, (multiply(identity,X1)=X1)).
11.79/1.86	cnf(i_0_28, plain, (least_upper_bound(X1,X1)=X1)).
11.79/1.86	cnf(i_0_25, plain, (greatest_lower_bound(X1,X1)=X1)).
11.79/1.86	cnf(i_0_22, plain, (multiply(inverse(X1),X1)=identity)).
11.79/1.86	cnf(i_0_33, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
11.79/1.86	cnf(i_0_26, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
11.79/1.86	cnf(i_0_24, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
11.79/1.86	cnf(i_0_20, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
11.79/1.86	cnf(i_0_31, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
11.79/1.86	cnf(i_0_36, hypothesis, (multiply(inverse(X1),inverse(X2))=inverse(multiply(X2,X1)))).
11.79/1.86	cnf(i_0_29, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
11.79/1.86	cnf(i_0_27, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
11.79/1.86	cnf(i_0_32, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
11.79/1.86	cnf(i_0_23, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
11.79/1.86	cnf(i_0_30, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
11.79/1.86	cnf(i_0_34, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
11.79/1.86	cnf(i_0_38, negated_conjecture, (multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b))!=least_upper_bound(a,b))).
11.79/1.86	cnf(i_0_40, plain, (X4=X4)).
11.79/1.86	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
11.79/1.86	# Begin printing tableau
11.79/1.86	# Found 6 steps
11.79/1.86	cnf(i_0_37, hypothesis, (inverse(identity)=identity), inference(start_rule)).
11.79/1.86	cnf(i_0_48, plain, (inverse(identity)=identity), inference(extension_rule, [i_0_44])).
11.79/1.86	cnf(i_0_77, plain, (inverse(identity)!=identity), inference(closure_rule, [i_0_37])).
11.79/1.86	cnf(i_0_75, plain, (multiply(inverse(identity),inverse(identity))=multiply(identity,identity)), inference(extension_rule, [i_0_43])).
11.79/1.86	cnf(i_0_92, plain, (multiply(identity,identity)!=inverse(inverse(multiply(identity,identity)))), inference(closure_rule, [i_0_35])).
11.79/1.86	cnf(i_0_90, plain, (multiply(inverse(identity),inverse(identity))=inverse(inverse(multiply(identity,identity)))), inference(etableau_closure_rule, [i_0_90, ...])).
11.79/1.86	# End printing tableau
11.79/1.86	# SZS output end
11.79/1.86	# Branches closed with saturation will be marked with an "s"
11.79/1.87	# Child (10583) has found a proof.
11.79/1.87	
11.79/1.87	# Proof search is over...
11.79/1.87	# Freeing feature tree
11.79/1.90	EOF