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