0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.33	% Computer   : n031.cluster.edu
0.11/0.33	% Model      : x86_64 x86_64
0.11/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory     : 8042.1875MB
0.11/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1200
0.11/0.33	% WCLimit    : 120
0.11/0.33	% DateTime   : Tue Jul 13 11:09:29 EDT 2021
0.11/0.34	% CPUTime    : 
0.11/0.36	# No SInE strategy applied
0.11/0.36	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.11/0.36	# and selection function SelectNewComplexAHP.
0.11/0.36	#
0.11/0.36	# Presaturation interreduction done
0.11/0.36	# Number of axioms: 15 Number of unprocessed: 15
0.11/0.36	# Tableaux proof search.
0.11/0.36	# APR header successfully linked.
0.11/0.36	# Hello from C++
0.11/0.37	# The folding up rule is enabled...
0.11/0.37	# Local unification is enabled...
0.11/0.37	# Any saturation attempts will use folding labels...
0.11/0.37	# 15 beginning clauses after preprocessing and clausification
0.11/0.37	# Creating start rules for all 2 conjectures.
0.11/0.37	# There are 2 start rule candidates:
0.11/0.37	# Found 15 unit axioms.
0.11/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.11/0.37	# 2 start rule tableaux created.
0.11/0.37	# 0 extension rule candidate clauses
0.11/0.37	# 15 unit axiom clauses
0.11/0.37	
0.11/0.37	# Requested 8, 32 cores available to the main process.
0.11/0.37	# There are not enough tableaux to fork, creating more from the initial 2
0.11/0.37	# Creating equality axioms
0.11/0.37	# Ran out of tableaux, making start rules for all clauses
0.11/0.37	# Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
0.11/0.37	# We now have 24 tableaux to operate on
6.04/1.15	# There were 1 total branch saturation attempts.
6.04/1.15	# There were 0 of these attempts blocked.
6.04/1.15	# There were 0 deferred branch saturation attempts.
6.04/1.15	# There were 0 free duplicated saturations.
6.04/1.15	# There were 1 total successful branch saturations.
6.04/1.15	# There were 0 successful branch saturations in interreduction.
6.04/1.15	# There were 0 successful branch saturations on the branch.
6.04/1.15	# There were 1 successful branch saturations after the branch.
6.04/1.15	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
6.04/1.15	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
6.04/1.15	# Begin clausification derivation
6.04/1.15	
6.04/1.15	# End clausification derivation
6.04/1.15	# Begin listing active clauses obtained from FOF to CNF conversion
6.04/1.15	cnf(i_0_28, plain, (converse(converse(X1))=X1)).
6.04/1.15	cnf(i_0_25, plain, (composition(X1,one)=X1)).
6.04/1.15	cnf(i_0_20, plain, (join(X1,complement(X1))=top)).
6.04/1.15	cnf(i_0_19, plain, (meet(X1,complement(X1))=zero)).
6.04/1.15	cnf(i_0_29, negated_conjecture, (join(one,sk1)=one)).
6.04/1.15	cnf(i_0_21, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
6.04/1.15	cnf(i_0_23, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
6.04/1.15	cnf(i_0_24, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
6.04/1.15	cnf(i_0_26, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
6.04/1.15	cnf(i_0_18, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
6.04/1.15	cnf(i_0_17, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
6.04/1.15	cnf(i_0_27, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
6.04/1.15	cnf(i_0_16, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
6.04/1.15	cnf(i_0_22, plain, (join(X1,X2)=join(X2,X1))).
6.04/1.15	cnf(i_0_30, negated_conjecture, (converse(sk1)!=sk1)).
6.04/1.15	cnf(i_0_33, plain, (X4=X4)).
6.04/1.15	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
6.04/1.15	# Begin printing tableau
6.04/1.15	# Found 6 steps
6.04/1.15	cnf(i_0_28, plain, (converse(converse(X5))=X5), inference(start_rule)).
6.04/1.15	cnf(i_0_42, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_38])).
6.04/1.15	cnf(i_0_68, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_28])).
6.04/1.15	cnf(i_0_67, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_36])).
6.04/1.15	cnf(i_0_84, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_28])).
6.04/1.15	cnf(i_0_82, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_82, ...])).
6.04/1.15	# End printing tableau
6.04/1.15	# SZS output end
6.04/1.15	# Branches closed with saturation will be marked with an "s"
6.04/1.16	# Child (6090) has found a proof.
6.04/1.16	
6.04/1.16	# Proof search is over...
6.04/1.16	# Freeing feature tree
6.04/1.17	EOF