0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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   : n010.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.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 12:35:36 EDT 2021
0.12/0.33	% CPUTime    : 
0.19/0.36	# No SInE strategy applied
0.19/0.36	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.19/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.19/0.36	#
0.19/0.36	# Presaturation interreduction done
0.19/0.36	# Number of axioms: 18 Number of unprocessed: 18
0.19/0.36	# Tableaux proof search.
0.19/0.36	# APR header successfully linked.
0.19/0.36	# Hello from C++
0.19/0.36	# The folding up rule is enabled...
0.19/0.36	# Local unification is enabled...
0.19/0.36	# Any saturation attempts will use folding labels...
0.19/0.36	# 18 beginning clauses after preprocessing and clausification
0.19/0.36	# Creating start rules for all 2 conjectures.
0.19/0.36	# There are 2 start rule candidates:
0.19/0.36	# Found 18 unit axioms.
0.19/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.36	# 2 start rule tableaux created.
0.19/0.36	# 0 extension rule candidate clauses
0.19/0.36	# 18 unit axiom clauses
0.19/0.36	
0.19/0.36	# Requested 8, 32 cores available to the main process.
0.19/0.36	# There are not enough tableaux to fork, creating more from the initial 2
0.19/0.36	# Creating equality axioms
0.19/0.36	# Ran out of tableaux, making start rules for all clauses
0.19/0.36	# Returning from population with 43 new_tableaux and 0 remaining starting tableaux.
0.19/0.36	# We now have 43 tableaux to operate on
25.61/3.86	# There were 1 total branch saturation attempts.
25.61/3.86	# There were 0 of these attempts blocked.
25.61/3.86	# There were 0 deferred branch saturation attempts.
25.61/3.86	# There were 0 free duplicated saturations.
25.61/3.86	# There were 1 total successful branch saturations.
25.61/3.86	# There were 0 successful branch saturations in interreduction.
25.61/3.86	# There were 0 successful branch saturations on the branch.
25.61/3.86	# There were 1 successful branch saturations after the branch.
25.61/3.86	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
25.61/3.86	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
25.61/3.86	# Begin clausification derivation
25.61/3.86	
25.61/3.86	# End clausification derivation
25.61/3.86	# Begin listing active clauses obtained from FOF to CNF conversion
25.61/3.86	cnf(i_0_20, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d)).
25.61/3.86	cnf(i_0_21, plain, (positive_integer(k)=true)).
25.61/3.86	cnf(i_0_34, plain, (ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)).
25.61/3.86	cnf(i_0_30, negated_conjecture, (ifeq3(negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)).
25.61/3.86	cnf(i_0_28, plain, (positive_integer(one)=true)).
25.61/3.86	cnf(i_0_26, plain, (multiply(one,X1)=X1)).
25.61/3.86	cnf(i_0_19, plain, (ifeq4(X1,X1,X2,X3)=X2)).
25.61/3.86	cnf(i_0_22, plain, (ifeq2(X1,X1,X2,X3)=X2)).
25.61/3.86	cnf(i_0_32, plain, (ifeq(X1,X1,X2,X3)=X2)).
25.61/3.86	cnf(i_0_27, plain, (ifeq3(X1,X1,X2,X3)=X2)).
25.61/3.86	cnf(i_0_24, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
25.61/3.86	cnf(i_0_23, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)).
25.61/3.86	cnf(i_0_25, plain, (ifeq(positive_integer(X1),true,positive_integer(successor(X1)),true)=true)).
25.61/3.86	cnf(i_0_35, plain, (ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2)=X2)).
25.61/3.86	cnf(i_0_36, plain, (ifeq2(positive_integer(X1),true,add(X1,multiply(X2,X1)),multiply(successor(X2),X1))=multiply(successor(X2),X1))).
25.61/3.86	cnf(i_0_29, plain, (ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4)=X4)).
25.61/3.86	cnf(i_0_31, plain, (add(X1,X2)=add(X2,X1))).
25.61/3.86	cnf(i_0_33, negated_conjecture, (a!=b)).
25.61/3.86	cnf(i_0_39, plain, (X5=X5)).
25.61/3.86	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
25.61/3.86	# Begin printing tableau
25.61/3.86	# Found 8 steps
25.61/3.86	cnf(i_0_20, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(start_rule)).
25.61/3.86	cnf(i_0_52, plain, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(extension_rule, [i_0_51])).
25.61/3.86	cnf(i_0_107, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.86	cnf(i_0_108, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.86	cnf(i_0_109, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.86	cnf(i_0_105, plain, (ifeq3(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=ifeq3(d,d,d,d)), inference(extension_rule, [i_0_42])).
25.61/3.86	cnf(i_0_116, plain, (ifeq3(d,d,d,d)!=multiply(one,ifeq3(d,d,d,d))), inference(closure_rule, [i_0_26])).
25.61/3.86	cnf(i_0_114, plain, (ifeq3(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=multiply(one,ifeq3(d,d,d,d))), inference(etableau_closure_rule, [i_0_114, ...])).
25.61/3.86	# End printing tableau
25.61/3.86	# SZS output end
25.61/3.86	# Branches closed with saturation will be marked with an "s"
25.61/3.87	# There were 1 total branch saturation attempts.
25.61/3.87	# There were 0 of these attempts blocked.
25.61/3.87	# There were 0 deferred branch saturation attempts.
25.61/3.87	# There were 0 free duplicated saturations.
25.61/3.87	# There were 1 total successful branch saturations.
25.61/3.87	# There were 0 successful branch saturations in interreduction.
25.61/3.87	# There were 0 successful branch saturations on the branch.
25.61/3.87	# There were 1 successful branch saturations after the branch.
25.61/3.87	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
25.61/3.87	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
25.61/3.87	# Begin clausification derivation
25.61/3.87	
25.61/3.87	# End clausification derivation
25.61/3.87	# Begin listing active clauses obtained from FOF to CNF conversion
25.61/3.87	cnf(i_0_20, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d)).
25.61/3.87	cnf(i_0_21, plain, (positive_integer(k)=true)).
25.61/3.87	cnf(i_0_34, plain, (ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)).
25.61/3.87	cnf(i_0_30, negated_conjecture, (ifeq3(negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)).
25.61/3.87	cnf(i_0_28, plain, (positive_integer(one)=true)).
25.61/3.87	cnf(i_0_26, plain, (multiply(one,X1)=X1)).
25.61/3.87	cnf(i_0_19, plain, (ifeq4(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_22, plain, (ifeq2(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_32, plain, (ifeq(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_27, plain, (ifeq3(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_24, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
25.61/3.87	cnf(i_0_23, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)).
25.61/3.87	cnf(i_0_25, plain, (ifeq(positive_integer(X1),true,positive_integer(successor(X1)),true)=true)).
25.61/3.87	cnf(i_0_35, plain, (ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2)=X2)).
25.61/3.87	cnf(i_0_36, plain, (ifeq2(positive_integer(X1),true,add(X1,multiply(X2,X1)),multiply(successor(X2),X1))=multiply(successor(X2),X1))).
25.61/3.87	cnf(i_0_29, plain, (ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4)=X4)).
25.61/3.87	cnf(i_0_31, plain, (add(X1,X2)=add(X2,X1))).
25.61/3.87	cnf(i_0_33, negated_conjecture, (a!=b)).
25.61/3.87	cnf(i_0_39, plain, (X5=X5)).
25.61/3.87	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
25.61/3.87	# Begin printing tableau
25.61/3.87	# Found 8 steps
25.61/3.87	cnf(i_0_20, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(start_rule)).
25.61/3.87	cnf(i_0_52, plain, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(extension_rule, [i_0_51])).
25.61/3.87	cnf(i_0_106, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.87	cnf(i_0_107, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.87	cnf(i_0_108, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.87	cnf(i_0_105, plain, (ifeq3(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=ifeq3(d,d,d,d)), inference(extension_rule, [i_0_42])).
25.61/3.87	cnf(i_0_116, plain, (ifeq3(d,d,d,d)!=multiply(one,ifeq3(d,d,d,d))), inference(closure_rule, [i_0_26])).
25.61/3.87	cnf(i_0_114, plain, (ifeq3(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=multiply(one,ifeq3(d,d,d,d))), inference(etableau_closure_rule, [i_0_114, ...])).
25.61/3.87	# End printing tableau
25.61/3.87	# SZS output end
25.61/3.87	# Branches closed with saturation will be marked with an "s"
25.61/3.87	# There were 1 total branch saturation attempts.
25.61/3.87	# There were 0 of these attempts blocked.
25.61/3.87	# There were 0 deferred branch saturation attempts.
25.61/3.87	# There were 0 free duplicated saturations.
25.61/3.87	# There were 1 total successful branch saturations.
25.61/3.87	# There were 0 successful branch saturations in interreduction.
25.61/3.87	# There were 0 successful branch saturations on the branch.
25.61/3.87	# There were 1 successful branch saturations after the branch.
25.61/3.87	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
25.61/3.87	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
25.61/3.87	# Begin clausification derivation
25.61/3.87	
25.61/3.87	# End clausification derivation
25.61/3.87	# Begin listing active clauses obtained from FOF to CNF conversion
25.61/3.87	cnf(i_0_20, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d)).
25.61/3.87	cnf(i_0_21, plain, (positive_integer(k)=true)).
25.61/3.87	cnf(i_0_34, plain, (ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)).
25.61/3.87	cnf(i_0_30, negated_conjecture, (ifeq3(negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)).
25.61/3.87	cnf(i_0_28, plain, (positive_integer(one)=true)).
25.61/3.87	cnf(i_0_26, plain, (multiply(one,X1)=X1)).
25.61/3.87	cnf(i_0_19, plain, (ifeq4(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_22, plain, (ifeq2(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_32, plain, (ifeq(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_27, plain, (ifeq3(X1,X1,X2,X3)=X2)).
25.61/3.87	cnf(i_0_24, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
25.61/3.87	cnf(i_0_23, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)).
25.61/3.87	cnf(i_0_25, plain, (ifeq(positive_integer(X1),true,positive_integer(successor(X1)),true)=true)).
25.61/3.87	cnf(i_0_35, plain, (ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2)=X2)).
25.61/3.87	cnf(i_0_36, plain, (ifeq2(positive_integer(X1),true,add(X1,multiply(X2,X1)),multiply(successor(X2),X1))=multiply(successor(X2),X1))).
25.61/3.87	cnf(i_0_29, plain, (ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4)=X4)).
25.61/3.87	cnf(i_0_31, plain, (add(X1,X2)=add(X2,X1))).
25.61/3.87	cnf(i_0_33, negated_conjecture, (a!=b)).
25.61/3.87	cnf(i_0_39, plain, (X5=X5)).
25.61/3.87	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
25.61/3.87	# Begin printing tableau
25.61/3.87	# Found 8 steps
25.61/3.87	cnf(i_0_20, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(start_rule)).
25.61/3.87	cnf(i_0_52, plain, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(extension_rule, [i_0_51])).
25.61/3.87	cnf(i_0_106, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.87	cnf(i_0_107, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.87	cnf(i_0_109, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_20])).
25.61/3.87	cnf(i_0_105, plain, (ifeq3(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=ifeq3(d,d,d,d)), inference(extension_rule, [i_0_42])).
25.61/3.87	cnf(i_0_116, plain, (ifeq3(d,d,d,d)!=multiply(one,ifeq3(d,d,d,d))), inference(closure_rule, [i_0_26])).
25.61/3.87	cnf(i_0_114, plain, (ifeq3(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=multiply(one,ifeq3(d,d,d,d))), inference(etableau_closure_rule, [i_0_114, ...])).
25.61/3.87	# End printing tableau
25.61/3.87	# SZS output end
25.61/3.87	# Branches closed with saturation will be marked with an "s"
25.61/3.88	# Child (31959) has found a proof.
25.61/3.88	
25.61/3.88	# Proof search is over...
25.61/3.88	# Freeing feature tree
25.61/3.92	EOF