0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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   : n020.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 12:44:36 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.35	# No SInE strategy applied
0.12/0.35	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN
0.12/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.35	#
0.12/0.35	# Presaturation interreduction done
0.12/0.35	# Number of axioms: 4 Number of unprocessed: 4
0.12/0.35	# Tableaux proof search.
0.12/0.35	# APR header successfully linked.
0.12/0.35	# Hello from C++
0.12/0.35	# The folding up rule is enabled...
0.12/0.35	# Local unification is enabled...
0.12/0.35	# Any saturation attempts will use folding labels...
0.12/0.35	# 4 beginning clauses after preprocessing and clausification
0.12/0.35	# Creating start rules for all 1 conjectures.
0.12/0.35	# There are 1 start rule candidates:
0.12/0.35	# Found 4 unit axioms.
0.12/0.35	# 1 start rule tableaux created.
0.12/0.35	# 0 extension rule candidate clauses
0.12/0.35	# 4 unit axiom clauses
0.12/0.35	
0.12/0.35	# Requested 8, 32 cores available to the main process.
0.12/0.35	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.35	# Creating equality axioms
0.12/0.35	# Ran out of tableaux, making start rules for all clauses
0.12/0.35	# Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
0.12/0.35	# We now have 9 tableaux to operate on
0.12/0.36	# There were 1 total branch saturation attempts.
0.12/0.36	# There were 0 of these attempts blocked.
0.12/0.36	# There were 0 deferred branch saturation attempts.
0.12/0.36	# There were 0 free duplicated saturations.
0.12/0.36	# There were 1 total successful branch saturations.
0.12/0.36	# There were 0 successful branch saturations in interreduction.
0.12/0.36	# There were 0 successful branch saturations on the branch.
0.12/0.36	# There were 1 successful branch saturations after the branch.
0.12/0.36	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.36	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.36	# Begin clausification derivation
0.12/0.36	
0.12/0.36	# End clausification derivation
0.12/0.36	# Begin listing active clauses obtained from FOF to CNF conversion
0.12/0.36	cnf(i_0_7, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))).
0.12/0.36	cnf(i_0_6, plain, (apply(apply(apply(c,X1),X2),X3)=apply(apply(X1,X3),X2))).
0.12/0.36	cnf(i_0_5, plain, (apply(X1,X1)=apply(m,X1))).
0.12/0.36	cnf(i_0_8, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))).
0.12/0.36	cnf(i_0_10, plain, (X4=X4)).
0.12/0.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.12/0.36	# Begin printing tableau
0.12/0.36	# Found 6 steps
0.12/0.36	cnf(i_0_7, plain, (apply(apply(apply(b,m),X11),f(apply(apply(b,m),X11)))=apply(m,apply(X11,f(apply(apply(b,m),X11))))), inference(start_rule)).
0.12/0.36	cnf(i_0_16, plain, (apply(apply(apply(b,m),X11),f(apply(apply(b,m),X11)))=apply(m,apply(X11,f(apply(apply(b,m),X11))))), inference(extension_rule, [i_0_13])).
0.12/0.36	cnf(i_0_25, plain, (apply(f(apply(apply(b,m),X11)),apply(apply(apply(b,m),X11),f(apply(apply(b,m),X11))))=apply(apply(apply(b,m),X11),f(apply(apply(b,m),X11)))), inference(closure_rule, [i_0_8])).
0.12/0.36	cnf(i_0_27, plain, (apply(m,apply(X11,f(apply(apply(b,m),X11))))!=apply(f(apply(apply(b,m),X11)),apply(apply(apply(b,m),X11),f(apply(apply(b,m),X11))))), inference(extension_rule, [i_0_13])).
0.12/0.36	cnf(i_0_38, plain, (apply(m,apply(X11,f(apply(apply(b,m),X11))))!=apply(apply(X11,f(apply(apply(b,m),X11))),apply(X11,f(apply(apply(b,m),X11))))), inference(closure_rule, [i_0_5])).
0.12/0.36	cnf(i_0_39, plain, (apply(apply(X11,f(apply(apply(b,m),X11))),apply(X11,f(apply(apply(b,m),X11))))!=apply(f(apply(apply(b,m),X11)),apply(apply(apply(b,m),X11),f(apply(apply(b,m),X11))))), inference(etableau_closure_rule, [i_0_39, ...])).
0.12/0.36	# End printing tableau
0.12/0.36	# SZS output end
0.12/0.36	# Branches closed with saturation will be marked with an "s"
0.12/0.36	# Child (9290) has found a proof.
0.12/0.36	
0.12/0.36	# Proof search is over...
0.12/0.36	# Freeing feature tree
0.12/0.36	EOF