0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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   : n020.cluster.edu
0.12/0.33	Model      : x86_64 x86_64
0.12/0.33	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	RAMPerCPU  : 8042.1875MB
0.12/0.33	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Aug  9 03:01:20 EDT 2022
0.12/0.33	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.12/0.36	# and selection function SelectNewComplexAHP.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 14 Number of unprocessed: 14
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# Hello from C++
0.12/0.37	# The folding up rule is enabled...
0.12/0.37	# Local unification is enabled...
0.12/0.37	# Any saturation attempts will use folding labels...
0.12/0.37	# 14 beginning clauses after preprocessing and clausification
0.12/0.37	# Creating start rules for all 1 conjectures.
0.12/0.37	# There are 1 start rule candidates:
0.12/0.37	# Found 14 unit axioms.
0.12/0.37	# 1 start rule tableaux created.
0.12/0.37	# 0 extension rule candidate clauses
0.12/0.37	# 14 unit axiom clauses
0.12/0.37	
0.12/0.37	# Requested 8, 32 cores available to the main process.
0.12/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.37	# Creating equality axioms
0.12/0.37	# Ran out of tableaux, making start rules for all clauses
0.12/0.37	# Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
0.12/0.37	# We now have 23 tableaux to operate on
8.07/1.40	# There were 1 total branch saturation attempts.
8.07/1.40	# There were 0 of these attempts blocked.
8.07/1.40	# There were 0 deferred branch saturation attempts.
8.07/1.40	# There were 0 free duplicated saturations.
8.07/1.40	# There were 1 total successful branch saturations.
8.07/1.40	# There were 0 successful branch saturations in interreduction.
8.07/1.40	# There were 0 successful branch saturations on the branch.
8.07/1.40	# There were 1 successful branch saturations after the branch.
8.07/1.40	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
8.07/1.40	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
8.07/1.40	# Begin clausification derivation
8.07/1.40	
8.07/1.40	# End clausification derivation
8.07/1.40	# Begin listing active clauses obtained from FOF to CNF conversion
8.07/1.40	cnf(i_0_3, plain, (converse(converse(X1))=X1)).
8.07/1.40	cnf(i_0_8, plain, (composition(X1,one)=X1)).
8.07/1.40	cnf(i_0_6, plain, (join(X1,complement(X1))=top)).
8.07/1.40	cnf(i_0_4, plain, (meet(X1,complement(X1))=zero)).
8.07/1.40	cnf(i_0_2, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
8.07/1.40	cnf(i_0_1, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
8.07/1.40	cnf(i_0_9, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
8.07/1.40	cnf(i_0_7, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
8.07/1.40	cnf(i_0_10, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
8.07/1.40	cnf(i_0_12, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
8.07/1.40	cnf(i_0_13, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
8.07/1.40	cnf(i_0_11, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
8.07/1.40	cnf(i_0_5, plain, (join(X1,X2)=join(X2,X1))).
8.07/1.40	cnf(i_0_14, negated_conjecture, (composition(complement(composition(esk1_0,top)),top)!=complement(composition(esk1_0,top)))).
8.07/1.40	cnf(i_0_16, plain, (X30=X30)).
8.07/1.40	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
8.07/1.40	# Begin printing tableau
8.07/1.40	# Found 5 steps
8.07/1.40	cnf(i_0_3, plain, (converse(converse(X3))=X3), inference(start_rule)).
8.07/1.40	cnf(i_0_25, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_23])).
8.07/1.40	cnf(i_0_55, plain, (complement(converse(converse(X3)))=complement(X3)), inference(extension_rule, [i_0_19])).
8.07/1.40	cnf(i_0_66, plain, (complement(X3)!=converse(converse(complement(X3)))), inference(closure_rule, [i_0_3])).
8.07/1.40	cnf(i_0_64, plain, (complement(converse(converse(X3)))=converse(converse(complement(X3)))), inference(etableau_closure_rule, [i_0_64, ...])).
8.07/1.40	# End printing tableau
8.07/1.40	# SZS output end
8.07/1.40	# Branches closed with saturation will be marked with an "s"
8.07/1.41	# Child (14646) has found a proof.
8.07/1.41	
8.07/1.41	# Proof search is over...
8.07/1.41	# Freeing feature tree
8.07/1.42	EOF