0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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   : n015.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.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 14:03:04 EDT 2021
0.12/0.34	% CPUTime    : 
0.18/0.38	# No SInE strategy applied
0.18/0.38	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.18/0.38	# and selection function PSelectComplexExceptUniqMaxHorn.
0.18/0.38	#
0.18/0.38	# Number of axioms: 14 Number of unprocessed: 14
0.18/0.38	# Tableaux proof search.
0.18/0.38	# APR header successfully linked.
0.18/0.38	# Hello from C++
0.18/0.38	# The folding up rule is enabled...
0.18/0.38	# Local unification is enabled...
0.18/0.38	# Any saturation attempts will use folding labels...
0.18/0.38	# 14 beginning clauses after preprocessing and clausification
0.18/0.38	# Creating start rules for all 1 conjectures.
0.18/0.38	# There are 1 start rule candidates:
0.18/0.38	# Found 14 unit axioms.
0.18/0.38	# 1 start rule tableaux created.
0.18/0.38	# 0 extension rule candidate clauses
0.18/0.38	# 14 unit axiom clauses
0.18/0.38	
0.18/0.38	# Requested 8, 32 cores available to the main process.
0.18/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.18/0.38	# Creating equality axioms
0.18/0.38	# Ran out of tableaux, making start rules for all clauses
0.18/0.38	# Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
0.18/0.38	# We now have 20 tableaux to operate on
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# Begin clausification derivation
0.18/0.39	
0.18/0.39	# End clausification derivation
0.18/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X1))=X1)).
0.18/0.39	cnf(i_0_24, plain, (multiply(X1,additive_identity)=additive_identity)).
0.18/0.39	cnf(i_0_27, plain, (multiply(additive_identity,X1)=additive_identity)).
0.18/0.39	cnf(i_0_17, plain, (add(X1,additive_identity)=X1)).
0.18/0.39	cnf(i_0_31, plain, (add(additive_identity,X1)=X1)).
0.18/0.39	cnf(i_0_30, plain, (add(X1,additive_inverse(X1))=additive_identity)).
0.18/0.39	cnf(i_0_20, plain, (add(additive_inverse(X1),X1)=additive_identity)).
0.18/0.39	cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))).
0.18/0.39	cnf(i_0_19, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_26, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))).
0.18/0.39	cnf(i_0_18, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))).
0.18/0.39	cnf(i_0_28, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))).
0.18/0.39	cnf(i_0_29, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_32, negated_conjecture, (add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))!=add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))))).
0.18/0.39	cnf(i_0_34, plain, (X4=X4)).
0.18/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.39	# Begin printing tableau
0.18/0.39	# Found 6 steps
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X5))=X5), inference(start_rule)).
0.18/0.39	cnf(i_0_41, plain, (additive_inverse(additive_inverse(X5))=X5), inference(extension_rule, [i_0_39])).
0.18/0.39	cnf(i_0_67, plain, (additive_inverse(additive_inverse(X3))!=X3), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_66, plain, (multiply(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=multiply(X3,X5)), inference(extension_rule, [i_0_37])).
0.18/0.39	cnf(i_0_77, plain, (multiply(X3,X5)!=additive_inverse(additive_inverse(multiply(X3,X5)))), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_75, plain, (multiply(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=additive_inverse(additive_inverse(multiply(X3,X5)))), inference(etableau_closure_rule, [i_0_75, ...])).
0.18/0.39	# End printing tableau
0.18/0.39	# SZS output end
0.18/0.39	# Branches closed with saturation will be marked with an "s"
0.18/0.39	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# Begin clausification derivation
0.18/0.39	
0.18/0.39	# End clausification derivation
0.18/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X1))=X1)).
0.18/0.39	cnf(i_0_24, plain, (multiply(X1,additive_identity)=additive_identity)).
0.18/0.39	cnf(i_0_27, plain, (multiply(additive_identity,X1)=additive_identity)).
0.18/0.39	cnf(i_0_17, plain, (add(X1,additive_identity)=X1)).
0.18/0.39	cnf(i_0_31, plain, (add(additive_identity,X1)=X1)).
0.18/0.39	cnf(i_0_30, plain, (add(X1,additive_inverse(X1))=additive_identity)).
0.18/0.39	cnf(i_0_20, plain, (add(additive_inverse(X1),X1)=additive_identity)).
0.18/0.39	cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))).
0.18/0.39	cnf(i_0_19, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_26, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))).
0.18/0.39	cnf(i_0_18, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))).
0.18/0.39	cnf(i_0_28, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))).
0.18/0.39	cnf(i_0_29, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_32, negated_conjecture, (add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))!=add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))))).
0.18/0.39	cnf(i_0_34, plain, (X4=X4)).
0.18/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.39	# Begin printing tableau
0.18/0.39	# Found 6 steps
0.18/0.39	cnf(i_0_27, plain, (multiply(additive_identity,additive_identity)=additive_identity), inference(start_rule)).
0.18/0.39	cnf(i_0_43, plain, (multiply(additive_identity,additive_identity)=additive_identity), inference(extension_rule, [i_0_37])).
0.18/0.39	cnf(i_0_77, plain, (additive_inverse(additive_inverse(additive_identity))!=additive_identity), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_75, plain, (multiply(additive_identity,additive_identity)=additive_inverse(additive_inverse(additive_identity))), inference(extension_rule, [i_0_38])).
0.18/0.39	cnf(i_0_84, plain, (additive_inverse(additive_inverse(X4))!=X4), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_82, 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_82, ...])).
0.18/0.39	# End printing tableau
0.18/0.39	# SZS output end
0.18/0.39	# Branches closed with saturation will be marked with an "s"
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# Begin clausification derivation
0.18/0.39	
0.18/0.39	# End clausification derivation
0.18/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X1))=X1)).
0.18/0.39	cnf(i_0_24, plain, (multiply(X1,additive_identity)=additive_identity)).
0.18/0.39	cnf(i_0_27, plain, (multiply(additive_identity,X1)=additive_identity)).
0.18/0.39	cnf(i_0_17, plain, (add(X1,additive_identity)=X1)).
0.18/0.39	cnf(i_0_31, plain, (add(additive_identity,X1)=X1)).
0.18/0.39	cnf(i_0_30, plain, (add(X1,additive_inverse(X1))=additive_identity)).
0.18/0.39	cnf(i_0_20, plain, (add(additive_inverse(X1),X1)=additive_identity)).
0.18/0.39	cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))).
0.18/0.39	cnf(i_0_19, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_26, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))).
0.18/0.39	cnf(i_0_18, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))).
0.18/0.39	cnf(i_0_28, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))).
0.18/0.39	cnf(i_0_29, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_32, negated_conjecture, (add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))!=add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))))).
0.18/0.39	cnf(i_0_34, plain, (X4=X4)).
0.18/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.39	# Begin printing tableau
0.18/0.39	# Found 6 steps
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X3))=X3), inference(start_rule)).
0.18/0.39	cnf(i_0_41, plain, (additive_inverse(additive_inverse(X3))=X3), inference(extension_rule, [i_0_39])).
0.18/0.39	cnf(i_0_68, plain, (additive_inverse(additive_inverse(X5))!=X5), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_66, plain, (multiply(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=multiply(X3,X5)), inference(extension_rule, [i_0_37])).
0.18/0.39	cnf(i_0_77, plain, (multiply(X3,X5)!=additive_inverse(additive_inverse(multiply(X3,X5)))), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_75, plain, (multiply(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=additive_inverse(additive_inverse(multiply(X3,X5)))), inference(etableau_closure_rule, [i_0_75, ...])).
0.18/0.39	# End printing tableau
0.18/0.39	# SZS output end
0.18/0.39	# Branches closed with saturation will be marked with an "s"
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# Begin clausification derivation
0.18/0.39	
0.18/0.39	# End clausification derivation
0.18/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X1))=X1)).
0.18/0.39	cnf(i_0_24, plain, (multiply(X1,additive_identity)=additive_identity)).
0.18/0.39	cnf(i_0_27, plain, (multiply(additive_identity,X1)=additive_identity)).
0.18/0.39	cnf(i_0_17, plain, (add(X1,additive_identity)=X1)).
0.18/0.39	cnf(i_0_31, plain, (add(additive_identity,X1)=X1)).
0.18/0.39	cnf(i_0_30, plain, (add(X1,additive_inverse(X1))=additive_identity)).
0.18/0.39	cnf(i_0_20, plain, (add(additive_inverse(X1),X1)=additive_identity)).
0.18/0.39	cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))).
0.18/0.39	cnf(i_0_19, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_26, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))).
0.18/0.39	cnf(i_0_18, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))).
0.18/0.39	cnf(i_0_28, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))).
0.18/0.39	cnf(i_0_29, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_32, negated_conjecture, (add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))!=add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))))).
0.18/0.39	cnf(i_0_34, plain, (X4=X4)).
0.18/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.39	# Begin printing tableau
0.18/0.39	# Found 6 steps
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X5))=X5), inference(start_rule)).
0.18/0.39	cnf(i_0_41, plain, (additive_inverse(additive_inverse(X5))=X5), inference(extension_rule, [i_0_38])).
0.18/0.39	cnf(i_0_64, plain, (additive_inverse(additive_inverse(X3))!=X3), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_63, plain, (add(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=add(X3,X5)), inference(extension_rule, [i_0_37])).
0.18/0.39	cnf(i_0_77, plain, (add(X3,X5)!=additive_inverse(additive_inverse(add(X3,X5)))), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_75, plain, (add(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=additive_inverse(additive_inverse(add(X3,X5)))), inference(etableau_closure_rule, [i_0_75, ...])).
0.18/0.39	# End printing tableau
0.18/0.39	# SZS output end
0.18/0.39	# Branches closed with saturation will be marked with an "s"
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.39	# Begin clausification derivation
0.18/0.39	
0.18/0.39	# End clausification derivation
0.18/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X1))=X1)).
0.18/0.39	cnf(i_0_24, plain, (multiply(X1,additive_identity)=additive_identity)).
0.18/0.39	cnf(i_0_27, plain, (multiply(additive_identity,X1)=additive_identity)).
0.18/0.39	cnf(i_0_17, plain, (add(X1,additive_identity)=X1)).
0.18/0.39	cnf(i_0_31, plain, (add(additive_identity,X1)=X1)).
0.18/0.39	cnf(i_0_30, plain, (add(X1,additive_inverse(X1))=additive_identity)).
0.18/0.39	cnf(i_0_20, plain, (add(additive_inverse(X1),X1)=additive_identity)).
0.18/0.39	cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))).
0.18/0.39	cnf(i_0_19, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_26, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))).
0.18/0.39	cnf(i_0_18, plain, (multiply(multiply(X1,X1),X2)=multiply(X1,multiply(X1,X2)))).
0.18/0.39	cnf(i_0_28, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))).
0.18/0.39	cnf(i_0_29, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
0.18/0.39	cnf(i_0_32, negated_conjecture, (add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))!=add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))))).
0.18/0.39	cnf(i_0_34, plain, (X4=X4)).
0.18/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.39	# Begin printing tableau
0.18/0.39	# Found 6 steps
0.18/0.39	cnf(i_0_21, plain, (additive_inverse(additive_inverse(X3))=X3), inference(start_rule)).
0.18/0.39	cnf(i_0_41, plain, (additive_inverse(additive_inverse(X3))=X3), inference(extension_rule, [i_0_38])).
0.18/0.39	cnf(i_0_65, plain, (additive_inverse(additive_inverse(X5))!=X5), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_63, plain, (add(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=add(X3,X5)), inference(extension_rule, [i_0_37])).
0.18/0.39	cnf(i_0_77, plain, (add(X3,X5)!=additive_inverse(additive_inverse(add(X3,X5)))), inference(closure_rule, [i_0_21])).
0.18/0.39	cnf(i_0_75, plain, (add(additive_inverse(additive_inverse(X3)),additive_inverse(additive_inverse(X5)))=additive_inverse(additive_inverse(add(X3,X5)))), inference(etableau_closure_rule, [i_0_75, ...])).
0.18/0.39	# End printing tableau
0.18/0.39	# SZS output end
0.18/0.39	# Branches closed with saturation will be marked with an "s"
0.18/0.39	# Child (18479) has found a proof.
0.18/0.39	
0.18/0.39	# Proof search is over...
0.18/0.39	# Freeing feature tree
0.18/0.39	EOF