0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/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   : n013.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 16:19:03 EDT 2021
0.12/0.34	% CPUTime    : 
0.19/0.36	# No SInE strategy applied
0.19/0.36	# Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S
0.19/0.36	# and selection function SelectNewComplexAHP.
0.19/0.36	#
0.19/0.36	# Number of axioms: 16 Number of unprocessed: 16
0.19/0.36	# Tableaux proof search.
0.19/0.36	# APR header successfully linked.
0.19/0.36	# Hello from C++
0.43/0.60	# The folding up rule is enabled...
0.43/0.60	# Local unification is enabled...
0.43/0.60	# Any saturation attempts will use folding labels...
0.43/0.60	# 16 beginning clauses after preprocessing and clausification
0.43/0.60	# Creating start rules for all 1 conjectures.
0.43/0.60	# There are 1 start rule candidates:
0.43/0.60	# Found 9 unit axioms.
0.43/0.60	# 1 start rule tableaux created.
0.43/0.60	# 7 extension rule candidate clauses
0.43/0.60	# 9 unit axiom clauses
0.43/0.60	
0.43/0.60	# Requested 8, 32 cores available to the main process.
0.43/0.60	# There are not enough tableaux to fork, creating more from the initial 1
0.43/0.61	# There were 1 total branch saturation attempts.
0.43/0.61	# There were 0 of these attempts blocked.
0.43/0.61	# There were 0 deferred branch saturation attempts.
0.43/0.61	# There were 0 free duplicated saturations.
0.43/0.61	# There were 1 total successful branch saturations.
0.43/0.61	# There were 0 successful branch saturations in interreduction.
0.43/0.61	# There were 0 successful branch saturations on the branch.
0.43/0.61	# There were 1 successful branch saturations after the branch.
0.43/0.61	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.43/0.61	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.43/0.61	# Begin clausification derivation
0.43/0.61	
0.43/0.61	# End clausification derivation
0.43/0.61	# Begin listing active clauses obtained from FOF to CNF conversion
0.43/0.61	cnf(i_0_16, plain, ('+'(X1,'1')='1')).
0.43/0.61	cnf(i_0_4, plain, ('>='(X1,'0'))).
0.43/0.61	cnf(i_0_15, plain, ('+'(X1,'0')=X1)).
0.43/0.61	cnf(i_0_1, plain, ('>='(X1,X1))).
0.43/0.61	cnf(i_0_7, plain, ('+'(X1,X1)=X1)).
0.43/0.61	cnf(i_0_8, plain, ('+'(X1,X2)='+'(X2,X1))).
0.43/0.61	cnf(i_0_13, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))).
0.43/0.61	cnf(i_0_9, plain, ('>='(X1,X3)|~'>='(X2,X3)|~'>='(X1,X2))).
0.43/0.61	cnf(i_0_14, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
0.43/0.61	cnf(i_0_11, plain, ('==>'('==>'(X1,X2),X2)='==>'('==>'(X2,X1),X1))).
0.43/0.61	cnf(i_0_10, plain, ('>='('==>'(X3,X1),'==>'(X3,X2))|~'>='(X1,X2))).
0.43/0.61	cnf(i_0_12, plain, ('>='('==>'(X2,X3),'==>'(X1,X3))|~'>='(X1,X2))).
0.43/0.61	cnf(i_0_6, plain, ('>='('+'(X1,X3),'+'(X2,X3))|~'>='(X1,X2))).
0.43/0.61	cnf(i_0_2, plain, ('>='(X2,'==>'(X1,X3))|~'>='('+'(X1,X2),X3))).
0.43/0.61	cnf(i_0_3, plain, ('>='('+'(X2,X1),X3)|~'>='(X1,'==>'(X2,X3)))).
0.43/0.61	cnf(i_0_5, negated_conjecture, ('==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0)!='0')).
0.43/0.61	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.43/0.61	# Begin printing tableau
0.43/0.61	# Found 5 steps
0.43/0.61	cnf(i_0_5, negated_conjecture, ('==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0)!='0'), inference(start_rule)).
0.43/0.61	cnf(i_0_17, plain, ('==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0)!='0'), inference(extension_rule, [i_0_13])).
0.43/0.61	cnf(i_0_20, plain, (~'>='('==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0),'0')), inference(closure_rule, [i_0_4])).
0.43/0.61	cnf(i_0_19, plain, (~'>='('0','==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0))), inference(extension_rule, [i_0_2])).
0.43/0.61	cnf(i_0_47, plain, (~'>='('+'('==>'('==>'(esk1_0,'1'),esk1_0),'0'),esk1_0)), inference(etableau_closure_rule, [i_0_47, ...])).
0.43/0.61	# End printing tableau
0.43/0.61	# SZS output end
0.43/0.61	# Branches closed with saturation will be marked with an "s"
0.43/0.61	# Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
0.43/0.61	# We now have 2 tableaux to operate on
0.43/0.61	# Found closed tableau during pool population.
0.43/0.61	# Proof search is over...
0.43/0.61	# Freeing feature tree
0.43/0.61	EOF