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