0.01/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.01/0.14	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.35	% Computer   : n006.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 12:13:40 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.38	# No SInE strategy applied
0.13/0.38	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.13/0.38	# and selection function SelectNewComplexAHP.
0.13/0.38	#
0.13/0.38	# Presaturation interreduction done
0.13/0.38	# Number of axioms: 16 Number of unprocessed: 16
0.13/0.38	# Tableaux proof search.
0.13/0.38	# APR header successfully linked.
0.13/0.38	# Hello from C++
0.13/0.38	# The folding up rule is enabled...
0.13/0.38	# Local unification is enabled...
0.13/0.38	# Any saturation attempts will use folding labels...
0.13/0.38	# 16 beginning clauses after preprocessing and clausification
0.13/0.38	# Creating start rules for all 1 conjectures.
0.13/0.38	# There are 1 start rule candidates:
0.13/0.38	# Found 16 unit axioms.
0.13/0.38	# 1 start rule tableaux created.
0.13/0.38	# 0 extension rule candidate clauses
0.13/0.38	# 16 unit axiom clauses
0.13/0.38	
0.13/0.38	# Requested 8, 32 cores available to the main process.
0.13/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.38	# Creating equality axioms
0.13/0.38	# Ran out of tableaux, making start rules for all clauses
0.13/0.38	# Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
0.13/0.38	# We now have 24 tableaux to operate on
19.80/2.87	# There were 1 total branch saturation attempts.
19.80/2.87	# There were 0 of these attempts blocked.
19.80/2.87	# There were 0 deferred branch saturation attempts.
19.80/2.87	# There were 0 free duplicated saturations.
19.80/2.87	# There were 1 total successful branch saturations.
19.80/2.87	# There were 0 successful branch saturations in interreduction.
19.80/2.87	# There were 0 successful branch saturations on the branch.
19.80/2.87	# There were 1 successful branch saturations after the branch.
19.80/2.87	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
19.80/2.87	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
19.80/2.87	# Begin clausification derivation
19.80/2.87	
19.80/2.87	# End clausification derivation
19.80/2.87	# Begin listing active clauses obtained from FOF to CNF conversion
19.80/2.87	cnf(i_0_18, plain, (multiply(identity,X1)=X1)).
19.80/2.87	cnf(i_0_25, plain, (least_upper_bound(X1,X1)=X1)).
19.80/2.87	cnf(i_0_22, plain, (greatest_lower_bound(X1,X1)=X1)).
19.80/2.87	cnf(i_0_19, plain, (multiply(inverse(X1),X1)=identity)).
19.80/2.87	cnf(i_0_30, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
19.80/2.87	cnf(i_0_23, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
19.80/2.87	cnf(i_0_21, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
19.80/2.87	cnf(i_0_17, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
19.80/2.87	cnf(i_0_28, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
19.80/2.87	cnf(i_0_26, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
19.80/2.87	cnf(i_0_24, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
19.80/2.87	cnf(i_0_29, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
19.80/2.87	cnf(i_0_20, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
19.80/2.87	cnf(i_0_27, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
19.80/2.87	cnf(i_0_31, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
19.80/2.87	cnf(i_0_32, negated_conjecture, (multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a))!=multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))))).
19.80/2.87	cnf(i_0_34, plain, (X4=X4)).
19.80/2.87	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
19.80/2.87	# Begin printing tableau
19.80/2.87	# Found 5 steps
19.80/2.87	cnf(i_0_18, plain, (multiply(identity,X3)=X3), inference(start_rule)).
19.80/2.87	cnf(i_0_42, plain, (multiply(identity,X3)=X3), inference(extension_rule, [i_0_39])).
19.80/2.87	cnf(i_0_69, plain, (inverse(multiply(identity,X3))=inverse(X3)), inference(extension_rule, [i_0_37])).
19.80/2.87	cnf(i_0_83, plain, (inverse(X3)!=multiply(identity,inverse(X3))), inference(closure_rule, [i_0_18])).
19.80/2.87	cnf(i_0_81, plain, (inverse(multiply(identity,X3))=multiply(identity,inverse(X3))), inference(etableau_closure_rule, [i_0_81, ...])).
19.80/2.87	# End printing tableau
19.80/2.87	# SZS output end
19.80/2.87	# Branches closed with saturation will be marked with an "s"
19.80/2.88	# There were 1 total branch saturation attempts.
19.80/2.88	# There were 0 of these attempts blocked.
19.80/2.88	# There were 0 deferred branch saturation attempts.
19.80/2.88	# There were 0 free duplicated saturations.
19.80/2.88	# There were 1 total successful branch saturations.
19.80/2.88	# There were 0 successful branch saturations in interreduction.
19.80/2.88	# There were 0 successful branch saturations on the branch.
19.80/2.88	# There were 1 successful branch saturations after the branch.
19.80/2.88	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
19.80/2.88	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
19.80/2.88	# Begin clausification derivation
19.80/2.88	
19.80/2.88	# End clausification derivation
19.80/2.88	# Begin listing active clauses obtained from FOF to CNF conversion
19.80/2.88	cnf(i_0_18, plain, (multiply(identity,X1)=X1)).
19.80/2.88	cnf(i_0_25, plain, (least_upper_bound(X1,X1)=X1)).
19.80/2.88	cnf(i_0_22, plain, (greatest_lower_bound(X1,X1)=X1)).
19.80/2.88	cnf(i_0_19, plain, (multiply(inverse(X1),X1)=identity)).
19.80/2.88	cnf(i_0_30, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
19.80/2.88	cnf(i_0_23, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
19.80/2.88	cnf(i_0_21, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
19.80/2.88	cnf(i_0_17, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
19.80/2.88	cnf(i_0_28, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
19.80/2.88	cnf(i_0_26, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
19.80/2.88	cnf(i_0_24, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
19.80/2.88	cnf(i_0_29, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
19.80/2.88	cnf(i_0_20, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
19.80/2.88	cnf(i_0_27, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
19.80/2.88	cnf(i_0_31, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
19.80/2.88	cnf(i_0_32, negated_conjecture, (multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a))!=multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))))).
19.80/2.88	cnf(i_0_34, plain, (X4=X4)).
19.80/2.88	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
19.80/2.88	# Begin printing tableau
19.80/2.88	# Found 6 steps
19.80/2.88	cnf(i_0_18, plain, (multiply(identity,X3)=X3), inference(start_rule)).
19.80/2.88	cnf(i_0_42, plain, (multiply(identity,X3)=X3), inference(extension_rule, [i_0_40])).
19.80/2.88	cnf(i_0_73, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_18])).
19.80/2.88	cnf(i_0_71, plain, (least_upper_bound(multiply(identity,X3),multiply(identity,X5))=least_upper_bound(X3,X5)), inference(extension_rule, [i_0_37])).
19.80/2.88	cnf(i_0_83, plain, (least_upper_bound(X3,X5)!=multiply(identity,least_upper_bound(X3,X5))), inference(closure_rule, [i_0_18])).
19.80/2.88	cnf(i_0_81, plain, (least_upper_bound(multiply(identity,X3),multiply(identity,X5))=multiply(identity,least_upper_bound(X3,X5))), inference(etableau_closure_rule, [i_0_81, ...])).
19.80/2.88	# End printing tableau
19.80/2.88	# SZS output end
19.80/2.88	# Branches closed with saturation will be marked with an "s"
19.80/2.89	# Child (26123) has found a proof.
19.80/2.89	
19.80/2.89	# Proof search is over...
19.80/2.89	# Freeing feature tree
19.80/2.92	EOF