0.00/0.11	% 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.11/0.32	% Computer   : n023.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1200
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Jul 13 12:50:26 EDT 2021
0.11/0.32	% CPUTime    : 
0.17/0.50	# No SInE strategy applied
0.17/0.50	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.17/0.50	# and selection function SelectComplexExceptUniqMaxHorn.
0.17/0.50	#
0.17/0.50	# Presaturation interreduction done
0.17/0.50	# Number of axioms: 1350 Number of unprocessed: 118
0.17/0.50	# Tableaux proof search.
0.17/0.50	# APR header successfully linked.
0.17/0.50	# Hello from C++
0.17/0.51	# The folding up rule is enabled...
0.17/0.51	# Local unification is enabled...
0.17/0.51	# Any saturation attempts will use folding labels...
0.17/0.51	# 118 beginning clauses after preprocessing and clausification
0.17/0.51	# No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
0.17/0.51	# No conjectures.
0.17/0.51	# There are 118 start rule candidates:
0.17/0.51	# Found 118 unit axioms.
0.17/0.51	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.17/0.51	# 118 start rule tableaux created.
0.17/0.51	# 0 extension rule candidate clauses
0.17/0.51	# 118 unit axiom clauses
0.17/0.51	
0.17/0.51	# Requested 8, 32 cores available to the main process.
0.17/0.52	# Creating equality axioms
0.17/0.52	# Ran out of tableaux, making start rules for all clauses
0.17/0.52	# 31710 Satisfiable branch
0.17/0.52	# Satisfiable branch found.
0.17/0.52	# There were 1 total branch saturation attempts.
0.17/0.52	# There were 0 of these attempts blocked.
0.17/0.52	# There were 0 deferred branch saturation attempts.
0.17/0.52	# There were 0 free duplicated saturations.
0.17/0.52	# There were 0 total successful branch saturations.
0.17/0.52	# There were 0 successful branch saturations in interreduction.
0.17/0.52	# There were 0 successful branch saturations on the branch.
0.17/0.52	# There were 0 successful branch saturations after the branch.
0.17/0.52	# SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.17/0.52	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.17/0.52	# Begin clausification derivation
0.17/0.52	
0.17/0.52	# End clausification derivation
0.17/0.52	# Begin listing active clauses obtained from FOF to CNF conversion
0.17/0.52	cnf(i_0_1344, plain, (ssA(n3,n9)=n8)).
0.17/0.52	cnf(i_0_1349, plain, (ssA(n3,n2)=n3)).
0.17/0.52	cnf(i_0_1343, plain, (ssA(n7,n8)=n3)).
0.17/0.52	cnf(i_0_1336, plain, (ssA(n6,n8)=n5)).
0.17/0.52	cnf(i_0_1347, plain, (ssA(n1,n5)=n7)).
0.17/0.52	cnf(i_0_1339, plain, (ssA(n7,n4)=n7)).
0.17/0.52	cnf(i_0_1340, plain, (ssA(n4,n7)=n7)).
0.17/0.52	cnf(i_0_1348, plain, (ssA(n4,n1)=n6)).
0.17/0.52	cnf(i_0_1345, plain, (ssA(n1,n4)=n4)).
0.17/0.52	cnf(i_0_1335, plain, (ssA(n5,n3)=n4)).
0.17/0.52	cnf(i_0_1338, plain, (ssA(n9,n9)=n4)).
0.17/0.52	cnf(i_0_1337, plain, (ssA(n1,n7)=n1)).
0.17/0.52	cnf(i_0_1342, plain, (ssA(n8,n1)=n1)).
0.17/0.52	cnf(i_0_1350, plain, (ssA(n2,n2)=n5)).
0.17/0.52	cnf(i_0_1341, plain, (ssA(n2,n4)=n2)).
0.17/0.52	cnf(i_0_1346, plain, (ssA(n5,n6)=n3)).
0.17/0.52	cnf(i_0_1334, plain, (ssA(n4,n5)=n1)).
0.17/0.52	cnf(i_0_11, plain, (ssA(n6,n6)=n7)).
0.17/0.52	cnf(i_0_1135, plain, (ssA(n1,n9)=n3)).
0.17/0.52	cnf(i_0_289, plain, (ssA(n1,n6)=n5)).
0.17/0.52	cnf(i_0_290, plain, (ssA(n3,n7)=n5)).
0.17/0.52	cnf(i_0_609, plain, (ssA(n4,n3)=n3)).
0.17/0.52	cnf(i_0_437, plain, (ssA(n6,n7)=n3)).
0.17/0.52	cnf(i_0_863, plain, (ssA(n5,n1)=n5)).
0.17/0.52	cnf(i_0_1012, plain, (ssA(n6,n5)=n4)).
0.17/0.52	cnf(i_0_811, plain, (ssA(n9,n1)=n3)).
0.17/0.52	cnf(i_0_280, plain, (ssA(n2,n7)=n4)).
0.17/0.52	cnf(i_0_606, plain, (ssA(n2,n5)=n3)).
0.17/0.52	cnf(i_0_768, plain, (ssA(n2,n6)=n8)).
0.17/0.52	cnf(i_0_1191, plain, (ssA(n4,n4)=n5)).
0.17/0.52	cnf(i_0_564, plain, (ssA(n4,n8)=n4)).
0.17/0.52	cnf(i_0_184, plain, (ssA(n8,n4)=n3)).
0.17/0.52	cnf(i_0_479, plain, (ssA(n3,n1)=n4)).
0.17/0.52	cnf(i_0_1089, plain, (ssA(n2,n1)=n7)).
0.17/0.52	cnf(i_0_182, plain, (ssA(n3,n8)=n7)).
0.17/0.52	cnf(i_0_862, plain, (ssA(n4,n2)=n8)).
0.17/0.52	cnf(i_0_851, plain, (ssA(n8,n9)=n7)).
0.17/0.52	cnf(i_0_433, plain, (ssA(n6,n4)=n8)).
0.17/0.52	cnf(i_0_500, plain, (ssA(n6,n9)=n6)).
0.17/0.52	cnf(i_0_1095, plain, (ssA(n2,n9)=n9)).
0.17/0.52	cnf(i_0_554, plain, (ssA(n4,n9)=n2)).
0.17/0.52	cnf(i_0_2, plain, (ssA(n4,n6)=n9)).
0.17/0.52	cnf(i_0_1199, plain, (ssA(n5,n5)=n2)).
0.17/0.52	cnf(i_0_1147, plain, (ssA(n5,n4)=n6)).
0.17/0.52	cnf(i_0_274, plain, (ssA(n5,n9)=n1)).
0.17/0.52	cnf(i_0_49, plain, (ssA(n9,n8)=n1)).
0.17/0.52	cnf(i_0_514, plain, (ssA(n7,n6)=n1)).
0.17/0.52	cnf(i_0_1201, plain, (ssA(n6,n2)=n1)).
0.17/0.52	cnf(i_0_180, plain, (ssA(n3,n4)=n1)).
0.17/0.52	cnf(i_0_1193, plain, (ssA(n8,n6)=n4)).
0.17/0.52	cnf(i_0_332, plain, (ssA(n7,n9)=n5)).
0.17/0.52	cnf(i_0_908, plain, (ssA(n2,n3)=n1)).
0.17/0.52	cnf(i_0_510, plain, (ssA(n7,n2)=n4)).
0.17/0.52	cnf(i_0_853, plain, (ssA(n9,n6)=n2)).
0.17/0.52	cnf(i_0_1094, plain, (ssA(n3,n5)=n9)).
0.17/0.52	cnf(i_0_186, plain, (ssA(n3,n6)=n6)).
0.17/0.52	cnf(i_0_344, plain, (ssA(n2,n8)=n6)).
0.17/0.52	cnf(i_0_6, plain, (ssA(n3,n3)=n2)).
0.17/0.52	cnf(i_0_871, plain, (ssA(n6,n1)=n2)).
0.17/0.52	cnf(i_0_556, plain, (ssA(n9,n4)=n9)).
0.17/0.52	cnf(i_0_558, plain, (ssA(n6,n3)=n9)).
0.17/0.52	cnf(i_0_283, plain, (ssA(n1,n8)=n2)).
0.17/0.52	cnf(i_0_1134, plain, (ssA(n8,n2)=n2)).
0.17/0.52	cnf(i_0_1088, plain, (ssA(n7,n7)=n2)).
0.17/0.52	cnf(i_0_909, plain, (ssA(n1,n2)=n9)).
0.17/0.52	cnf(i_0_1333, plain, (ssA(n9,n2)=n6)).
0.17/0.52	cnf(i_0_10, plain, (ssA(n7,n1)=n9)).
0.17/0.52	cnf(i_0_604, plain, (ssA(n1,n1)=n8)).
0.17/0.52	cnf(i_0_869, plain, (ssA(n8,n7)=n6)).
0.17/0.52	cnf(i_0_1091, plain, (ssA(n9,n7)=n8)).
0.17/0.52	cnf(i_0_424, plain, (ssA(n8,n8)=n9)).
0.17/0.52	cnf(i_0_485, plain, (ssA(n7,n3)=n8)).
0.17/0.52	cnf(i_0_605, plain, (ssA(n7,n5)=n6)).
0.17/0.52	cnf(i_0_1294, plain, (ssA(n5,n8)=n8)).
0.17/0.52	cnf(i_0_429, plain, (ssA(n1,n3)=n6)).
0.17/0.52	cnf(i_0_766, plain, (ssA(n5,n7)=n9)).
0.17/0.52	cnf(i_0_607, plain, (ssA(n9,n5)=n5)).
0.17/0.52	cnf(i_0_434, plain, (ssA(n8,n3)=n5)).
0.17/0.52	cnf(i_0_343, plain, (ssA(n8,n5)=n8)).
0.17/0.52	cnf(i_0_276, plain, (ssA(n9,n3)=n7)).
0.17/0.52	cnf(i_0_1289, plain, (ssA(n5,n2)=n7)).
0.17/0.52	cnf(i_0_1278, plain, (ssP(n8,n9,n6,n4,n7,n5,n1,n2,n3,n7,n5,n1,n2,n3,n8,n4,n6,n9,n4,n3,n2,n1,n9,n6,n5,n7,n8,n6,n8,n3,n5,n1,n9,n7,n4,n2,n5,n7,n4,n6,n2,n3,n9,n8,n1,n2,n1,n9,n8,n4,n7,n3,n5,n6,n9,n4,n8,n7,n6,n1,n2,n3,n5,n1,n2,n5,n3,n8,n4,n6,n9,n7,n3,n6,n7,n9,n5,n2,n8,n1,n4))).
0.17/0.52	cnf(i_0_194, plain, (n8!=n1)).
0.17/0.52	cnf(i_0_191, plain, (n2!=n1)).
0.17/0.52	cnf(i_0_221, plain, (n8!=n2)).
0.17/0.52	cnf(i_0_226, plain, (n3!=n1)).
0.17/0.52	cnf(i_0_202, plain, (n8!=n3)).
0.17/0.52	cnf(i_0_223, plain, (n2!=n3)).
0.17/0.52	cnf(i_0_225, plain, (n5!=n1)).
0.17/0.52	cnf(i_0_206, plain, (n8!=n5)).
0.17/0.52	cnf(i_0_197, plain, (n2!=n5)).
0.17/0.52	cnf(i_0_200, plain, (n5!=n3)).
0.17/0.52	cnf(i_0_224, plain, (n7!=n1)).
0.17/0.52	cnf(i_0_213, plain, (n8!=n7)).
0.17/0.52	cnf(i_0_222, plain, (n2!=n7)).
0.17/0.52	cnf(i_0_219, plain, (n3!=n7)).
0.17/0.52	cnf(i_0_214, plain, (n5!=n7)).
0.17/0.52	cnf(i_0_195, plain, (n9!=n1)).
0.17/0.52	cnf(i_0_212, plain, (n9!=n8)).
0.17/0.52	cnf(i_0_220, plain, (n9!=n2)).
0.17/0.52	cnf(i_0_218, plain, (n9!=n3)).
0.17/0.52	cnf(i_0_207, plain, (n9!=n5)).
0.17/0.52	cnf(i_0_211, plain, (n9!=n7)).
0.17/0.52	cnf(i_0_193, plain, (n6!=n1)).
0.17/0.52	cnf(i_0_209, plain, (n6!=n8)).
0.17/0.52	cnf(i_0_198, plain, (n6!=n2)).
0.17/0.52	cnf(i_0_201, plain, (n6!=n3)).
0.17/0.52	cnf(i_0_215, plain, (n6!=n5)).
0.17/0.52	cnf(i_0_208, plain, (n6!=n7)).
0.17/0.52	cnf(i_0_210, plain, (n6!=n9)).
0.17/0.52	cnf(i_0_192, plain, (n1!=n4)).
0.17/0.52	cnf(i_0_216, plain, (n8!=n4)).
0.17/0.52	cnf(i_0_196, plain, (n2!=n4)).
0.17/0.52	cnf(i_0_199, plain, (n3!=n4)).
0.17/0.52	cnf(i_0_203, plain, (n5!=n4)).
0.17/0.52	cnf(i_0_217, plain, (n7!=n4)).
0.17/0.52	cnf(i_0_205, plain, (n9!=n4)).
0.17/0.52	cnf(i_0_204, plain, (n6!=n4)).
0.17/0.52	cnf(i_0_1469, plain, (X1=X1)).
0.17/0.52	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.17/0.52	# Begin printing tableau
0.17/0.52	# Found 5 steps
0.17/0.52	cnf(i_0_1469, plain, (n7=n7), inference(start_rule)).
0.17/0.52	cnf(i_0_1593, plain, (n7=n7), inference(extension_rule, [i_0_1473])).
0.17/0.52	cnf(i_0_1603, plain, (ssA(n3,n9)!=n8), inference(closure_rule, [i_0_1344])).
0.17/0.52	cnf(i_0_1601, plain, (ssA(n7,ssA(n3,n9))=ssA(n7,n8)), inference(extension_rule, [i_0_1472])).
0.17/0.52	cnf(i_0_1610, plain, (ssA(n7,n8)!=n3), inference(closure_rule, [i_0_1343])).
0.17/0.52	# End printing tableau
0.17/0.52	# SZS output end
0.17/0.52	# Branches closed with saturation will be marked with an "s"
0.17/0.52	# Child (31710) has found a proof.
0.17/0.52	
0.17/0.52	# Proof search is over...
0.17/0.52	# Freeing feature tree
0.17/0.53	EOF