0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/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   : n015.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 02:11:11 EDT 2022
0.12/0.33	% CPUTime    : 
0.18/0.37	# No SInE strategy applied
0.18/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
0.18/0.37	# and selection function PSelectComplexExceptUniqMaxHorn.
0.18/0.37	#
0.18/0.37	# Presaturation interreduction done
0.18/0.37	# Number of axioms: 86 Number of unprocessed: 86
0.18/0.37	# Tableaux proof search.
0.18/0.37	# APR header successfully linked.
0.18/0.37	# Hello from C++
0.18/0.39	# The folding up rule is enabled...
0.18/0.39	# Local unification is enabled...
0.18/0.39	# Any saturation attempts will use folding labels...
0.18/0.39	# 86 beginning clauses after preprocessing and clausification
0.18/0.39	# Creating start rules for all 1 conjectures.
0.18/0.39	# There are 1 start rule candidates:
0.18/0.39	# Found 27 unit axioms.
0.18/0.39	# 1 start rule tableaux created.
0.18/0.39	# 59 extension rule candidate clauses
0.18/0.39	# 27 unit axiom clauses
0.18/0.39	
0.18/0.39	# Requested 8, 32 cores available to the main process.
0.18/0.39	# There are not enough tableaux to fork, creating more from the initial 1
0.18/0.39	# There were 1 total branch saturation attempts.
0.18/0.39	# There were 0 of these attempts blocked.
0.18/0.39	# There were 0 deferred branch saturation attempts.
0.18/0.39	# There were 0 free duplicated saturations.
0.18/0.39	# There were 1 total successful branch saturations.
0.18/0.39	# There were 0 successful branch saturations in interreduction.
0.18/0.39	# There were 0 successful branch saturations on the branch.
0.18/0.39	# There were 1 successful branch saturations after the branch.
0.18/0.39	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.18/0.39	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.18/0.39	# Begin clausification derivation
0.18/0.39	
0.18/0.39	# End clausification derivation
0.18/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.39	cnf(i_0_26, plain, (update_slb(create_slb,X1)=create_slb)).
0.18/0.39	cnf(i_0_4, plain, (less_than(bottom,X1))).
0.18/0.39	cnf(i_0_2, plain, (less_than(X1,X1))).
0.18/0.39	cnf(i_0_43, plain, (succ_cpq(X1,X1))).
0.18/0.39	cnf(i_0_20, plain, (isnonempty_pq(insert_pq(X1,X2)))).
0.18/0.39	cnf(i_0_76, plain, (i(triple(X1,create_slb,X2))=create_pq)).
0.18/0.39	cnf(i_0_23, plain, (remove_pq(insert_pq(X1,X2),X2)=X1)).
0.18/0.39	cnf(i_0_50, plain, (findmin_cpq_res(triple(X1,create_slb,X2))=bottom)).
0.18/0.39	cnf(i_0_44, plain, (check_cpq(triple(X1,create_slb,X2)))).
0.18/0.39	cnf(i_0_18, plain, (contains_pq(insert_pq(X1,X2),X2))).
0.18/0.39	cnf(i_0_40, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))).
0.18/0.39	cnf(i_0_57, plain, (findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad))).
0.18/0.39	cnf(i_0_38, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)).
0.18/0.39	cnf(i_0_41, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)).
0.18/0.39	cnf(i_0_27, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X2))).
0.18/0.39	cnf(i_0_36, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3))).
0.18/0.39	cnf(i_0_53, plain, (triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4)=insert_cpq(triple(X1,X3,X4),X2))).
0.18/0.39	cnf(i_0_21, plain, (insert_pq(insert_pq(X1,X2),X3)=insert_pq(insert_pq(X1,X3),X2))).
0.18/0.39	cnf(i_0_88, lemma, (i(triple(X1,X2,X3))=i(triple(X4,X2,X5)))).
0.18/0.39	cnf(i_0_84, plain, (i(triple(X1,insert_slb(X2,pair(X3,X4)),X5))=insert_pq(i(triple(X1,X2,X5)),X3))).
0.18/0.39	cnf(i_0_9, plain, (~isnonempty_pq(create_pq))).
0.18/0.39	cnf(i_0_87, negated_conjecture, (i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0))).
0.18/0.39	cnf(i_0_37, plain, (~isnonempty_slb(create_slb))).
0.18/0.39	cnf(i_0_14, plain, (~contains_pq(create_pq,X1))).
0.18/0.39	cnf(i_0_32, plain, (~contains_slb(create_slb,X1))).
0.18/0.39	cnf(i_0_30, plain, (~pair_in_list(create_slb,X1,X2))).
0.18/0.39	cnf(i_0_65, plain, (~ok(triple(X1,X2,bad)))).
0.18/0.39	cnf(i_0_6, plain, (~strictly_less_than(X1,X2)|~less_than(X2,X1))).
0.18/0.39	cnf(i_0_70, plain, (pi_find_min(X1)|~pi_sharp_find_min(i(X1),X2))).
0.18/0.39	cnf(i_0_82, plain, (pi_removemin(X1)|~pi_sharp_find_min(i(X1),X2))).
0.18/0.39	cnf(i_0_73, plain, (check_cpq(esk3_1(X1))|~phi(X1))).
0.18/0.39	cnf(i_0_7, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))).
0.18/0.39	cnf(i_0_69, plain, (contains_pq(X1,X2)|~pi_sharp_removemin(X1,X2))).
0.18/0.39	cnf(i_0_78, plain, (contains_pq(X1,X2)|~pi_sharp_find_min(X1,X2))).
0.18/0.39	cnf(i_0_80, plain, (contains_pq(X1,X2)|~pi_sharp_remove(X1,X2))).
0.18/0.39	cnf(i_0_74, plain, (ok(esk3_1(X1))|~phi(X1))).
0.18/0.39	cnf(i_0_68, plain, (issmallestelement_pq(X1,X2)|~pi_sharp_removemin(X1,X2))).
0.18/0.39	cnf(i_0_77, plain, (issmallestelement_pq(X1,X2)|~pi_sharp_find_min(X1,X2))).
0.18/0.39	cnf(i_0_75, plain, (succ_cpq(X1,esk3_1(X1))|~phi(X1))).
0.18/0.39	cnf(i_0_81, plain, (pi_sharp_remove(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_86, plain, (pi_remove(X1,X2)|~pi_sharp_remove(i(X1),X2))).
0.18/0.39	cnf(i_0_11, plain, (issmallestelement_pq(X1,X2)|~less_than(X2,esk1_2(X1,X2)))).
0.18/0.39	cnf(i_0_67, plain, (pi_sharp_removemin(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_79, plain, (pi_sharp_find_min(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_85, plain, (pi_sharp_remove(i(X1),X2)|~pi_remove(X1,X2))).
0.18/0.39	cnf(i_0_71, plain, (pi_sharp_find_min(i(X1),esk2_1(X1))|~pi_find_min(X1))).
0.18/0.39	cnf(i_0_83, plain, (pi_sharp_find_min(i(X1),esk4_1(X1))|~pi_removemin(X1))).
0.18/0.39	cnf(i_0_1, plain, (less_than(X1,X2)|less_than(X2,X1))).
0.18/0.39	cnf(i_0_56, plain, (X1=bad|ok(triple(X2,X3,X1)))).
0.18/0.39	cnf(i_0_55, plain, (contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2))).
0.18/0.39	cnf(i_0_60, plain, (succ_cpq(X1,findmin_cpq_eff(X2))|~succ_cpq(X1,X2))).
0.18/0.39	cnf(i_0_72, plain, (phi(X1)|~ok(X2)|~check_cpq(X2)|~succ_cpq(X1,X2))).
0.18/0.39	cnf(i_0_52, plain, (~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~strictly_less_than(X3,X4))).
0.18/0.39	cnf(i_0_51, plain, (succ_cpq(X1,insert_cpq(X2,X3))|~succ_cpq(X1,X2))).
0.18/0.39	cnf(i_0_19, plain, (contains_pq(insert_pq(X1,X2),X3)|~contains_pq(X1,X3))).
0.18/0.39	cnf(i_0_5, plain, (strictly_less_than(X1,X2)|less_than(X2,X1))).
0.18/0.39	cnf(i_0_46, plain, (findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb)).
0.18/0.39	cnf(i_0_3, plain, (less_than(X1,X2)|~less_than(X1,X3)|~less_than(X3,X2))).
0.18/0.39	cnf(i_0_10, plain, (less_than(X1,X2)|~issmallestelement_pq(X3,X1)|~contains_pq(X3,X2))).
0.18/0.39	cnf(i_0_8, plain, (findmin_pq_res(X1,X2)=X2|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_22, plain, (removemin_pq_res(X1,X2)=X2|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_15, plain, (findmin_pq_eff(X1,X2)=X1|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_17, plain, (X1=X2|contains_pq(X3,X2)|~contains_pq(insert_pq(X3,X1),X2))).
0.18/0.39	cnf(i_0_47, plain, (succ_cpq(X1,remove_cpq(X2,X3))|~succ_cpq(X1,X2))).
0.18/0.39	cnf(i_0_12, plain, (issmallestelement_pq(X1,X2)|contains_pq(X1,esk1_2(X1,X2)))).
0.18/0.39	cnf(i_0_54, plain, (contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4))).
0.18/0.39	cnf(i_0_16, plain, (removemin_pq_eff(X1,X2)=remove_pq(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
0.18/0.39	cnf(i_0_29, plain, (X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2))).
0.18/0.39	cnf(i_0_42, plain, (succ_cpq(X1,remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)))|~succ_cpq(X1,X2))).
0.18/0.39	cnf(i_0_28, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4))).
0.18/0.39	cnf(i_0_64, plain, (remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4))).
0.18/0.39	cnf(i_0_13, plain, (remove_pq(insert_pq(X1,X2),X3)=insert_pq(remove_pq(X1,X3),X2)|X2=X3|~contains_pq(X1,X3))).
0.18/0.39	cnf(i_0_31, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X4=X2|~contains_slb(X1,X4))).
0.18/0.39	cnf(i_0_33, plain, (X1=X2|pair_in_list(X3,X4,X1)|~pair_in_list(insert_slb(X3,pair(X5,X2)),X4,X1))).
0.18/0.39	cnf(i_0_34, plain, (X1=X2|pair_in_list(X3,X1,X4)|~pair_in_list(insert_slb(X3,pair(X2,X5)),X1,X4))).
0.18/0.39	cnf(i_0_49, plain, (check_cpq(triple(X1,X2,X3))|~check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))|~less_than(X5,X4))).
0.18/0.39	cnf(i_0_35, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5))).
0.18/0.39	cnf(i_0_48, plain, (check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~check_cpq(triple(X1,X2,X5))|~less_than(X4,X3))).
0.18/0.39	cnf(i_0_39, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X3))|~less_than(X4,X3))).
0.18/0.39	cnf(i_0_24, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X4))|~strictly_less_than(X3,X4))).
0.18/0.39	cnf(i_0_25, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(remove_slb(X1,X4),pair(X2,X3))|X4=X2|~contains_slb(X1,X4))).
0.18/0.39	cnf(i_0_63, plain, (triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4)=remove_cpq(triple(X1,X3,X4),X2)|~contains_slb(X3,X2)|~less_than(lookup_slb(X3,X2),X2))).
0.18/0.39	cnf(i_0_66, plain, (triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|~contains_slb(X2,findmin_pqp_res(X1))|~less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))).
0.18/0.39	cnf(i_0_45, plain, (remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)|~contains_slb(X2,X4)|~strictly_less_than(X4,lookup_slb(X2,X4)))).
0.18/0.39	cnf(i_0_61, plain, (triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|contains_slb(X2,findmin_pqp_res(X1)))).
0.18/0.39	cnf(i_0_62, plain, (findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|create_slb=X2|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))))).
0.18/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.39	# Begin printing tableau
0.18/0.39	# Found 6 steps
0.18/0.39	cnf(i_0_87, negated_conjecture, (i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)), inference(start_rule)).
0.18/0.39	cnf(i_0_93, plain, (i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)), inference(extension_rule, [i_0_34])).
0.18/0.39	cnf(i_0_204, plain, (pair_in_list(create_slb,i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)),i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)))), inference(closure_rule, [i_0_30])).
0.18/0.39	cnf(i_0_205, plain, (~pair_in_list(insert_slb(create_slb,pair(insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),X16)),i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)),i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)))), inference(extension_rule, [i_0_33])).
0.18/0.39	cnf(i_0_486, plain, (i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)), inference(closure_rule, [i_0_87])).
0.18/0.39	cnf(i_0_488, plain, (~pair_in_list(insert_slb(insert_slb(create_slb,pair(insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),X16)),pair(X12,insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0))),i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)),i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)))), inference(etableau_closure_rule, [i_0_488, ...])).
0.18/0.39	# End printing tableau
0.18/0.39	# SZS output end
0.18/0.39	# Branches closed with saturation will be marked with an "s"
0.18/0.39	# Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
0.18/0.39	# We now have 6 tableaux to operate on
0.18/0.39	# Found closed tableau during pool population.
0.18/0.39	# Proof search is over...
0.18/0.39	# Freeing feature tree
0.18/0.39	EOF