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