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