0.13/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.14	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.35	% Computer   : n011.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 14:27:40 EDT 2021
0.13/0.36	% CPUTime    : 
0.13/0.38	# No SInE strategy applied
0.13/0.38	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN
0.13/0.38	# and selection function SelectComplexExceptUniqMaxHorn.
0.13/0.38	#
0.13/0.38	# Presaturation interreduction done
0.13/0.38	# Number of axioms: 4 Number of unprocessed: 4
0.13/0.38	# Tableaux proof search.
0.13/0.38	# APR header successfully linked.
0.13/0.38	# Hello from C++
0.13/0.38	# The folding up rule is enabled...
0.13/0.38	# Local unification is enabled...
0.13/0.38	# Any saturation attempts will use folding labels...
0.13/0.38	# 4 beginning clauses after preprocessing and clausification
0.13/0.38	# Creating start rules for all 1 conjectures.
0.13/0.38	# There are 1 start rule candidates:
0.13/0.38	# Found 4 unit axioms.
0.13/0.38	# 1 start rule tableaux created.
0.13/0.38	# 0 extension rule candidate clauses
0.13/0.38	# 4 unit axiom clauses
0.13/0.38	
0.13/0.38	# Requested 8, 32 cores available to the main process.
0.13/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.38	# Creating equality axioms
0.13/0.38	# Ran out of tableaux, making start rules for all clauses
0.13/0.38	# Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
0.13/0.38	# We now have 9 tableaux to operate on
10.43/1.71	# There were 1 total branch saturation attempts.
10.43/1.71	# There were 0 of these attempts blocked.
10.43/1.71	# There were 0 deferred branch saturation attempts.
10.43/1.71	# There were 0 free duplicated saturations.
10.43/1.71	# There were 1 total successful branch saturations.
10.43/1.71	# There were 0 successful branch saturations in interreduction.
10.43/1.71	# There were 0 successful branch saturations on the branch.
10.43/1.71	# There were 1 successful branch saturations after the branch.
10.43/1.71	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
10.43/1.71	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
10.43/1.71	# Begin clausification derivation
10.43/1.71	
10.43/1.71	# End clausification derivation
10.43/1.71	# Begin listing active clauses obtained from FOF to CNF conversion
10.43/1.71	cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))).
10.43/1.71	cnf(i_0_8, plain, (apply(X1,X1)=apply(m,X1))).
10.43/1.71	cnf(i_0_7, plain, (apply(apply(X1,X2),apply(X3,X2))=apply(apply(apply(s,X1),X3),X2))).
10.43/1.71	cnf(i_0_5, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))).
10.43/1.71	cnf(i_0_10, plain, (X4=X4)).
10.43/1.71	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
10.43/1.71	# Begin printing tableau
10.43/1.71	# Found 5 steps
10.43/1.71	cnf(i_0_7, plain, (apply(apply(X1,X2),apply(X3,X2))=apply(apply(apply(s,X1),X3),X2)), inference(start_rule)).
10.43/1.71	cnf(i_0_18, plain, (apply(apply(X1,X2),apply(X3,X2))=apply(apply(apply(s,X1),X3),X2)), inference(extension_rule, [i_0_13])).
10.43/1.71	cnf(i_0_39, plain, (apply(apply(apply(s,X1),X3),X2)!=apply(apply(X1,X2),apply(X3,X2))), inference(closure_rule, [i_0_7])).
10.43/1.71	cnf(i_0_37, plain, (apply(apply(X1,X2),apply(X3,X2))=apply(apply(X1,X2),apply(X3,X2))), inference(extension_rule, [i_0_14])).
10.43/1.71	cnf(i_0_44, plain, (f(apply(apply(X1,X2),apply(X3,X2)))=f(apply(apply(X1,X2),apply(X3,X2)))), inference(etableau_closure_rule, [i_0_44, ...])).
10.43/1.71	# End printing tableau
10.43/1.71	# SZS output end
10.43/1.71	# Branches closed with saturation will be marked with an "s"
10.43/1.72	# Child (27078) has found a proof.
10.43/1.72	
10.43/1.72	# Proof search is over...
10.43/1.72	# Freeing feature tree
10.43/1.73	EOF