0.08/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.14/0.36	% Computer   : n027.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 15:27:10 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.39	# No SInE strategy applied
0.14/0.39	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.14/0.39	# and selection function PSelectComplexExceptUniqMaxHorn.
0.14/0.39	#
0.14/0.39	# Number of axioms: 10 Number of unprocessed: 10
0.14/0.39	# Tableaux proof search.
0.14/0.39	# APR header successfully linked.
0.14/0.39	# Hello from C++
0.14/0.39	# The folding up rule is enabled...
0.14/0.39	# Local unification is enabled...
0.14/0.39	# Any saturation attempts will use folding labels...
0.14/0.39	# 10 beginning clauses after preprocessing and clausification
0.14/0.39	# Creating start rules for all 1 conjectures.
0.14/0.39	# There are 1 start rule candidates:
0.14/0.39	# Found 10 unit axioms.
0.14/0.39	# 1 start rule tableaux created.
0.14/0.39	# 0 extension rule candidate clauses
0.14/0.39	# 10 unit axiom clauses
0.14/0.39	
0.14/0.39	# Requested 8, 32 cores available to the main process.
0.14/0.39	# There are not enough tableaux to fork, creating more from the initial 1
0.14/0.39	# Creating equality axioms
0.14/0.39	# Ran out of tableaux, making start rules for all clauses
0.14/0.39	# Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
0.14/0.39	# We now have 15 tableaux to operate on
240.10/33.21	# There were 1 total branch saturation attempts.
240.10/33.21	# There were 0 of these attempts blocked.
240.10/33.21	# There were 0 deferred branch saturation attempts.
240.10/33.21	# There were 0 free duplicated saturations.
240.10/33.21	# There were 1 total successful branch saturations.
240.10/33.21	# There were 0 successful branch saturations in interreduction.
240.10/33.21	# There were 0 successful branch saturations on the branch.
240.10/33.21	# There were 1 successful branch saturations after the branch.
240.10/33.21	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
240.10/33.21	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
240.10/33.21	# Begin clausification derivation
240.10/33.21	
240.10/33.21	# End clausification derivation
240.10/33.21	# Begin listing active clauses obtained from FOF to CNF conversion
240.10/33.21	cnf(i_0_13, plain, (meet(X1,X1)=X1)).
240.10/33.21	cnf(i_0_12, plain, (join(X1,X1)=X1)).
240.10/33.21	cnf(i_0_15, plain, (meet(X1,X2)=meet(X2,X1))).
240.10/33.21	cnf(i_0_14, plain, (join(X1,X2)=join(X2,X1))).
240.10/33.21	cnf(i_0_11, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
240.10/33.21	cnf(i_0_17, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
240.10/33.21	cnf(i_0_19, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,c)))).
240.10/33.21	cnf(i_0_16, plain, (meet(join(X1,meet(X2,X3)),join(X1,X2))=join(X1,meet(X2,X3)))).
240.10/33.21	cnf(i_0_18, plain, (join(meet(X1,join(X2,X3)),meet(X1,X2))=meet(X1,join(X2,X3)))).
240.10/33.21	cnf(i_0_20, hypothesis, (meet(join(meet(join(X1,X2),X3),X2),join(X3,X1))=join(meet(join(meet(X1,X2),X3),X2),meet(X3,X1)))).
240.10/33.21	cnf(i_0_22, plain, (X4=X4)).
240.10/33.21	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
240.10/33.21	# Begin printing tableau
240.10/33.21	# Found 6 steps
240.10/33.21	cnf(i_0_13, plain, (meet(meet(a,join(b,c)),meet(a,join(b,c)))=meet(a,join(b,c))), inference(start_rule)).
240.10/33.21	cnf(i_0_28, plain, (meet(meet(a,join(b,c)),meet(a,join(b,c)))=meet(a,join(b,c))), inference(extension_rule, [i_0_25])).
240.10/33.21	cnf(i_0_43, plain, (join(meet(a,b),meet(a,c))=meet(a,join(b,c))), inference(closure_rule, [i_0_19])).
240.10/33.21	cnf(i_0_44, plain, (join(meet(a,b),meet(a,c))!=meet(meet(a,join(b,c)),meet(a,join(b,c)))), inference(extension_rule, [i_0_25])).
240.10/33.21	cnf(i_0_57, plain, (join(meet(a,b),meet(a,c))!=meet(join(meet(a,b),meet(a,c)),join(meet(a,b),meet(a,c)))), inference(closure_rule, [i_0_13])).
240.10/33.21	cnf(i_0_58, plain, (meet(join(meet(a,b),meet(a,c)),join(meet(a,b),meet(a,c)))!=meet(meet(a,join(b,c)),meet(a,join(b,c)))), inference(etableau_closure_rule, [i_0_58, ...])).
240.10/33.21	# End printing tableau
240.10/33.21	# SZS output end
240.10/33.21	# Branches closed with saturation will be marked with an "s"
241.27/33.34	# Child (1541) has found a proof.
241.27/33.34	
241.27/33.34	# Proof search is over...
241.27/33.34	# Freeing feature tree
241.27/33.62	EOF