0.06/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.31	% Computer   : n009.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1200
0.10/0.31	% WCLimit    : 120
0.10/0.31	% DateTime   : Tue Jul 13 11:37:27 EDT 2021
0.10/0.31	% CPUTime    : 
0.10/0.34	# No SInE strategy applied
0.10/0.34	# Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.10/0.34	# and selection function SelectComplexExceptUniqMaxHorn.
0.10/0.34	#
0.10/0.34	# Presaturation interreduction done
0.10/0.34	# Number of axioms: 18 Number of unprocessed: 18
0.10/0.34	# Tableaux proof search.
0.10/0.34	# APR header successfully linked.
0.10/0.34	# Hello from C++
0.10/0.34	# The folding up rule is enabled...
0.10/0.34	# Local unification is enabled...
0.10/0.34	# Any saturation attempts will use folding labels...
0.10/0.34	# 18 beginning clauses after preprocessing and clausification
0.10/0.34	# Creating start rules for all 1 conjectures.
0.10/0.34	# There are 1 start rule candidates:
0.10/0.34	# Found 18 unit axioms.
0.10/0.34	# 1 start rule tableaux created.
0.10/0.34	# 0 extension rule candidate clauses
0.10/0.34	# 18 unit axiom clauses
0.10/0.34	
0.10/0.34	# Requested 8, 32 cores available to the main process.
0.10/0.34	# There are not enough tableaux to fork, creating more from the initial 1
0.10/0.34	# Creating equality axioms
0.10/0.34	# Ran out of tableaux, making start rules for all clauses
0.10/0.34	# Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
0.10/0.34	# We now have 26 tableaux to operate on
54.28/7.25	# There were 2 total branch saturation attempts.
54.28/7.25	# There were 0 of these attempts blocked.
54.28/7.25	# There were 0 deferred branch saturation attempts.
54.28/7.25	# There were 0 free duplicated saturations.
54.28/7.25	# There were 1 total successful branch saturations.
54.28/7.25	# There were 0 successful branch saturations in interreduction.
54.28/7.25	# There were 0 successful branch saturations on the branch.
54.28/7.25	# There were 1 successful branch saturations after the branch.
54.28/7.25	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
54.28/7.25	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
54.28/7.25	# Begin clausification derivation
54.28/7.25	
54.28/7.25	# End clausification derivation
54.28/7.25	# Begin listing active clauses obtained from FOF to CNF conversion
54.28/7.25	cnf(i_0_22, plain, (multiply(identity,X1)=X1)).
54.28/7.25	cnf(i_0_29, plain, (least_upper_bound(X1,X1)=X1)).
54.28/7.25	cnf(i_0_26, plain, (greatest_lower_bound(X1,X1)=X1)).
54.28/7.25	cnf(i_0_23, plain, (multiply(inverse(X1),X1)=identity)).
54.28/7.25	cnf(i_0_34, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
54.28/7.25	cnf(i_0_27, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
54.28/7.25	cnf(i_0_25, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
54.28/7.25	cnf(i_0_21, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
54.28/7.25	cnf(i_0_32, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
54.28/7.25	cnf(i_0_38, plain, (least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3))=greatest_lower_bound(X1,least_upper_bound(X2,X3)))).
54.28/7.25	cnf(i_0_30, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
54.28/7.25	cnf(i_0_28, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
54.28/7.25	cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
54.28/7.25	cnf(i_0_37, plain, (greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3))=least_upper_bound(X1,greatest_lower_bound(X2,X3)))).
54.28/7.25	cnf(i_0_24, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
54.28/7.25	cnf(i_0_31, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
54.28/7.25	cnf(i_0_35, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
54.28/7.25	cnf(i_0_36, negated_conjecture, (multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a))!=a)).
54.28/7.25	cnf(i_0_42, plain, (X4=X4)).
54.28/7.25	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
54.28/7.25	# Begin printing tableau
54.28/7.25	# Found 8 steps
54.28/7.25	cnf(i_0_22, plain, (multiply(identity,X2)=X2), inference(start_rule)).
54.28/7.25	cnf(i_0_50, plain, (multiply(identity,X2)=X2), inference(extension_rule, [i_0_46])).
54.28/7.25	cnf(i_0_77, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_22])).
54.28/7.25	cnf(i_0_76, plain, (multiply(multiply(identity,identity),multiply(identity,X2))=multiply(identity,X2)), inference(extension_rule, [i_0_45])).
54.28/7.25	cnf(i_0_93, plain, (multiply(identity,X2)!=X2), inference(closure_rule, [i_0_22])).
54.28/7.25	cnf(i_0_91, plain, (multiply(multiply(identity,identity),multiply(identity,X2))=X2), inference(extension_rule, [i_0_46])).
54.28/7.25	cnf(i_0_262992, plain, (multiply(identity,X4)!=X4), inference(closure_rule, [i_0_22])).
54.28/7.25	cnf(i_0_262990, plain, (multiply(multiply(multiply(identity,identity),multiply(identity,X2)),multiply(identity,X4))=multiply(X2,X4)), inference(etableau_closure_rule, [i_0_262990, ...])).
54.28/7.25	# End printing tableau
54.28/7.25	# SZS output end
54.28/7.25	# Branches closed with saturation will be marked with an "s"
54.82/7.26	# There were 2 total branch saturation attempts.
54.82/7.26	# There were 0 of these attempts blocked.
54.82/7.26	# There were 0 deferred branch saturation attempts.
54.82/7.26	# There were 0 free duplicated saturations.
54.82/7.26	# There were 1 total successful branch saturations.
54.82/7.26	# There were 0 successful branch saturations in interreduction.
54.82/7.26	# There were 0 successful branch saturations on the branch.
54.82/7.26	# There were 1 successful branch saturations after the branch.
54.82/7.26	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
54.82/7.26	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
54.82/7.26	# Begin clausification derivation
54.82/7.26	
54.82/7.26	# End clausification derivation
54.82/7.26	# Begin listing active clauses obtained from FOF to CNF conversion
54.82/7.26	cnf(i_0_22, plain, (multiply(identity,X1)=X1)).
54.82/7.26	cnf(i_0_29, plain, (least_upper_bound(X1,X1)=X1)).
54.82/7.26	cnf(i_0_26, plain, (greatest_lower_bound(X1,X1)=X1)).
54.82/7.26	cnf(i_0_23, plain, (multiply(inverse(X1),X1)=identity)).
54.82/7.26	cnf(i_0_34, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
54.82/7.26	cnf(i_0_27, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
54.82/7.26	cnf(i_0_25, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
54.82/7.26	cnf(i_0_21, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
54.82/7.26	cnf(i_0_32, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
54.82/7.26	cnf(i_0_38, plain, (least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3))=greatest_lower_bound(X1,least_upper_bound(X2,X3)))).
54.82/7.26	cnf(i_0_30, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
54.82/7.26	cnf(i_0_28, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
54.82/7.26	cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
54.82/7.26	cnf(i_0_37, plain, (greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3))=least_upper_bound(X1,greatest_lower_bound(X2,X3)))).
54.82/7.26	cnf(i_0_24, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
54.82/7.26	cnf(i_0_31, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
54.82/7.26	cnf(i_0_35, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
54.82/7.26	cnf(i_0_36, negated_conjecture, (multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a))!=a)).
54.82/7.26	cnf(i_0_42, plain, (X4=X4)).
54.82/7.26	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
54.82/7.26	# Begin printing tableau
54.82/7.26	# Found 8 steps
54.82/7.26	cnf(i_0_22, plain, (multiply(identity,identity)=identity), inference(start_rule)).
54.82/7.26	cnf(i_0_50, plain, (multiply(identity,identity)=identity), inference(extension_rule, [i_0_46])).
54.82/7.26	cnf(i_0_78, plain, (multiply(identity,X2)!=X2), inference(closure_rule, [i_0_22])).
54.82/7.26	cnf(i_0_76, plain, (multiply(multiply(identity,identity),multiply(identity,X2))=multiply(identity,X2)), inference(extension_rule, [i_0_45])).
54.82/7.26	cnf(i_0_93, plain, (multiply(identity,X2)!=X2), inference(closure_rule, [i_0_22])).
54.82/7.26	cnf(i_0_91, plain, (multiply(multiply(identity,identity),multiply(identity,X2))=X2), inference(extension_rule, [i_0_46])).
54.82/7.26	cnf(i_0_260939, plain, (multiply(identity,X4)!=X4), inference(closure_rule, [i_0_22])).
54.82/7.26	cnf(i_0_260937, plain, (multiply(multiply(multiply(identity,identity),multiply(identity,X2)),multiply(identity,X4))=multiply(X2,X4)), inference(etableau_closure_rule, [i_0_260937, ...])).
54.82/7.26	# End printing tableau
54.82/7.26	# SZS output end
54.82/7.26	# Branches closed with saturation will be marked with an "s"
54.82/7.27	# Child (21640) has found a proof.
54.82/7.27	
54.82/7.27	# Proof search is over...
54.82/7.27	# Freeing feature tree
54.82/7.31	EOF