0.07/0.12	% 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   : n010.cluster.edu
0.12/0.33	Model      : x86_64 x86_64
0.12/0.33	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	RAMPerCPU  : 8042.1875MB
0.12/0.33	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Aug  9 05:36:50 EDT 2022
0.12/0.34	% CPUTime    : 
0.12/0.39	# No SInE strategy applied
0.12/0.39	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.12/0.39	# and selection function PSelectComplexExceptUniqMaxHorn.
0.12/0.39	#
0.12/0.39	# Number of axioms: 51 Number of unprocessed: 51
0.12/0.39	# Tableaux proof search.
0.12/0.39	# APR header successfully linked.
0.12/0.39	# Hello from C++
0.12/0.39	# The folding up rule is enabled...
0.12/0.39	# Local unification is enabled...
0.12/0.39	# Any saturation attempts will use folding labels...
0.12/0.39	# 51 beginning clauses after preprocessing and clausification
0.12/0.39	# Creating start rules for all 6 conjectures.
0.12/0.39	# There are 6 start rule candidates:
0.12/0.39	# Found 16 unit axioms.
0.12/0.39	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.12/0.39	# 6 start rule tableaux created.
0.12/0.39	# 35 extension rule candidate clauses
0.12/0.39	# 16 unit axiom clauses
0.12/0.39	
0.12/0.39	# Requested 8, 32 cores available to the main process.
0.12/0.39	# There are not enough tableaux to fork, creating more from the initial 6
0.12/0.39	# Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
0.12/0.39	# We now have 18 tableaux to operate on
4.92/1.00	# There were 3 total branch saturation attempts.
4.92/1.00	# There were 0 of these attempts blocked.
4.92/1.00	# There were 0 deferred branch saturation attempts.
4.92/1.00	# There were 0 free duplicated saturations.
4.92/1.00	# There were 3 total successful branch saturations.
4.92/1.00	# There were 0 successful branch saturations in interreduction.
4.92/1.00	# There were 0 successful branch saturations on the branch.
4.92/1.00	# There were 3 successful branch saturations after the branch.
4.92/1.00	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.92/1.00	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.92/1.00	# Begin clausification derivation
4.92/1.00	
4.92/1.00	# End clausification derivation
4.92/1.00	# Begin listing active clauses obtained from FOF to CNF conversion
4.92/1.00	cnf(i_0_3, plain, (ne(bool))).
4.92/1.00	cnf(i_0_8, plain, (ne(ind))).
4.92/1.00	cnf(i_0_16, plain, (ne(ty_2Eextreal_2Eextreal))).
4.92/1.00	cnf(i_0_11, plain, (p(c_2Ebool_2ET))).
4.92/1.00	cnf(i_0_570, plain, (~p(c_2Ebool_2EF))).
4.92/1.00	cnf(i_0_582, plain, (mem(c_2Ebool_2ET,bool))).
4.92/1.00	cnf(i_0_504, plain, (mem(c_2Ebool_2EF,bool))).
4.92/1.00	cnf(i_0_367, negated_conjecture, (mem(esk2_0,ty_2Eextreal_2Eextreal))).
4.92/1.00	cnf(i_0_366, negated_conjecture, (mem(esk3_0,ty_2Eextreal_2Eextreal))).
4.92/1.00	cnf(i_0_365, negated_conjecture, (mem(esk4_0,ty_2Eextreal_2Eextreal))).
4.92/1.00	cnf(i_0_584, plain, (mem(c_2Ebool_2E_7E,arr(bool,bool)))).
4.92/1.00	cnf(i_0_5, plain, (ap(i(X2),X1)=X1|~mem(X1,X2))).
4.92/1.00	cnf(i_0_6, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))).
4.92/1.00	cnf(i_0_9, plain, (X1=X2|p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_433, plain, (p(X1)|p(ap(c_2Ebool_2E_7E,X1))|~mem(X1,bool))).
4.92/1.00	cnf(i_0_10, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_7, plain, (ap(k(X2,X3),X1)=X3|~mem(X1,X2))).
4.92/1.00	cnf(i_0_432, plain, (~p(X1)|~mem(X1,bool)|~p(ap(c_2Ebool_2E_7E,X1)))).
4.92/1.00	cnf(i_0_12, plain, (mem(c_2Eextreal_2Eextreal__le,arr(ty_2Eextreal_2Eextreal,arr(ty_2Eextreal_2Eextreal,bool))))).
4.92/1.00	cnf(i_0_569, plain, (mem(c_2Eextreal_2Eextreal__max,arr(ty_2Eextreal_2Eextreal,arr(ty_2Eextreal_2Eextreal,ty_2Eextreal_2Eextreal))))).
4.92/1.00	cnf(i_0_368, plain, (mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))))).
4.92/1.00	cnf(i_0_369, plain, (mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))))).
4.92/1.00	cnf(i_0_431, plain, (mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))))).
4.92/1.00	cnf(i_0_429, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))).
4.92/1.00	cnf(i_0_430, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))).
4.92/1.00	cnf(i_0_450, plain, (p(X1)|p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_449, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_379, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_380, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_4, plain, (mem(ap(X1,X4),X3)|~mem(X4,X2)|~mem(X1,arr(X2,X3)))).
4.92/1.00	cnf(i_0_434, plain, (p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
4.92/1.00	cnf(i_0_511, plain, (mem(esk5_2(X1,X2),X1)|p(ap(c_2Ebool_2E_21(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool)))).
4.92/1.00	cnf(i_0_14, plain, (p(ap(ap(c_2Emin_2E_3D(X3),X2),X1))|X1!=X2|~ne(X3)|~mem(X2,X3)|~mem(X1,X3))).
4.92/1.00	cnf(i_0_427, plain, (ap(ap(ap(c_2Ebool_2ECOND(X2),c_2Ebool_2EF),X3),X1)=X1|~ne(X2)|~mem(X3,X2)|~mem(X1,X2))).
4.92/1.00	cnf(i_0_426, plain, (ap(ap(ap(c_2Ebool_2ECOND(X1),c_2Ebool_2ET),X2),X3)=X2|~ne(X1)|~mem(X3,X1)|~mem(X2,X1))).
4.92/1.00	cnf(i_0_435, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X2),X1)))).
4.92/1.00	cnf(i_0_436, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2)))).
4.92/1.00	cnf(i_0_378, plain, (p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2)))).
4.92/1.00	cnf(i_0_451, plain, (p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2)))).
4.92/1.00	cnf(i_0_512, plain, (p(ap(X2,X3))|~ne(X1)|~mem(X3,X1)|~p(ap(c_2Ebool_2E_21(X1),X2))|~mem(X2,arr(X1,bool)))).
4.92/1.00	cnf(i_0_583, plain, (p(ap(ap(c_2Eextreal_2Eextreal__le,X2),X1))|p(ap(ap(c_2Eextreal_2Eextreal__le,X1),X2))|~mem(X2,ty_2Eextreal_2Eextreal)|~mem(X1,ty_2Eextreal_2Eextreal))).
4.92/1.00	cnf(i_0_454, plain, (mem(c_2Ebool_2ECOND(X1),arr(bool,arr(X1,arr(X1,X1))))|~ne(X1))).
4.92/1.00	cnf(i_0_15, plain, (X2=X3|~ne(X1)|~mem(X3,X1)|~mem(X2,X1)|~p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)))).
4.92/1.00	cnf(i_0_510, plain, (p(ap(c_2Ebool_2E_21(X2),X1))|~ne(X2)|~mem(X1,arr(X2,bool))|~p(ap(X1,esk5_2(X2,X1))))).
4.92/1.00	cnf(i_0_17, plain, (p(ap(ap(c_2Eextreal_2Eextreal__le,X1),X3))|~mem(X3,ty_2Eextreal_2Eextreal)|~mem(X2,ty_2Eextreal_2Eextreal)|~mem(X1,ty_2Eextreal_2Eextreal)|~p(ap(ap(c_2Eextreal_2Eextreal__le,X2),X3))|~p(ap(ap(c_2Eextreal_2Eextreal__le,X1),X2)))).
4.92/1.00	cnf(i_0_362, negated_conjecture, (p(ap(ap(c_2Eextreal_2Eextreal__le,esk3_0),esk2_0))|p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk3_0),esk4_0)),esk2_0)))).
4.92/1.00	cnf(i_0_363, negated_conjecture, (p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk2_0))|p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk3_0),esk4_0)),esk2_0)))).
4.92/1.00	cnf(i_0_452, plain, (ap(ap(ap(c_2Ebool_2ECOND(ty_2Eextreal_2Eextreal),ap(ap(c_2Eextreal_2Eextreal__le,X1),X2)),X2),X1)=ap(ap(c_2Eextreal_2Eextreal__max,X1),X2)|~mem(X2,ty_2Eextreal_2Eextreal)|~mem(X1,ty_2Eextreal_2Eextreal))).
4.92/1.00	cnf(i_0_2, plain, (X3=X4|mem(esk1_4(X1,X2,X3,X4),X1)|~mem(X4,arr(X1,X2))|~mem(X3,arr(X1,X2)))).
4.92/1.00	cnf(i_0_364, negated_conjecture, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk3_0),esk2_0))|~p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk2_0))|~p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk3_0),esk4_0)),esk2_0)))).
4.92/1.00	cnf(i_0_1, plain, (X1=X4|ap(X1,esk1_4(X2,X3,X4,X1))!=ap(X4,esk1_4(X2,X3,X4,X1))|~mem(X4,arr(X2,X3))|~mem(X1,arr(X2,X3)))).
4.92/1.00	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
4.92/1.00	# Begin printing tableau
4.92/1.00	# Found 7 steps
4.92/1.00	cnf(i_0_366, negated_conjecture, (mem(esk3_0,ty_2Eextreal_2Eextreal)), inference(start_rule)).
4.92/1.00	cnf(i_0_594, plain, (mem(esk3_0,ty_2Eextreal_2Eextreal)), inference(extension_rule, [i_0_5])).
4.92/1.00	cnf(i_0_726, plain, (ap(i(ty_2Eextreal_2Eextreal),esk3_0)=esk3_0), inference(extension_rule, [i_0_14])).
4.92/1.00	cnf(i_0_783, plain, (~ne(bool)), inference(closure_rule, [i_0_3])).
4.92/1.00	cnf(i_0_781, plain, (p(ap(ap(c_2Emin_2E_3D(bool),esk3_0),ap(i(ty_2Eextreal_2Eextreal),esk3_0)))), inference(etableau_closure_rule, [i_0_781, ...])).
4.92/1.00	cnf(i_0_784, plain, (~mem(esk3_0,bool)), inference(etableau_closure_rule, [i_0_784, ...])).
4.92/1.00	cnf(i_0_785, plain, (~mem(ap(i(ty_2Eextreal_2Eextreal),esk3_0),bool)), inference(etableau_closure_rule, [i_0_785, ...])).
4.92/1.00	# End printing tableau
4.92/1.00	# SZS output end
4.92/1.00	# Branches closed with saturation will be marked with an "s"
4.92/1.00	# Child (20966) has found a proof.
4.92/1.00	
4.92/1.00	# Proof search is over...
4.92/1.00	# Freeing feature tree
4.92/1.00	EOF