0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/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   : n031.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   : Wed Jul 14 14:34:15 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
0.19/0.37	# and selection function PSelectComplexExceptUniqMaxHorn.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 51 Number of unprocessed: 51
0.19/0.37	# Tableaux proof search.
0.19/0.37	# APR header successfully linked.
0.19/0.37	# Hello from C++
0.19/0.38	# The folding up rule is enabled...
0.19/0.38	# Local unification is enabled...
0.19/0.38	# Any saturation attempts will use folding labels...
0.19/0.38	# 51 beginning clauses after preprocessing and clausification
0.19/0.38	# Creating start rules for all 2 conjectures.
0.19/0.38	# There are 2 start rule candidates:
0.19/0.38	# Found 19 unit axioms.
0.19/0.38	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.38	# 2 start rule tableaux created.
0.19/0.38	# 32 extension rule candidate clauses
0.19/0.38	# 19 unit axiom clauses
0.19/0.38	
0.19/0.38	# Requested 8, 32 cores available to the main process.
0.19/0.38	# There are not enough tableaux to fork, creating more from the initial 2
0.19/0.38	# Creating equality axioms
0.19/0.38	# Ran out of tableaux, making start rules for all clauses
0.19/0.38	# Returning from population with 52 new_tableaux and 0 remaining starting tableaux.
0.19/0.38	# We now have 52 tableaux to operate on
12.31/1.91	# There were 1 total branch saturation attempts.
12.31/1.91	# There were 0 of these attempts blocked.
12.31/1.91	# There were 0 deferred branch saturation attempts.
12.31/1.91	# There were 0 free duplicated saturations.
12.31/1.91	# There were 1 total successful branch saturations.
12.31/1.91	# There were 0 successful branch saturations in interreduction.
12.31/1.91	# There were 0 successful branch saturations on the branch.
12.31/1.91	# There were 1 successful branch saturations after the branch.
12.31/1.91	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
12.31/1.91	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
12.31/1.91	# Begin clausification derivation
12.31/1.91	
12.31/1.91	# End clausification derivation
12.31/1.91	# Begin listing active clauses obtained from FOF to CNF conversion
12.31/1.91	cnf(i_0_51, negated_conjecture, (ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))))).
12.31/1.91	cnf(i_0_14, plain, (update_slb(create_slb,X1)=create_slb)).
12.31/1.91	cnf(i_0_7, plain, (less_than(bottom,X1))).
12.31/1.91	cnf(i_0_1, plain, (less_than(X1,X1))).
12.31/1.91	cnf(i_0_32, plain, (succ_cpq(X1,X1))).
12.31/1.91	cnf(i_0_27, plain, (findmin_cpq_res(triple(X1,create_slb,X2))=bottom)).
12.31/1.91	cnf(i_0_37, plain, (check_cpq(triple(X1,create_slb,X2)))).
12.31/1.91	cnf(i_0_15, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))).
12.31/1.91	cnf(i_0_30, plain, (findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad))).
12.31/1.91	cnf(i_0_9, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)).
12.31/1.91	cnf(i_0_23, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X2))).
12.31/1.91	cnf(i_0_20, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)).
12.31/1.91	cnf(i_0_18, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3))).
12.31/1.91	cnf(i_0_31, plain, (triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4)=insert_cpq(triple(X1,X3,X4),X2))).
12.31/1.91	cnf(i_0_12, plain, (~isnonempty_slb(create_slb))).
12.31/1.91	cnf(i_0_52, negated_conjecture, (~ok(triple(esk1_0,esk2_0,esk3_0)))).
12.31/1.91	cnf(i_0_24, plain, (~contains_slb(create_slb,X1))).
12.31/1.91	cnf(i_0_34, plain, (~ok(triple(X1,X2,bad)))).
12.31/1.91	cnf(i_0_10, plain, (~pair_in_list(create_slb,X1,X2))).
12.31/1.91	cnf(i_0_4, plain, (~strictly_less_than(X1,X2)|~less_than(X2,X1))).
12.31/1.91	cnf(i_0_5, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))).
12.31/1.91	cnf(i_0_43, plain, (succ_cpq(X1,findmin_cpq_eff(X2))|~succ_cpq(X1,X2))).
12.31/1.91	cnf(i_0_29, plain, (bad=X1|ok(triple(X2,X3,X1)))).
12.31/1.91	cnf(i_0_6, plain, (less_than(X1,X2)|less_than(X2,X1))).
12.31/1.91	cnf(i_0_40, plain, (contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2))).
12.31/1.91	cnf(i_0_33, plain, (~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~strictly_less_than(X3,X4))).
12.31/1.91	cnf(i_0_3, plain, (strictly_less_than(X1,X2)|less_than(X2,X1))).
12.31/1.91	cnf(i_0_2, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))).
12.31/1.91	cnf(i_0_53, lemma, (ok(triple(X1,X2,X3))|~ok(remove_cpq(triple(X1,X2,X3),X4)))).
12.31/1.91	cnf(i_0_26, plain, (succ_cpq(X1,remove_cpq(X2,X3))|~succ_cpq(X1,X2))).
12.31/1.91	cnf(i_0_46, plain, (succ_cpq(X1,remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)))|~succ_cpq(X1,X2))).
12.31/1.91	cnf(i_0_47, plain, (findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|create_slb=X2)).
12.31/1.91	cnf(i_0_35, plain, (succ_cpq(X1,insert_cpq(X2,X3))|~succ_cpq(X1,X2))).
12.31/1.91	cnf(i_0_41, plain, (contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4))).
12.31/1.91	cnf(i_0_21, plain, (X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2))).
12.31/1.91	cnf(i_0_28, plain, (remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4))).
12.31/1.91	cnf(i_0_22, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4))).
12.31/1.91	cnf(i_0_16, plain, (X1=X2|pair_in_list(X3,X4,X1)|~pair_in_list(insert_slb(X3,pair(X5,X2)),X4,X1))).
12.31/1.91	cnf(i_0_17, plain, (X1=X2|pair_in_list(X3,X1,X4)|~pair_in_list(insert_slb(X3,pair(X2,X5)),X1,X4))).
12.31/1.91	cnf(i_0_11, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X2=X4|~contains_slb(X1,X4))).
12.31/1.91	cnf(i_0_38, plain, (check_cpq(triple(X1,X2,X3))|~check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))|~less_than(X5,X4))).
12.31/1.91	cnf(i_0_19, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5))).
12.31/1.91	cnf(i_0_39, plain, (check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~check_cpq(triple(X1,X2,X5))|~less_than(X4,X3))).
12.31/1.91	cnf(i_0_25, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X3))|~less_than(X4,X3))).
12.31/1.91	cnf(i_0_49, 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)))).
12.31/1.91	cnf(i_0_45, 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))).
12.31/1.91	cnf(i_0_8, 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))).
12.31/1.91	cnf(i_0_13, plain, (insert_slb(update_slb(X1,X2),pair(X3,X2))=update_slb(insert_slb(X1,pair(X3,X4)),X2)|~strictly_less_than(X4,X2))).
12.31/1.91	cnf(i_0_44, plain, (triple(remove_pqp(X1,X2),remove_slb(X3,X2),bad)=remove_cpq(triple(X1,X3,X4),X2)|~contains_slb(X3,X2)|~strictly_less_than(X2,lookup_slb(X3,X2)))).
12.31/1.91	cnf(i_0_50, plain, (triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)=findmin_cpq_eff(triple(X1,X2,X3))|X2=create_slb|~contains_slb(X2,findmin_pqp_res(X1))|~less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))).
12.31/1.91	cnf(i_0_36, plain, (triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|X2=create_slb|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))))).
12.31/1.91	cnf(i_0_371, plain, (X126=X126)).
12.31/1.91	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
12.31/1.91	# Begin printing tableau
12.31/1.91	# Found 5 steps
12.31/1.91	cnf(i_0_15, plain, (isnonempty_slb(insert_slb(X15,pair(X14,X13)))), inference(start_rule)).
12.31/1.91	cnf(i_0_404, plain, (isnonempty_slb(insert_slb(X15,pair(X14,X13)))), inference(extension_rule, [i_0_383])).
12.31/1.91	cnf(i_0_765, plain, (isnonempty_slb(create_slb)), inference(closure_rule, [i_0_12])).
12.31/1.91	cnf(i_0_766, plain, (insert_slb(X15,pair(X14,X13))!=create_slb), inference(extension_rule, [i_0_47])).
12.31/1.91	cnf(i_0_793, plain, (findmin_cpq_res(triple(X4,insert_slb(X15,pair(X14,X13)),X6))=findmin_pqp_res(X4)), inference(etableau_closure_rule, [i_0_793, ...])).
12.31/1.91	# End printing tableau
12.31/1.91	# SZS output end
12.31/1.91	# Branches closed with saturation will be marked with an "s"
12.31/1.92	# Child (14332) has found a proof.
12.31/1.92	
12.31/1.92	# Proof search is over...
12.31/1.92	# Freeing feature tree
12.31/1.94	EOF