0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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   : n010.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 13:14:21 EDT 2021
0.12/0.33	% CPUTime    : 
0.18/0.36	# No SInE strategy applied
0.18/0.36	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.18/0.36	# and selection function SelectNewComplexAHP.
0.18/0.36	#
0.18/0.36	# Presaturation interreduction done
0.18/0.36	# Number of axioms: 19 Number of unprocessed: 19
0.18/0.36	# Tableaux proof search.
0.18/0.36	# APR header successfully linked.
0.18/0.36	# Hello from C++
0.18/0.36	# The folding up rule is enabled...
0.18/0.36	# Local unification is enabled...
0.18/0.36	# Any saturation attempts will use folding labels...
0.18/0.36	# 19 beginning clauses after preprocessing and clausification
0.18/0.36	# Creating start rules for all 3 conjectures.
0.18/0.36	# There are 3 start rule candidates:
0.18/0.36	# Found 19 unit axioms.
0.18/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.18/0.36	# 3 start rule tableaux created.
0.18/0.36	# 0 extension rule candidate clauses
0.18/0.36	# 19 unit axiom clauses
0.18/0.36	
0.18/0.36	# Requested 8, 32 cores available to the main process.
0.18/0.36	# There are not enough tableaux to fork, creating more from the initial 3
0.18/0.36	# Creating equality axioms
0.18/0.36	# Ran out of tableaux, making start rules for all clauses
0.18/0.36	# Returning from population with 30 new_tableaux and 0 remaining starting tableaux.
0.18/0.36	# We now have 30 tableaux to operate on
15.06/2.28	# There were 1 total branch saturation attempts.
15.06/2.28	# There were 0 of these attempts blocked.
15.06/2.28	# There were 0 deferred branch saturation attempts.
15.06/2.28	# There were 0 free duplicated saturations.
15.06/2.28	# There were 1 total successful branch saturations.
15.06/2.28	# There were 0 successful branch saturations in interreduction.
15.06/2.28	# There were 0 successful branch saturations on the branch.
15.06/2.28	# There were 1 successful branch saturations after the branch.
15.06/2.28	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
15.06/2.28	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
15.06/2.28	# Begin clausification derivation
15.06/2.28	
15.06/2.28	# End clausification derivation
15.06/2.28	# Begin listing active clauses obtained from FOF to CNF conversion
15.06/2.28	cnf(i_0_21, plain, (converse(converse(X1))=X1)).
15.06/2.28	cnf(i_0_37, negated_conjecture, (join(sk1,one)=one)).
15.06/2.28	cnf(i_0_35, negated_conjecture, (join(sk2,one)=one)).
15.06/2.28	cnf(i_0_24, plain, (composition(X1,one)=X1)).
15.06/2.28	cnf(i_0_28, plain, (meet(X1,complement(X1))=zero)).
15.06/2.28	cnf(i_0_23, plain, (join(X1,complement(X1))=top)).
15.06/2.28	cnf(i_0_30, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
15.06/2.28	cnf(i_0_20, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
15.06/2.28	cnf(i_0_32, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
15.06/2.28	cnf(i_0_31, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
15.06/2.28	cnf(i_0_36, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
15.06/2.28	cnf(i_0_33, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
15.06/2.28	cnf(i_0_22, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
15.06/2.28	cnf(i_0_38, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
15.06/2.28	cnf(i_0_26, 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))).
15.06/2.28	cnf(i_0_29, 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))).
15.06/2.28	cnf(i_0_34, 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))))).
15.06/2.28	cnf(i_0_27, plain, (join(X1,X2)=join(X2,X1))).
15.06/2.28	cnf(i_0_25, negated_conjecture, (tuple(join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))),join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))!=tuple(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))).
15.06/2.28	cnf(i_0_42, plain, (X4=X4)).
15.06/2.28	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
15.06/2.28	# Begin printing tableau
15.06/2.28	# Found 6 steps
15.06/2.28	cnf(i_0_21, plain, (converse(converse(X3))=X3), inference(start_rule)).
15.06/2.28	cnf(i_0_52, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_49])).
15.06/2.28	cnf(i_0_88, plain, (converse(converse(X5))!=X5), inference(closure_rule, [i_0_21])).
15.06/2.28	cnf(i_0_86, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_45])).
15.06/2.28	cnf(i_0_101, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_21])).
15.06/2.28	cnf(i_0_99, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_99, ...])).
15.06/2.28	# End printing tableau
15.06/2.28	# SZS output end
15.06/2.28	# Branches closed with saturation will be marked with an "s"
15.06/2.29	# There were 1 total branch saturation attempts.
15.06/2.29	# There were 0 of these attempts blocked.
15.06/2.29	# There were 0 deferred branch saturation attempts.
15.06/2.29	# There were 0 free duplicated saturations.
15.06/2.29	# There were 1 total successful branch saturations.
15.06/2.29	# There were 0 successful branch saturations in interreduction.
15.06/2.29	# There were 0 successful branch saturations on the branch.
15.06/2.29	# There were 1 successful branch saturations after the branch.
15.06/2.29	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
15.06/2.29	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
15.06/2.29	# Begin clausification derivation
15.06/2.29	
15.06/2.29	# End clausification derivation
15.06/2.29	# Begin listing active clauses obtained from FOF to CNF conversion
15.06/2.29	cnf(i_0_21, plain, (converse(converse(X1))=X1)).
15.06/2.29	cnf(i_0_37, negated_conjecture, (join(sk1,one)=one)).
15.06/2.29	cnf(i_0_35, negated_conjecture, (join(sk2,one)=one)).
15.06/2.29	cnf(i_0_24, plain, (composition(X1,one)=X1)).
15.06/2.29	cnf(i_0_28, plain, (meet(X1,complement(X1))=zero)).
15.06/2.29	cnf(i_0_23, plain, (join(X1,complement(X1))=top)).
15.06/2.29	cnf(i_0_30, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
15.06/2.29	cnf(i_0_20, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
15.06/2.29	cnf(i_0_32, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
15.06/2.29	cnf(i_0_31, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
15.06/2.29	cnf(i_0_36, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
15.06/2.29	cnf(i_0_33, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
15.06/2.29	cnf(i_0_22, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
15.06/2.29	cnf(i_0_38, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
15.06/2.29	cnf(i_0_26, 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))).
15.06/2.29	cnf(i_0_29, 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))).
15.06/2.29	cnf(i_0_34, 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))))).
15.06/2.29	cnf(i_0_27, plain, (join(X1,X2)=join(X2,X1))).
15.06/2.29	cnf(i_0_25, negated_conjecture, (tuple(join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))),join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))!=tuple(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))).
15.06/2.29	cnf(i_0_42, plain, (X4=X4)).
15.06/2.29	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
15.06/2.29	# Begin printing tableau
15.06/2.29	# Found 6 steps
15.06/2.29	cnf(i_0_21, plain, (converse(converse(X5))=X5), inference(start_rule)).
15.06/2.29	cnf(i_0_52, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_49])).
15.06/2.29	cnf(i_0_87, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_21])).
15.06/2.29	cnf(i_0_86, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_45])).
15.06/2.29	cnf(i_0_101, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_21])).
15.06/2.29	cnf(i_0_99, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_99, ...])).
15.06/2.29	# End printing tableau
15.06/2.29	# SZS output end
15.06/2.29	# Branches closed with saturation will be marked with an "s"
15.06/2.29	# There were 1 total branch saturation attempts.
15.06/2.29	# There were 0 of these attempts blocked.
15.06/2.29	# There were 0 deferred branch saturation attempts.
15.06/2.29	# There were 0 free duplicated saturations.
15.06/2.29	# There were 1 total successful branch saturations.
15.06/2.29	# There were 0 successful branch saturations in interreduction.
15.06/2.29	# There were 0 successful branch saturations on the branch.
15.06/2.29	# There were 1 successful branch saturations after the branch.
15.06/2.29	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
15.06/2.29	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
15.06/2.29	# Begin clausification derivation
15.06/2.29	
15.06/2.29	# End clausification derivation
15.06/2.29	# Begin listing active clauses obtained from FOF to CNF conversion
15.06/2.29	cnf(i_0_21, plain, (converse(converse(X1))=X1)).
15.06/2.29	cnf(i_0_37, negated_conjecture, (join(sk1,one)=one)).
15.06/2.29	cnf(i_0_35, negated_conjecture, (join(sk2,one)=one)).
15.06/2.29	cnf(i_0_24, plain, (composition(X1,one)=X1)).
15.06/2.29	cnf(i_0_28, plain, (meet(X1,complement(X1))=zero)).
15.06/2.29	cnf(i_0_23, plain, (join(X1,complement(X1))=top)).
15.06/2.29	cnf(i_0_30, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
15.06/2.29	cnf(i_0_20, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
15.06/2.29	cnf(i_0_32, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
15.06/2.29	cnf(i_0_31, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
15.06/2.29	cnf(i_0_36, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
15.06/2.29	cnf(i_0_33, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
15.06/2.29	cnf(i_0_22, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
15.06/2.29	cnf(i_0_38, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
15.06/2.29	cnf(i_0_26, 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))).
15.06/2.29	cnf(i_0_29, 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))).
15.06/2.29	cnf(i_0_34, 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))))).
15.06/2.29	cnf(i_0_27, plain, (join(X1,X2)=join(X2,X1))).
15.06/2.29	cnf(i_0_25, negated_conjecture, (tuple(join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))),join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))!=tuple(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))).
15.06/2.29	cnf(i_0_42, plain, (X4=X4)).
15.06/2.29	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
15.06/2.29	# Begin printing tableau
15.06/2.29	# Found 6 steps
15.06/2.29	cnf(i_0_21, plain, (converse(converse(X3))=X3), inference(start_rule)).
15.06/2.29	cnf(i_0_52, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_51])).
15.06/2.29	cnf(i_0_94, plain, (converse(converse(X5))!=X5), inference(closure_rule, [i_0_21])).
15.06/2.29	cnf(i_0_92, plain, (tuple(converse(converse(X3)),converse(converse(X5)))=tuple(X3,X5)), inference(extension_rule, [i_0_45])).
15.06/2.29	cnf(i_0_101, plain, (tuple(X3,X5)!=converse(converse(tuple(X3,X5)))), inference(closure_rule, [i_0_21])).
15.06/2.29	cnf(i_0_99, plain, (tuple(converse(converse(X3)),converse(converse(X5)))=converse(converse(tuple(X3,X5)))), inference(etableau_closure_rule, [i_0_99, ...])).
15.06/2.29	# End printing tableau
15.06/2.29	# SZS output end
15.06/2.29	# Branches closed with saturation will be marked with an "s"
15.06/2.30	# Child (22039) has found a proof.
15.06/2.30	
15.06/2.30	# Proof search is over...
15.06/2.30	# Freeing feature tree
15.06/2.32	EOF