0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.34	% Computer   : n015.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 10:22:49 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.13/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.13/0.37	#
0.13/0.37	# Presaturation interreduction done
0.13/0.37	# Number of axioms: 11 Number of unprocessed: 11
0.13/0.37	# Tableaux proof search.
0.13/0.37	# APR header successfully linked.
0.13/0.37	# Hello from C++
0.13/0.38	# The folding up rule is enabled...
0.13/0.38	# Local unification is enabled...
0.13/0.38	# Any saturation attempts will use folding labels...
0.13/0.38	# 11 beginning clauses after preprocessing and clausification
0.13/0.38	# Creating start rules for all 1 conjectures.
0.13/0.38	# There are 1 start rule candidates:
0.13/0.38	# Found 5 unit axioms.
0.13/0.38	# 1 start rule tableaux created.
0.13/0.38	# 6 extension rule candidate clauses
0.13/0.38	# 5 unit axiom clauses
0.13/0.38	
0.13/0.38	# Requested 8, 32 cores available to the main process.
0.13/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.38	# Ran out of tableaux, making start rules for all clauses
0.13/0.38	# Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
0.13/0.38	# We now have 15 tableaux to operate on
0.13/0.38	# 28965 Satisfiable branch
0.13/0.38	# 28967 Satisfiable branch
0.13/0.38	# 28966 Satisfiable branch
0.13/0.38	# 28968 Satisfiable branch
0.13/0.38	# Satisfiable branch found.
0.13/0.38	# Satisfiable branch found.
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 0 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 0 successful branch saturations after the branch.
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 0 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 0 successful branch saturations after the branch.
0.13/0.38	# SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1))).
0.13/0.38	cnf(i_0_6, plain, (equalish(n0,n0))).
0.13/0.38	cnf(i_0_11, negated_conjecture, (~goal)).
0.13/0.38	cnf(i_0_10, plain, (~equalish(n1,n0))).
0.13/0.38	cnf(i_0_8, plain, (~equalish(n0,n1))).
0.13/0.38	cnf(i_0_9, plain, (f(X1,X2,X3,X4,X5,esk1_5(X1,X2,X3,X4,X5))|~equalish(X1,X1)|~equalish(X2,X2)|~equalish(X4,X4)|~equalish(X5,X5)|~equalish(X3,X3))).
0.13/0.38	cnf(i_0_3, plain, (equalish(X1,X2)|~f(X3,X4,X5,X6,X2,X7)|~f(X8,X9,X10,X11,X1,X7))).
0.13/0.38	cnf(i_0_2, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6,X7)|~f(X8,X9,X10,X1,X11,X7))).
0.13/0.38	cnf(i_0_1, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6,X7)|~f(X8,X9,X1,X10,X11,X7))).
0.13/0.38	cnf(i_0_4, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6,X7)|~f(X8,X1,X9,X10,X11,X7))).
0.13/0.38	cnf(i_0_5, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6,X7)|~f(X1,X8,X9,X10,X11,X7))).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1)), inference(start_rule)).
0.13/0.38	cnf(i_0_34, plain, (equalish(n1,n1)), inference(extension_rule, [i_0_9])).
0.13/0.38	cnf(i_0_61, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_62, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_63, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_64, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_60, plain, (f(n1,n1,n1,n1,n1,esk1_5(n1,n1,n1,n1,n1))), inference(extension_rule, [i_0_3])).
0.13/0.38	cnf(i_0_87, plain, (equalish(n0,n1)), inference(closure_rule, [i_0_8])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# 28969 Satisfiable branch
0.13/0.38	# Satisfiable branch found.
0.13/0.38	# SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1))).
0.13/0.38	cnf(i_0_6, plain, (equalish(n0,n0))).
0.13/0.38	cnf(i_0_11, negated_conjecture, (~goal)).
0.13/0.38	cnf(i_0_10, plain, (~equalish(n1,n0))).
0.13/0.38	cnf(i_0_8, plain, (~equalish(n0,n1))).
0.13/0.38	cnf(i_0_9, plain, (f(X1,X2,X3,X4,X5,esk1_5(X1,X2,X3,X4,X5))|~equalish(X1,X1)|~equalish(X2,X2)|~equalish(X4,X4)|~equalish(X5,X5)|~equalish(X3,X3))).
0.13/0.38	cnf(i_0_3, plain, (equalish(X1,X2)|~f(X3,X4,X5,X6,X2,X7)|~f(X8,X9,X10,X11,X1,X7))).
0.13/0.38	cnf(i_0_2, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6,X7)|~f(X8,X9,X10,X1,X11,X7))).
0.13/0.38	cnf(i_0_1, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6,X7)|~f(X8,X9,X1,X10,X11,X7))).
0.13/0.38	cnf(i_0_4, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6,X7)|~f(X8,X1,X9,X10,X11,X7))).
0.13/0.38	cnf(i_0_5, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6,X7)|~f(X1,X8,X9,X10,X11,X7))).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1)), inference(start_rule)).
0.13/0.38	cnf(i_0_34, plain, (equalish(n1,n1)), inference(extension_rule, [i_0_9])).
0.13/0.38	cnf(i_0_61, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_62, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_64, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_65, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_60, plain, (f(n1,n1,n1,n1,n1,esk1_5(n1,n1,n1,n1,n1))), inference(extension_rule, [i_0_3])).
0.13/0.38	cnf(i_0_87, plain, (equalish(n0,n1)), inference(closure_rule, [i_0_8])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 0 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 0 successful branch saturations after the branch.
0.13/0.38	# SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1))).
0.13/0.38	cnf(i_0_6, plain, (equalish(n0,n0))).
0.13/0.38	cnf(i_0_11, negated_conjecture, (~goal)).
0.13/0.38	cnf(i_0_10, plain, (~equalish(n1,n0))).
0.13/0.38	cnf(i_0_8, plain, (~equalish(n0,n1))).
0.13/0.38	cnf(i_0_9, plain, (f(X1,X2,X3,X4,X5,esk1_5(X1,X2,X3,X4,X5))|~equalish(X1,X1)|~equalish(X2,X2)|~equalish(X4,X4)|~equalish(X5,X5)|~equalish(X3,X3))).
0.13/0.38	cnf(i_0_3, plain, (equalish(X1,X2)|~f(X3,X4,X5,X6,X2,X7)|~f(X8,X9,X10,X11,X1,X7))).
0.13/0.38	cnf(i_0_2, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6,X7)|~f(X8,X9,X10,X1,X11,X7))).
0.13/0.38	cnf(i_0_1, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6,X7)|~f(X8,X9,X1,X10,X11,X7))).
0.13/0.38	cnf(i_0_4, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6,X7)|~f(X8,X1,X9,X10,X11,X7))).
0.13/0.38	cnf(i_0_5, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6,X7)|~f(X1,X8,X9,X10,X11,X7))).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1)), inference(start_rule)).
0.13/0.38	cnf(i_0_34, plain, (equalish(n1,n1)), inference(extension_rule, [i_0_9])).
0.13/0.38	cnf(i_0_61, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_62, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_63, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_65, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_60, plain, (f(n1,n1,n1,n1,n1,esk1_5(n1,n1,n1,n1,n1))), inference(extension_rule, [i_0_3])).
0.13/0.38	cnf(i_0_87, plain, (equalish(n0,n1)), inference(closure_rule, [i_0_8])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# 28970 Satisfiable branch
0.13/0.38	# Satisfiable branch found.
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 0 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 0 successful branch saturations after the branch.
0.13/0.38	# SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1))).
0.13/0.38	cnf(i_0_6, plain, (equalish(n0,n0))).
0.13/0.38	cnf(i_0_11, negated_conjecture, (~goal)).
0.13/0.38	cnf(i_0_10, plain, (~equalish(n1,n0))).
0.13/0.38	cnf(i_0_8, plain, (~equalish(n0,n1))).
0.13/0.38	cnf(i_0_9, plain, (f(X1,X2,X3,X4,X5,esk1_5(X1,X2,X3,X4,X5))|~equalish(X1,X1)|~equalish(X2,X2)|~equalish(X4,X4)|~equalish(X5,X5)|~equalish(X3,X3))).
0.13/0.38	cnf(i_0_3, plain, (equalish(X1,X2)|~f(X3,X4,X5,X6,X2,X7)|~f(X8,X9,X10,X11,X1,X7))).
0.13/0.38	cnf(i_0_2, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6,X7)|~f(X8,X9,X10,X1,X11,X7))).
0.13/0.38	cnf(i_0_1, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6,X7)|~f(X8,X9,X1,X10,X11,X7))).
0.13/0.38	cnf(i_0_4, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6,X7)|~f(X8,X1,X9,X10,X11,X7))).
0.13/0.38	cnf(i_0_5, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6,X7)|~f(X1,X8,X9,X10,X11,X7))).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1)), inference(start_rule)).
0.13/0.38	cnf(i_0_34, plain, (equalish(n1,n1)), inference(extension_rule, [i_0_9])).
0.13/0.38	cnf(i_0_61, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_63, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_64, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_65, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_60, plain, (f(n1,n1,n1,n1,n1,esk1_5(n1,n1,n1,n1,n1))), inference(extension_rule, [i_0_3])).
0.13/0.38	cnf(i_0_87, plain, (equalish(n0,n1)), inference(closure_rule, [i_0_8])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# Satisfiable branch found.
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 0 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 0 successful branch saturations after the branch.
0.13/0.38	# SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1))).
0.13/0.38	cnf(i_0_6, plain, (equalish(n0,n0))).
0.13/0.38	cnf(i_0_11, negated_conjecture, (~goal)).
0.13/0.38	cnf(i_0_10, plain, (~equalish(n1,n0))).
0.13/0.38	cnf(i_0_8, plain, (~equalish(n0,n1))).
0.13/0.38	cnf(i_0_9, plain, (f(X1,X2,X3,X4,X5,esk1_5(X1,X2,X3,X4,X5))|~equalish(X1,X1)|~equalish(X2,X2)|~equalish(X4,X4)|~equalish(X5,X5)|~equalish(X3,X3))).
0.13/0.38	cnf(i_0_3, plain, (equalish(X1,X2)|~f(X3,X4,X5,X6,X2,X7)|~f(X8,X9,X10,X11,X1,X7))).
0.13/0.38	cnf(i_0_2, plain, (equalish(X1,X2)|~f(X3,X4,X5,X2,X6,X7)|~f(X8,X9,X10,X1,X11,X7))).
0.13/0.38	cnf(i_0_1, plain, (equalish(X1,X2)|~f(X3,X4,X2,X5,X6,X7)|~f(X8,X9,X1,X10,X11,X7))).
0.13/0.38	cnf(i_0_4, plain, (equalish(X1,X2)|~f(X3,X2,X4,X5,X6,X7)|~f(X8,X1,X9,X10,X11,X7))).
0.13/0.38	cnf(i_0_5, plain, (equalish(X1,X2)|~f(X2,X3,X4,X5,X6,X7)|~f(X1,X8,X9,X10,X11,X7))).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_7, plain, (equalish(n1,n1)), inference(start_rule)).
0.13/0.38	cnf(i_0_34, plain, (equalish(n1,n1)), inference(extension_rule, [i_0_9])).
0.13/0.38	cnf(i_0_62, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_63, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_64, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_65, plain, (~equalish(n1,n1)), inference(closure_rule, [i_0_7])).
0.13/0.38	cnf(i_0_60, plain, (f(n1,n1,n1,n1,n1,esk1_5(n1,n1,n1,n1,n1))), inference(extension_rule, [i_0_3])).
0.13/0.38	cnf(i_0_87, plain, (equalish(n0,n1)), inference(closure_rule, [i_0_8])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# Child (28967) has found a proof.
0.13/0.38	
0.13/0.38	# Proof search is over...
0.13/0.38	# Freeing feature tree
0.13/0.38	EOF