0.02/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.30	% Computer   : n007.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1200
0.09/0.30	% WCLimit    : 120
0.09/0.30	% DateTime   : Tue Jul 13 12:07:04 EDT 2021
0.09/0.31	% CPUTime    : 
0.15/0.33	# No SInE strategy applied
0.15/0.33	# Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
0.15/0.33	# and selection function SelectMaxLComplexAvoidPosPred.
0.15/0.33	#
0.15/0.33	# Presaturation interreduction done
0.15/0.33	# Number of axioms: 20 Number of unprocessed: 20
0.15/0.33	# Tableaux proof search.
0.15/0.33	# APR header successfully linked.
0.15/0.33	# Hello from C++
0.15/0.33	# The folding up rule is enabled...
0.15/0.33	# Local unification is enabled...
0.15/0.33	# Any saturation attempts will use folding labels...
0.15/0.33	# 20 beginning clauses after preprocessing and clausification
0.15/0.33	# Creating start rules for all 1 conjectures.
0.15/0.33	# There are 1 start rule candidates:
0.15/0.33	# Found 20 unit axioms.
0.15/0.33	# 1 start rule tableaux created.
0.15/0.33	# 0 extension rule candidate clauses
0.15/0.33	# 20 unit axiom clauses
0.15/0.33	
0.15/0.33	# Requested 8, 32 cores available to the main process.
0.15/0.33	# There are not enough tableaux to fork, creating more from the initial 1
0.15/0.33	# Creating equality axioms
0.15/0.33	# Ran out of tableaux, making start rules for all clauses
0.15/0.33	# Returning from population with 31 new_tableaux and 0 remaining starting tableaux.
0.15/0.33	# We now have 31 tableaux to operate on
0.15/0.44	# There were 1 total branch saturation attempts.
0.15/0.44	# There were 0 of these attempts blocked.
0.15/0.44	# There were 0 deferred branch saturation attempts.
0.15/0.44	# There were 0 free duplicated saturations.
0.15/0.44	# There were 1 total successful branch saturations.
0.15/0.44	# There were 0 successful branch saturations in interreduction.
0.15/0.44	# There were 0 successful branch saturations on the branch.
0.15/0.44	# There were 1 successful branch saturations after the branch.
0.15/0.44	# There were 1 total branch saturation attempts.
0.15/0.44	# There were 0 of these attempts blocked.
0.15/0.44	# There were 0 deferred branch saturation attempts.
0.15/0.44	# There were 0 free duplicated saturations.
0.15/0.44	# There were 1 total successful branch saturations.
0.15/0.44	# There were 0 successful branch saturations in interreduction.
0.15/0.44	# There were 0 successful branch saturations on the branch.
0.15/0.44	# There were 1 successful branch saturations after the branch.
0.15/0.44	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.44	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.44	# Begin clausification derivation
0.15/0.44	
0.15/0.44	# End clausification derivation
0.15/0.44	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.44	cnf(i_0_35, plain, (mult(X1,unit)=X1)).
0.15/0.44	cnf(i_0_43, plain, (mult(unit,X1)=X1)).
0.15/0.44	cnf(i_0_38, plain, (mult(X1,i(X1))=unit)).
0.15/0.44	cnf(i_0_24, plain, (mult(i(X1),X1)=unit)).
0.15/0.44	cnf(i_0_37, plain, (mult(rd(X1,X2),X2)=X1)).
0.15/0.44	cnf(i_0_46, plain, (rd(mult(X1,X2),X2)=X1)).
0.15/0.44	cnf(i_0_30, plain, (mult(i(X1),mult(X1,X2))=X2)).
0.15/0.44	cnf(i_0_41, plain, (asoc(X1,X2,asoc(X3,X4,X5))=unit)).
0.15/0.44	cnf(i_0_45, plain, (asoc(asoc(X1,X2,X3),X4,X5)=unit)).
0.15/0.44	cnf(i_0_29, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
0.15/0.44	cnf(i_0_25, plain, (mult(mult(X1,X2),op_k(X2,X1))=mult(X2,X1))).
0.15/0.44	cnf(i_0_31, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
0.15/0.44	cnf(i_0_32, plain, (mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3))=mult(mult(X1,X2),X3))).
0.15/0.44	cnf(i_0_26, plain, (rd(mult(mult(mult(i(X1),mult(X2,X1)),X3),X4),mult(X3,X4))=mult(i(X1),mult(rd(mult(mult(X2,X3),X4),mult(X3,X4)),X1)))).
0.15/0.44	cnf(i_0_33, plain, (rd(mult(mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X3))),X4),X5),mult(X4,X5))=mult(i(mult(X1,X2)),mult(X1,mult(X2,rd(mult(mult(X3,X4),X5),mult(X4,X5))))))).
0.15/0.44	cnf(i_0_39, plain, (mult(i(X1),mult(mult(i(X2),mult(X3,X2)),X1))=mult(i(X2),mult(mult(i(X1),mult(X3,X1)),X2)))).
0.15/0.44	cnf(i_0_40, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(X3),mult(X4,X3)))))=mult(i(X3),mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X4))),X3)))).
0.15/0.44	cnf(i_0_28, plain, (rd(mult(mult(rd(mult(mult(X1,X2),X3),mult(X2,X3)),X4),X5),mult(X4,X5))=rd(mult(mult(rd(mult(mult(X1,X4),X5),mult(X4,X5)),X2),X3),mult(X2,X3)))).
0.15/0.44	cnf(i_0_34, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(mult(X3,X4)),mult(X3,mult(X4,X5))))))=mult(i(mult(X3,X4)),mult(X3,mult(X4,mult(i(mult(X1,X2)),mult(X1,mult(X2,X5)))))))).
0.15/0.44	cnf(i_0_44, negated_conjecture, (op_k(asoc(a,b,c),d)!=unit)).
0.15/0.44	cnf(i_0_48, plain, (X6=X6)).
0.15/0.44	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.44	# Begin printing tableau
0.15/0.44	# Found 7 steps
0.15/0.44	cnf(i_0_35, plain, (mult(X7,unit)=X7), inference(start_rule)).
0.15/0.44	cnf(i_0_57, plain, (mult(X7,unit)=X7), inference(extension_rule, [i_0_55])).
0.15/0.44	cnf(i_0_94, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_95, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_93, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=asoc(X3,X5,X7)), inference(extension_rule, [i_0_51])).
0.15/0.44	cnf(i_0_106, plain, (asoc(X3,X5,X7)!=mult(asoc(X3,X5,X7),unit)), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_104, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=mult(asoc(X3,X5,X7),unit)), inference(etableau_closure_rule, [i_0_104, ...])).
0.15/0.44	# End printing tableau
0.15/0.44	# SZS output end
0.15/0.44	# Branches closed with saturation will be marked with an "s"
0.15/0.44	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.44	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.44	# Begin clausification derivation
0.15/0.44	
0.15/0.44	# End clausification derivation
0.15/0.44	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.44	cnf(i_0_35, plain, (mult(X1,unit)=X1)).
0.15/0.44	cnf(i_0_43, plain, (mult(unit,X1)=X1)).
0.15/0.44	cnf(i_0_38, plain, (mult(X1,i(X1))=unit)).
0.15/0.44	cnf(i_0_24, plain, (mult(i(X1),X1)=unit)).
0.15/0.44	cnf(i_0_37, plain, (mult(rd(X1,X2),X2)=X1)).
0.15/0.44	cnf(i_0_46, plain, (rd(mult(X1,X2),X2)=X1)).
0.15/0.44	cnf(i_0_30, plain, (mult(i(X1),mult(X1,X2))=X2)).
0.15/0.44	cnf(i_0_41, plain, (asoc(X1,X2,asoc(X3,X4,X5))=unit)).
0.15/0.44	cnf(i_0_45, plain, (asoc(asoc(X1,X2,X3),X4,X5)=unit)).
0.15/0.44	cnf(i_0_29, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
0.15/0.44	cnf(i_0_25, plain, (mult(mult(X1,X2),op_k(X2,X1))=mult(X2,X1))).
0.15/0.44	cnf(i_0_31, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
0.15/0.44	cnf(i_0_32, plain, (mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3))=mult(mult(X1,X2),X3))).
0.15/0.44	cnf(i_0_26, plain, (rd(mult(mult(mult(i(X1),mult(X2,X1)),X3),X4),mult(X3,X4))=mult(i(X1),mult(rd(mult(mult(X2,X3),X4),mult(X3,X4)),X1)))).
0.15/0.44	cnf(i_0_33, plain, (rd(mult(mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X3))),X4),X5),mult(X4,X5))=mult(i(mult(X1,X2)),mult(X1,mult(X2,rd(mult(mult(X3,X4),X5),mult(X4,X5))))))).
0.15/0.44	cnf(i_0_39, plain, (mult(i(X1),mult(mult(i(X2),mult(X3,X2)),X1))=mult(i(X2),mult(mult(i(X1),mult(X3,X1)),X2)))).
0.15/0.44	cnf(i_0_40, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(X3),mult(X4,X3)))))=mult(i(X3),mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X4))),X3)))).
0.15/0.44	cnf(i_0_28, plain, (rd(mult(mult(rd(mult(mult(X1,X2),X3),mult(X2,X3)),X4),X5),mult(X4,X5))=rd(mult(mult(rd(mult(mult(X1,X4),X5),mult(X4,X5)),X2),X3),mult(X2,X3)))).
0.15/0.44	cnf(i_0_34, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(mult(X3,X4)),mult(X3,mult(X4,X5))))))=mult(i(mult(X3,X4)),mult(X3,mult(X4,mult(i(mult(X1,X2)),mult(X1,mult(X2,X5)))))))).
0.15/0.44	cnf(i_0_44, negated_conjecture, (op_k(asoc(a,b,c),d)!=unit)).
0.15/0.44	cnf(i_0_48, plain, (X6=X6)).
0.15/0.44	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.44	# Begin printing tableau
0.15/0.44	# Found 7 steps
0.15/0.44	cnf(i_0_35, plain, (mult(X5,unit)=X5), inference(start_rule)).
0.15/0.44	cnf(i_0_57, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_55])).
0.15/0.44	cnf(i_0_94, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_96, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_93, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=asoc(X3,X5,X7)), inference(extension_rule, [i_0_51])).
0.15/0.44	cnf(i_0_106, plain, (asoc(X3,X5,X7)!=mult(asoc(X3,X5,X7),unit)), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_104, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=mult(asoc(X3,X5,X7),unit)), inference(etableau_closure_rule, [i_0_104, ...])).
0.15/0.44	# End printing tableau
0.15/0.44	# SZS output end
0.15/0.44	# Branches closed with saturation will be marked with an "s"
0.15/0.44	# There were 1 total branch saturation attempts.
0.15/0.44	# There were 0 of these attempts blocked.
0.15/0.44	# There were 0 deferred branch saturation attempts.
0.15/0.44	# There were 0 free duplicated saturations.
0.15/0.44	# There were 1 total successful branch saturations.
0.15/0.44	# There were 0 successful branch saturations in interreduction.
0.15/0.44	# There were 0 successful branch saturations on the branch.
0.15/0.44	# There were 1 successful branch saturations after the branch.
0.15/0.44	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.44	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.44	# Begin clausification derivation
0.15/0.44	
0.15/0.44	# End clausification derivation
0.15/0.44	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.44	cnf(i_0_35, plain, (mult(X1,unit)=X1)).
0.15/0.44	cnf(i_0_43, plain, (mult(unit,X1)=X1)).
0.15/0.44	cnf(i_0_38, plain, (mult(X1,i(X1))=unit)).
0.15/0.44	cnf(i_0_24, plain, (mult(i(X1),X1)=unit)).
0.15/0.44	cnf(i_0_37, plain, (mult(rd(X1,X2),X2)=X1)).
0.15/0.44	cnf(i_0_46, plain, (rd(mult(X1,X2),X2)=X1)).
0.15/0.44	cnf(i_0_30, plain, (mult(i(X1),mult(X1,X2))=X2)).
0.15/0.44	cnf(i_0_41, plain, (asoc(X1,X2,asoc(X3,X4,X5))=unit)).
0.15/0.44	cnf(i_0_45, plain, (asoc(asoc(X1,X2,X3),X4,X5)=unit)).
0.15/0.44	cnf(i_0_29, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
0.15/0.44	cnf(i_0_25, plain, (mult(mult(X1,X2),op_k(X2,X1))=mult(X2,X1))).
0.15/0.44	cnf(i_0_31, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
0.15/0.44	cnf(i_0_32, plain, (mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3))=mult(mult(X1,X2),X3))).
0.15/0.44	cnf(i_0_26, plain, (rd(mult(mult(mult(i(X1),mult(X2,X1)),X3),X4),mult(X3,X4))=mult(i(X1),mult(rd(mult(mult(X2,X3),X4),mult(X3,X4)),X1)))).
0.15/0.44	cnf(i_0_33, plain, (rd(mult(mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X3))),X4),X5),mult(X4,X5))=mult(i(mult(X1,X2)),mult(X1,mult(X2,rd(mult(mult(X3,X4),X5),mult(X4,X5))))))).
0.15/0.44	cnf(i_0_39, plain, (mult(i(X1),mult(mult(i(X2),mult(X3,X2)),X1))=mult(i(X2),mult(mult(i(X1),mult(X3,X1)),X2)))).
0.15/0.44	cnf(i_0_40, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(X3),mult(X4,X3)))))=mult(i(X3),mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X4))),X3)))).
0.15/0.44	cnf(i_0_28, plain, (rd(mult(mult(rd(mult(mult(X1,X2),X3),mult(X2,X3)),X4),X5),mult(X4,X5))=rd(mult(mult(rd(mult(mult(X1,X4),X5),mult(X4,X5)),X2),X3),mult(X2,X3)))).
0.15/0.44	cnf(i_0_34, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(mult(X3,X4)),mult(X3,mult(X4,X5))))))=mult(i(mult(X3,X4)),mult(X3,mult(X4,mult(i(mult(X1,X2)),mult(X1,mult(X2,X5)))))))).
0.15/0.44	cnf(i_0_44, negated_conjecture, (op_k(asoc(a,b,c),d)!=unit)).
0.15/0.44	cnf(i_0_48, plain, (X6=X6)).
0.15/0.44	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.44	# Begin printing tableau
0.15/0.44	# Found 6 steps
0.15/0.44	cnf(i_0_35, plain, (mult(X3,unit)=X3), inference(start_rule)).
0.15/0.44	cnf(i_0_57, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_54])).
0.15/0.44	cnf(i_0_92, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_90, plain, (op_k(mult(X3,unit),mult(X5,unit))=op_k(X3,X5)), inference(extension_rule, [i_0_51])).
0.15/0.44	cnf(i_0_106, plain, (op_k(X3,X5)!=mult(op_k(X3,X5),unit)), inference(closure_rule, [i_0_35])).
0.15/0.44	cnf(i_0_104, plain, (op_k(mult(X3,unit),mult(X5,unit))=mult(op_k(X3,X5),unit)), inference(etableau_closure_rule, [i_0_104, ...])).
0.15/0.44	# End printing tableau
0.15/0.44	# SZS output end
0.15/0.44	# Branches closed with saturation will be marked with an "s"
0.15/0.44	# There were 1 total branch saturation attempts.
0.15/0.44	# There were 0 of these attempts blocked.
0.15/0.44	# There were 0 deferred branch saturation attempts.
0.15/0.44	# There were 0 free duplicated saturations.
0.15/0.44	# There were 1 total successful branch saturations.
0.15/0.44	# There were 0 successful branch saturations in interreduction.
0.15/0.44	# There were 0 successful branch saturations on the branch.
0.15/0.44	# There were 1 successful branch saturations after the branch.
0.15/0.44	# Child (9072) has found a proof.
0.15/0.44	
0.15/0.44	# Proof search is over...
0.15/0.44	# Freeing feature tree
0.15/0.44	EOF