0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	RAMPerCPU  : 8042.1875MB
0.13/0.34	OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 05:04:26 EDT 2022
0.13/0.34	% 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: 13 Number of unprocessed: 13
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.37	# The folding up rule is enabled...
0.13/0.37	# Local unification is enabled...
0.13/0.37	# Any saturation attempts will use folding labels...
0.13/0.37	# 13 beginning clauses after preprocessing and clausification
0.13/0.37	# Creating start rules for all 1 conjectures.
0.13/0.37	# There are 1 start rule candidates:
0.13/0.37	# Found 4 unit axioms.
0.13/0.37	# 1 start rule tableaux created.
0.13/0.37	# 9 extension rule candidate clauses
0.13/0.37	# 4 unit axiom clauses
0.13/0.37	
0.13/0.37	# Requested 8, 32 cores available to the main process.
0.13/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.37	# Creating equality axioms
0.13/0.37	# Ran out of tableaux, making start rules for all clauses
0.13/0.37	# Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
0.13/0.37	# We now have 22 tableaux to operate on
0.19/0.44	# There were 2 total branch saturation attempts.
0.19/0.44	# There were 0 of these attempts blocked.
0.19/0.44	# There were 0 deferred branch saturation attempts.
0.19/0.44	# There were 0 free duplicated saturations.
0.19/0.44	# There were 2 total successful branch saturations.
0.19/0.44	# There were 0 successful branch saturations in interreduction.
0.19/0.44	# There were 0 successful branch saturations on the branch.
0.19/0.44	# There were 2 successful branch saturations after the branch.
0.19/0.44	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.44	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.44	# Begin clausification derivation
0.19/0.44	
0.19/0.44	# End clausification derivation
0.19/0.44	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.44	cnf(i_0_5, plain, (transitive_reflexive_rewrite(a,c))).
0.19/0.44	cnf(i_0_4, plain, (transitive_reflexive_rewrite(a,b))).
0.19/0.44	cnf(i_0_7, plain, (transitive_reflexive_rewrite(X1,X1))).
0.19/0.44	cnf(i_0_2, negated_conjecture, (~goal)).
0.19/0.44	cnf(i_0_6, plain, (~transitive_reflexive_rewrite(c,X1)|~transitive_reflexive_rewrite(b,X1))).
0.19/0.44	cnf(i_0_3, plain, (transitive_reflexive_rewrite(X1,X2)|~rewrite(X1,X2))).
0.19/0.44	cnf(i_0_1, plain, (transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X3,X2)|~transitive_reflexive_rewrite(X1,X3))).
0.19/0.44	cnf(i_0_13, plain, (X1=X2|rewrite(X1,esk3_2(X1,X2))|~transitive_reflexive_rewrite(X1,X2))).
0.19/0.44	cnf(i_0_12, plain, (X1=X2|transitive_reflexive_rewrite(esk3_2(X1,X2),X2)|~transitive_reflexive_rewrite(X1,X2))).
0.19/0.44	cnf(i_0_8, plain, (transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X1))|~rewrite(X2,X3)|~rewrite(X2,X1))).
0.19/0.44	cnf(i_0_9, plain, (transitive_reflexive_rewrite(X1,esk1_3(X2,X1,X3))|~rewrite(X2,X3)|~rewrite(X2,X1))).
0.19/0.44	cnf(i_0_11, plain, (transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X1))|~rewrite(a,X2)|~transitive_reflexive_rewrite(X2,X3)|~transitive_reflexive_rewrite(X2,X1))).
0.19/0.44	cnf(i_0_10, plain, (transitive_reflexive_rewrite(X1,esk2_3(X2,X1,X3))|~rewrite(a,X2)|~transitive_reflexive_rewrite(X2,X3)|~transitive_reflexive_rewrite(X2,X1))).
0.19/0.44	cnf(i_0_43, plain, (X24=X24)).
0.19/0.44	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.44	# Begin printing tableau
0.19/0.44	# Found 6 steps
0.19/0.44	cnf(i_0_5, plain, (transitive_reflexive_rewrite(a,c)), inference(start_rule)).
0.19/0.44	cnf(i_0_49, plain, (transitive_reflexive_rewrite(a,c)), inference(extension_rule, [i_0_10])).
0.19/0.44	cnf(i_0_107, plain, (~transitive_reflexive_rewrite(a,c)), inference(closure_rule, [i_0_5])).
0.19/0.44	cnf(i_0_104, plain, (transitive_reflexive_rewrite(c,esk2_3(a,c,c))), inference(extension_rule, [i_0_6])).
0.19/0.44	cnf(i_0_105, plain, (~rewrite(a,a)), inference(etableau_closure_rule, [i_0_105, ...])).
0.19/0.44	cnf(i_0_124, plain, (~transitive_reflexive_rewrite(b,esk2_3(a,c,c))), inference(etableau_closure_rule, [i_0_124, ...])).
0.19/0.44	# End printing tableau
0.19/0.44	# SZS output end
0.19/0.44	# Branches closed with saturation will be marked with an "s"
0.19/0.45	# Child (13103) has found a proof.
0.19/0.45	
0.19/0.45	# Proof search is over...
0.19/0.45	# Freeing feature tree
0.19/0.45	EOF