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