0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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 14:49:36 EDT 2021
0.12/0.33	% CPUTime    : 
0.18/0.36	# No SInE strategy applied
0.18/0.36	# Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_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: 14 Number of unprocessed: 14
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	# 14 beginning clauses after preprocessing and clausification
0.18/0.36	# Creating start rules for all 1 conjectures.
0.18/0.36	# There are 1 start rule candidates:
0.18/0.36	# Found 14 unit axioms.
0.18/0.36	# 1 start rule tableaux created.
0.18/0.36	# 0 extension rule candidate clauses
0.18/0.36	# 14 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 1
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 25 new_tableaux and 0 remaining starting tableaux.
0.18/0.36	# We now have 25 tableaux to operate on
10.66/1.73	# There were 1 total branch saturation attempts.
10.66/1.73	# There were 0 of these attempts blocked.
10.66/1.73	# There were 0 deferred branch saturation attempts.
10.66/1.73	# There were 0 free duplicated saturations.
10.66/1.73	# There were 1 total successful branch saturations.
10.66/1.73	# There were 0 successful branch saturations in interreduction.
10.66/1.73	# There were 0 successful branch saturations on the branch.
10.66/1.73	# There were 1 successful branch saturations after the branch.
10.66/1.73	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
10.66/1.73	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
10.66/1.73	# Begin clausification derivation
10.66/1.73	
10.66/1.73	# End clausification derivation
10.66/1.73	# Begin listing active clauses obtained from FOF to CNF conversion
10.66/1.73	cnf(i_0_25, plain, (join(X1,complement(X1))=one)).
10.66/1.73	cnf(i_0_23, plain, (meet(X1,complement(X1))=zero)).
10.66/1.73	cnf(i_0_26, plain, (meet(X1,X1)=X1)).
10.66/1.73	cnf(i_0_22, plain, (join(X1,X1)=X1)).
10.66/1.73	cnf(i_0_21, plain, (join(X1,meet(X1,X2))=X1)).
10.66/1.73	cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)).
10.66/1.73	cnf(i_0_19, plain, (ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2)=X2)).
10.66/1.73	cnf(i_0_18, plain, (ifeq(X1,X1,X2,X3)=X2)).
10.66/1.73	cnf(i_0_15, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
10.66/1.73	cnf(i_0_17, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
10.66/1.73	cnf(i_0_27, plain, (meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2))))))=meet(X1,join(X2,meet(X1,X3))))).
10.66/1.73	cnf(i_0_28, plain, (meet(X1,X2)=meet(X2,X1))).
10.66/1.73	cnf(i_0_24, plain, (join(X1,X2)=join(X2,X1))).
10.66/1.73	cnf(i_0_20, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,c)))).
10.66/1.73	cnf(i_0_30, plain, (X4=X4)).
10.66/1.73	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
10.66/1.73	# Begin printing tableau
10.66/1.73	# Found 6 steps
10.66/1.73	cnf(i_0_25, plain, (join(X11,complement(X11))=one), inference(start_rule)).
10.66/1.73	cnf(i_0_38, plain, (join(X11,complement(X11))=one), inference(extension_rule, [i_0_34])).
10.66/1.73	cnf(i_0_61, plain, (join(one,complement(one))!=one), inference(closure_rule, [i_0_25])).
10.66/1.73	cnf(i_0_60, plain, (meet(join(one,complement(one)),join(X11,complement(X11)))=meet(one,one)), inference(extension_rule, [i_0_33])).
10.66/1.73	cnf(i_0_79, plain, (meet(one,one)!=one), inference(closure_rule, [i_0_26])).
10.66/1.73	cnf(i_0_77, plain, (meet(join(one,complement(one)),join(X11,complement(X11)))=one), inference(etableau_closure_rule, [i_0_77, ...])).
10.66/1.73	# End printing tableau
10.66/1.73	# SZS output end
10.66/1.73	# Branches closed with saturation will be marked with an "s"
10.66/1.73	# Child (5784) has found a proof.
10.66/1.73	
10.66/1.73	# Proof search is over...
10.66/1.73	# Freeing feature tree
10.93/1.75	EOF