0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.30	Computer   : n005.cluster.edu
0.10/0.30	Model      : x86_64 x86_64
0.10/0.30	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	RAMPerCPU  : 8042.1875MB
0.10/0.30	OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 960
0.10/0.31	% WCLimit    : 120
0.10/0.31	% DateTime   : Tue Aug  9 04:42:04 EDT 2022
0.10/0.31	% CPUTime    : 
0.15/0.33	# No SInE strategy applied
0.15/0.33	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.15/0.33	# and selection function SelectNewComplexAHP.
0.15/0.33	#
0.15/0.33	# Presaturation interreduction done
0.15/0.33	# Number of axioms: 15 Number of unprocessed: 15
0.15/0.33	# Tableaux proof search.
0.15/0.33	# APR header successfully linked.
0.15/0.33	# Hello from C++
0.15/0.34	# The folding up rule is enabled...
0.15/0.34	# Local unification is enabled...
0.15/0.34	# Any saturation attempts will use folding labels...
0.15/0.34	# 15 beginning clauses after preprocessing and clausification
0.15/0.34	# Creating start rules for all 2 conjectures.
0.15/0.34	# There are 2 start rule candidates:
0.15/0.34	# Found 15 unit axioms.
0.15/0.34	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.15/0.34	# 2 start rule tableaux created.
0.15/0.34	# 0 extension rule candidate clauses
0.15/0.34	# 15 unit axiom clauses
0.15/0.34	
0.15/0.34	# Requested 8, 32 cores available to the main process.
0.15/0.34	# There are not enough tableaux to fork, creating more from the initial 2
0.15/0.34	# Creating equality axioms
0.15/0.34	# Ran out of tableaux, making start rules for all clauses
0.15/0.34	# Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
0.15/0.34	# We now have 24 tableaux to operate on
7.42/1.28	# There were 1 total branch saturation attempts.
7.42/1.28	# There were 0 of these attempts blocked.
7.42/1.28	# There were 0 deferred branch saturation attempts.
7.42/1.28	# There were 0 free duplicated saturations.
7.42/1.28	# There were 1 total successful branch saturations.
7.42/1.28	# There were 0 successful branch saturations in interreduction.
7.42/1.28	# There were 0 successful branch saturations on the branch.
7.42/1.28	# There were 1 successful branch saturations after the branch.
7.42/1.28	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
7.42/1.28	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
7.42/1.28	# Begin clausification derivation
7.42/1.28	
7.42/1.28	# End clausification derivation
7.42/1.28	# Begin listing active clauses obtained from FOF to CNF conversion
7.42/1.28	cnf(i_0_3, plain, (converse(converse(X1))=X1)).
7.42/1.28	cnf(i_0_8, plain, (composition(X1,one)=X1)).
7.42/1.28	cnf(i_0_6, plain, (join(X1,complement(X1))=top)).
7.42/1.28	cnf(i_0_4, plain, (meet(X1,complement(X1))=zero)).
7.42/1.28	cnf(i_0_15, negated_conjecture, (join(one,esk1_0)=one)).
7.42/1.28	cnf(i_0_2, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
7.42/1.28	cnf(i_0_1, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
7.42/1.28	cnf(i_0_7, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
7.42/1.28	cnf(i_0_10, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
7.42/1.28	cnf(i_0_9, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
7.42/1.28	cnf(i_0_12, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
7.42/1.28	cnf(i_0_13, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
7.42/1.28	cnf(i_0_11, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
7.42/1.28	cnf(i_0_5, plain, (join(X1,X2)=join(X2,X1))).
7.42/1.28	cnf(i_0_14, negated_conjecture, (converse(esk1_0)!=esk1_0)).
7.42/1.28	cnf(i_0_18, plain, (X30=X30)).
7.42/1.28	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
7.42/1.28	# Begin printing tableau
7.42/1.28	# Found 5 steps
7.42/1.28	cnf(i_0_3, plain, (converse(converse(X3))=X3), inference(start_rule)).
7.42/1.28	cnf(i_0_27, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_25])).
7.42/1.28	cnf(i_0_58, plain, (complement(converse(converse(X3)))=complement(X3)), inference(extension_rule, [i_0_21])).
7.42/1.28	cnf(i_0_69, plain, (complement(X3)!=converse(converse(complement(X3)))), inference(closure_rule, [i_0_3])).
7.42/1.28	cnf(i_0_67, plain, (complement(converse(converse(X3)))=converse(converse(complement(X3)))), inference(etableau_closure_rule, [i_0_67, ...])).
7.42/1.28	# End printing tableau
7.42/1.28	# SZS output end
7.42/1.28	# Branches closed with saturation will be marked with an "s"
7.42/1.29	# Child (8804) has found a proof.
7.42/1.29	
7.42/1.29	# Proof search is over...
7.42/1.29	# Freeing feature tree
7.42/1.31	EOF