0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/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   : n026.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 12:23:59 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.12/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 16 Number of unprocessed: 16
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# 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	# 16 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 16 unit axioms.
0.12/0.36	# 1 start rule tableaux created.
0.12/0.36	# 0 extension rule candidate clauses
0.12/0.36	# 16 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
2.92/0.76	# There were 1 total branch saturation attempts.
2.92/0.76	# There were 0 of these attempts blocked.
2.92/0.76	# There were 0 deferred branch saturation attempts.
2.92/0.76	# There were 0 free duplicated saturations.
2.92/0.76	# There were 1 total successful branch saturations.
2.92/0.76	# There were 0 successful branch saturations in interreduction.
2.92/0.76	# There were 0 successful branch saturations on the branch.
2.92/0.76	# There were 1 successful branch saturations after the branch.
2.92/0.76	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.92/0.76	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.92/0.76	# Begin clausification derivation
2.92/0.76	
2.92/0.76	# End clausification derivation
2.92/0.76	# Begin listing active clauses obtained from FOF to CNF conversion
2.92/0.76	cnf(i_0_18, plain, (multiply(identity,X1)=X1)).
2.92/0.76	cnf(i_0_25, plain, (least_upper_bound(X1,X1)=X1)).
2.92/0.76	cnf(i_0_22, plain, (greatest_lower_bound(X1,X1)=X1)).
2.92/0.76	cnf(i_0_19, plain, (multiply(inverse(X1),X1)=identity)).
2.92/0.76	cnf(i_0_30, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
2.92/0.76	cnf(i_0_23, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
2.92/0.76	cnf(i_0_21, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
2.92/0.76	cnf(i_0_17, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
2.92/0.76	cnf(i_0_28, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
2.92/0.76	cnf(i_0_26, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
2.92/0.76	cnf(i_0_24, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
2.92/0.76	cnf(i_0_29, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
2.92/0.76	cnf(i_0_20, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
2.92/0.76	cnf(i_0_27, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
2.92/0.76	cnf(i_0_31, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
2.92/0.76	cnf(i_0_32, negated_conjecture, (multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a))!=a)).
2.92/0.76	cnf(i_0_34, plain, (X4=X4)).
2.92/0.76	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
2.92/0.76	# Begin printing tableau
2.92/0.76	# Found 5 steps
2.92/0.76	cnf(i_0_18, plain, (multiply(identity,X3)=X3), inference(start_rule)).
2.92/0.76	cnf(i_0_42, plain, (multiply(identity,X3)=X3), inference(extension_rule, [i_0_39])).
2.92/0.76	cnf(i_0_69, plain, (inverse(multiply(identity,X3))=inverse(X3)), inference(extension_rule, [i_0_37])).
2.92/0.76	cnf(i_0_83, plain, (inverse(X3)!=multiply(identity,inverse(X3))), inference(closure_rule, [i_0_18])).
2.92/0.76	cnf(i_0_81, plain, (inverse(multiply(identity,X3))=multiply(identity,inverse(X3))), inference(etableau_closure_rule, [i_0_81, ...])).
2.92/0.76	# End printing tableau
2.92/0.76	# SZS output end
2.92/0.76	# Branches closed with saturation will be marked with an "s"
2.92/0.76	# Child (15333) has found a proof.
2.92/0.76	
2.92/0.76	# Proof search is over...
2.92/0.76	# Freeing feature tree
2.92/0.77	EOF