0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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   : n015.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 13:56:04 EDT 2021
0.15/0.31	% CPUTime    : 
0.15/0.34	# No SInE strategy applied
0.15/0.34	# Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
0.15/0.34	# and selection function SelectMaxLComplexAvoidPosPred.
0.15/0.34	#
0.15/0.34	# Presaturation interreduction done
0.15/0.34	# Number of axioms: 26 Number of unprocessed: 26
0.15/0.34	# Tableaux proof search.
0.15/0.34	# APR header successfully linked.
0.15/0.34	# Hello from C++
0.15/0.34	# The folding up rule is enabled...
0.15/0.34	# Local unification is enabled...
0.15/0.34	# Any saturation attempts will use folding labels...
0.15/0.34	# 26 beginning clauses after preprocessing and clausification
0.15/0.34	# Creating start rules for all 1 conjectures.
0.15/0.34	# There are 1 start rule candidates:
0.15/0.34	# Found 26 unit axioms.
0.15/0.34	# 1 start rule tableaux created.
0.15/0.34	# 0 extension rule candidate clauses
0.15/0.34	# 26 unit axiom clauses
0.15/0.34	
0.15/0.34	# Requested 8, 32 cores available to the main process.
0.15/0.34	# There are not enough tableaux to fork, creating more from the initial 1
0.15/0.34	# Creating equality axioms
0.15/0.34	# Ran out of tableaux, making start rules for all clauses
0.15/0.34	# Returning from population with 47 new_tableaux and 0 remaining starting tableaux.
0.15/0.34	# We now have 47 tableaux to operate on
5.25/1.00	# There were 1 total branch saturation attempts.
5.25/1.00	# There were 0 of these attempts blocked.
5.25/1.00	# There were 0 deferred branch saturation attempts.
5.25/1.00	# There were 0 free duplicated saturations.
5.25/1.00	# There were 1 total successful branch saturations.
5.25/1.00	# There were 0 successful branch saturations in interreduction.
5.25/1.00	# There were 0 successful branch saturations on the branch.
5.25/1.00	# There were 1 successful branch saturations after the branch.
5.25/1.00	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.25/1.00	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.25/1.00	# Begin clausification derivation
5.25/1.00	
5.25/1.00	# End clausification derivation
5.25/1.00	# Begin listing active clauses obtained from FOF to CNF conversion
5.25/1.00	cnf(i_0_42, hypothesis, (sum(x,y,z)=true)).
5.25/1.00	cnf(i_0_45, plain, (sum(additive_identity,X1,X1)=true)).
5.25/1.00	cnf(i_0_28, plain, (product(X1,multiplicative_identity,X1)=true)).
5.25/1.00	cnf(i_0_35, plain, (sum(X1,additive_identity,X1)=true)).
5.25/1.00	cnf(i_0_48, plain, (product(multiplicative_identity,X1,X1)=true)).
5.25/1.00	cnf(i_0_30, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
5.25/1.00	cnf(i_0_40, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
5.25/1.00	cnf(i_0_51, plain, (product(X1,inverse(X1),additive_identity)=true)).
5.25/1.00	cnf(i_0_33, plain, (product(inverse(X1),X1,additive_identity)=true)).
5.25/1.00	cnf(i_0_32, plain, (ifeq2(X1,X1,X2,X3)=X2)).
5.25/1.00	cnf(i_0_34, plain, (ifeq(X1,X1,X2,X3)=X2)).
5.25/1.00	cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
5.25/1.00	cnf(i_0_43, plain, (sum(X1,X2,add(X1,X2))=true)).
5.25/1.00	cnf(i_0_49, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
5.25/1.00	cnf(i_0_41, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
5.25/1.00	cnf(i_0_39, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
5.25/1.00	cnf(i_0_46, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
5.25/1.00	cnf(i_0_44, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_50, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_47, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_52, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_27, negated_conjecture, (product(x,z,x)!=true)).
5.25/1.00	cnf(i_0_54, plain, (X8=X8)).
5.25/1.00	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
5.25/1.00	# Begin printing tableau
5.25/1.00	# Found 7 steps
5.25/1.00	cnf(i_0_42, hypothesis, (sum(x,y,z)=true), inference(start_rule)).
5.25/1.00	cnf(i_0_65, plain, (sum(x,y,z)=true), inference(extension_rule, [i_0_64])).
5.25/1.00	cnf(i_0_124, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.00	cnf(i_0_122, plain, (add(sum(x,y,z),sum(x,y,z))=add(true,true)), inference(extension_rule, [i_0_58])).
5.25/1.00	cnf(i_0_258, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.00	cnf(i_0_259, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.00	cnf(i_0_256, plain, (product(add(sum(x,y,z),sum(x,y,z)),sum(x,y,z),sum(x,y,z))=product(add(true,true),true,true)), inference(etableau_closure_rule, [i_0_256, ...])).
5.25/1.00	# End printing tableau
5.25/1.00	# SZS output end
5.25/1.00	# Branches closed with saturation will be marked with an "s"
5.25/1.00	# There were 1 total branch saturation attempts.
5.25/1.00	# There were 0 of these attempts blocked.
5.25/1.00	# There were 0 deferred branch saturation attempts.
5.25/1.00	# There were 0 free duplicated saturations.
5.25/1.00	# There were 1 total successful branch saturations.
5.25/1.00	# There were 0 successful branch saturations in interreduction.
5.25/1.00	# There were 0 successful branch saturations on the branch.
5.25/1.00	# There were 1 successful branch saturations after the branch.
5.25/1.00	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.25/1.00	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.25/1.00	# Begin clausification derivation
5.25/1.00	
5.25/1.00	# End clausification derivation
5.25/1.00	# Begin listing active clauses obtained from FOF to CNF conversion
5.25/1.00	cnf(i_0_42, hypothesis, (sum(x,y,z)=true)).
5.25/1.00	cnf(i_0_45, plain, (sum(additive_identity,X1,X1)=true)).
5.25/1.00	cnf(i_0_28, plain, (product(X1,multiplicative_identity,X1)=true)).
5.25/1.00	cnf(i_0_35, plain, (sum(X1,additive_identity,X1)=true)).
5.25/1.00	cnf(i_0_48, plain, (product(multiplicative_identity,X1,X1)=true)).
5.25/1.00	cnf(i_0_30, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
5.25/1.00	cnf(i_0_40, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
5.25/1.00	cnf(i_0_51, plain, (product(X1,inverse(X1),additive_identity)=true)).
5.25/1.00	cnf(i_0_33, plain, (product(inverse(X1),X1,additive_identity)=true)).
5.25/1.00	cnf(i_0_32, plain, (ifeq2(X1,X1,X2,X3)=X2)).
5.25/1.00	cnf(i_0_34, plain, (ifeq(X1,X1,X2,X3)=X2)).
5.25/1.00	cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
5.25/1.00	cnf(i_0_43, plain, (sum(X1,X2,add(X1,X2))=true)).
5.25/1.00	cnf(i_0_49, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
5.25/1.00	cnf(i_0_41, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
5.25/1.00	cnf(i_0_39, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
5.25/1.00	cnf(i_0_46, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
5.25/1.00	cnf(i_0_44, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_50, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_47, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_52, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
5.25/1.00	cnf(i_0_27, negated_conjecture, (product(x,z,x)!=true)).
5.25/1.00	cnf(i_0_54, plain, (X8=X8)).
5.25/1.00	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
5.25/1.00	# Begin printing tableau
5.25/1.00	# Found 7 steps
5.25/1.00	cnf(i_0_42, hypothesis, (sum(x,y,z)=true), inference(start_rule)).
5.25/1.00	cnf(i_0_65, plain, (sum(x,y,z)=true), inference(extension_rule, [i_0_64])).
5.25/1.00	cnf(i_0_123, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.00	cnf(i_0_122, plain, (add(sum(x,y,z),sum(x,y,z))=add(true,true)), inference(extension_rule, [i_0_58])).
5.25/1.00	cnf(i_0_258, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.00	cnf(i_0_259, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.00	cnf(i_0_256, plain, (product(add(sum(x,y,z),sum(x,y,z)),sum(x,y,z),sum(x,y,z))=product(add(true,true),true,true)), inference(etableau_closure_rule, [i_0_256, ...])).
5.25/1.00	# End printing tableau
5.25/1.00	# SZS output end
5.25/1.00	# Branches closed with saturation will be marked with an "s"
5.25/1.01	# There were 1 total branch saturation attempts.
5.25/1.01	# There were 0 of these attempts blocked.
5.25/1.01	# There were 0 deferred branch saturation attempts.
5.25/1.01	# There were 0 free duplicated saturations.
5.25/1.01	# There were 1 total successful branch saturations.
5.25/1.01	# There were 0 successful branch saturations in interreduction.
5.25/1.01	# There were 0 successful branch saturations on the branch.
5.25/1.01	# There were 1 successful branch saturations after the branch.
5.25/1.01	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.25/1.01	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.25/1.01	# Begin clausification derivation
5.25/1.01	
5.25/1.01	# End clausification derivation
5.25/1.01	# Begin listing active clauses obtained from FOF to CNF conversion
5.25/1.01	cnf(i_0_42, hypothesis, (sum(x,y,z)=true)).
5.25/1.01	cnf(i_0_45, plain, (sum(additive_identity,X1,X1)=true)).
5.25/1.01	cnf(i_0_28, plain, (product(X1,multiplicative_identity,X1)=true)).
5.25/1.01	cnf(i_0_35, plain, (sum(X1,additive_identity,X1)=true)).
5.25/1.01	cnf(i_0_48, plain, (product(multiplicative_identity,X1,X1)=true)).
5.25/1.01	cnf(i_0_30, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
5.25/1.01	cnf(i_0_40, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
5.25/1.01	cnf(i_0_51, plain, (product(X1,inverse(X1),additive_identity)=true)).
5.25/1.01	cnf(i_0_33, plain, (product(inverse(X1),X1,additive_identity)=true)).
5.25/1.01	cnf(i_0_32, plain, (ifeq2(X1,X1,X2,X3)=X2)).
5.25/1.01	cnf(i_0_34, plain, (ifeq(X1,X1,X2,X3)=X2)).
5.25/1.01	cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
5.25/1.01	cnf(i_0_43, plain, (sum(X1,X2,add(X1,X2))=true)).
5.25/1.01	cnf(i_0_49, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
5.25/1.01	cnf(i_0_41, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
5.25/1.01	cnf(i_0_39, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
5.25/1.01	cnf(i_0_46, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
5.25/1.01	cnf(i_0_44, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_50, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_47, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_52, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
5.25/1.01	cnf(i_0_27, negated_conjecture, (product(x,z,x)!=true)).
5.25/1.01	cnf(i_0_54, plain, (X8=X8)).
5.25/1.01	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
5.25/1.01	# Begin printing tableau
5.25/1.01	# Found 8 steps
5.25/1.01	cnf(i_0_42, hypothesis, (sum(x,y,z)=true), inference(start_rule)).
5.25/1.01	cnf(i_0_65, plain, (sum(x,y,z)=true), inference(extension_rule, [i_0_62])).
5.25/1.01	cnf(i_0_113, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.01	cnf(i_0_114, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.01	cnf(i_0_116, plain, (sum(x,y,z)!=true), inference(closure_rule, [i_0_42])).
5.25/1.01	cnf(i_0_112, plain, (ifeq(sum(x,y,z),sum(x,y,z),sum(x,y,z),sum(x,y,z))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_57])).
5.25/1.01	cnf(i_0_131, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_34])).
5.25/1.01	cnf(i_0_129, plain, (ifeq(sum(x,y,z),sum(x,y,z),sum(x,y,z),sum(x,y,z))=true), inference(etableau_closure_rule, [i_0_129, ...])).
5.25/1.01	# End printing tableau
5.25/1.01	# SZS output end
5.25/1.01	# Branches closed with saturation will be marked with an "s"
5.25/1.01	# Child (8509) has found a proof.
5.25/1.01	
5.25/1.01	# Proof search is over...
5.25/1.01	# Freeing feature tree
5.25/1.02	EOF