0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/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 11:46:06 EDT 2021
0.12/0.33	% CPUTime    : 
0.19/0.36	# No SInE strategy applied
0.19/0.36	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.19/0.36	# and selection function PSelectComplexExceptUniqMaxHorn.
0.19/0.36	#
0.19/0.36	# Number of axioms: 15 Number of unprocessed: 15
0.19/0.36	# Tableaux proof search.
0.19/0.36	# APR header successfully linked.
0.19/0.36	# Hello from C++
0.19/0.36	# The folding up rule is enabled...
0.19/0.36	# Local unification is enabled...
0.19/0.36	# Any saturation attempts will use folding labels...
0.19/0.36	# 15 beginning clauses after preprocessing and clausification
0.19/0.36	# Creating start rules for all 1 conjectures.
0.19/0.36	# There are 1 start rule candidates:
0.19/0.36	# Found 15 unit axioms.
0.19/0.36	# 1 start rule tableaux created.
0.19/0.36	# 0 extension rule candidate clauses
0.19/0.36	# 15 unit axiom clauses
0.19/0.36	
0.19/0.36	# Requested 8, 32 cores available to the main process.
0.19/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.19/0.36	# Creating equality axioms
0.19/0.36	# Ran out of tableaux, making start rules for all clauses
0.19/0.36	# Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
0.19/0.36	# We now have 26 tableaux to operate on
0.19/0.45	# There were 1 total branch saturation attempts.
0.19/0.45	# There were 0 of these attempts blocked.
0.19/0.45	# There were 0 deferred branch saturation attempts.
0.19/0.45	# There were 0 free duplicated saturations.
0.19/0.45	# There were 1 total successful branch saturations.
0.19/0.45	# There were 0 successful branch saturations in interreduction.
0.19/0.45	# There were 0 successful branch saturations on the branch.
0.19/0.45	# There were 1 successful branch saturations after the branch.
0.19/0.45	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.45	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.45	# Begin clausification derivation
0.19/0.45	
0.19/0.45	# End clausification derivation
0.19/0.45	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.45	cnf(i_0_25, hypothesis, (meet(b,a)=a)).
0.19/0.45	cnf(i_0_17, plain, (meet(X1,X1)=X1)).
0.19/0.45	cnf(i_0_24, plain, (join(X1,X1)=X1)).
0.19/0.45	cnf(i_0_16, plain, (join(X1,complement(X1))=one)).
0.19/0.45	cnf(i_0_28, plain, (meet(X1,complement(X1))=zero)).
0.19/0.45	cnf(i_0_22, plain, (join(X1,X2)=join(X2,X1))).
0.19/0.45	cnf(i_0_20, plain, (meet(X1,X2)=meet(X2,X1))).
0.19/0.45	cnf(i_0_27, negated_conjecture, (join(complement(b),complement(a))!=complement(a))).
0.19/0.45	cnf(i_0_29, plain, (join(X1,meet(X1,X2))=X1)).
0.19/0.45	cnf(i_0_19, plain, (meet(X1,join(X1,X2))=X1)).
0.19/0.45	cnf(i_0_30, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
0.19/0.45	cnf(i_0_18, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
0.19/0.45	cnf(i_0_23, plain, (ifeq(X2,X2,X1,X3)=X1)).
0.19/0.45	cnf(i_0_21, plain, (meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))).
0.19/0.45	cnf(i_0_26, plain, (ifeq(join(X2,X1),one,ifeq(meet(X2,X1),zero,complement(X2),X1),X1)=X1)).
0.19/0.45	cnf(i_0_32, plain, (X5=X5)).
0.19/0.45	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.45	# Begin printing tableau
0.19/0.45	# Found 6 steps
0.19/0.45	cnf(i_0_25, hypothesis, (meet(b,a)=a), inference(start_rule)).
0.19/0.45	cnf(i_0_40, plain, (meet(b,a)=a), inference(extension_rule, [i_0_38])).
0.19/0.45	cnf(i_0_69, plain, (meet(b,a)!=a), inference(closure_rule, [i_0_25])).
0.19/0.45	cnf(i_0_68, plain, (meet(meet(b,a),meet(b,a))=meet(a,a)), inference(extension_rule, [i_0_35])).
0.19/0.45	cnf(i_0_82, plain, (meet(a,a)!=a), inference(closure_rule, [i_0_17])).
0.19/0.45	cnf(i_0_80, plain, (meet(meet(b,a),meet(b,a))=a), inference(etableau_closure_rule, [i_0_80, ...])).
0.19/0.45	# End printing tableau
0.19/0.45	# SZS output end
0.19/0.45	# Branches closed with saturation will be marked with an "s"
0.19/0.45	# Child (26504) has found a proof.
0.19/0.45	
0.19/0.45	# Proof search is over...
0.19/0.45	# Freeing feature tree
0.19/0.45	EOF