0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.34	% Computer   : n005.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 16:37:48 EDT 2021
0.12/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.19/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 33 Number of unprocessed: 33
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.37	# The folding up rule is enabled...
0.19/0.37	# Local unification is enabled...
0.19/0.37	# Any saturation attempts will use folding labels...
0.19/0.37	# 33 beginning clauses after preprocessing and clausification
0.19/0.37	# Creating start rules for all 6 conjectures.
0.19/0.37	# There are 6 start rule candidates:
0.19/0.37	# Found 23 unit axioms.
0.19/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.37	# 6 start rule tableaux created.
0.19/0.37	# 10 extension rule candidate clauses
0.19/0.37	# 23 unit axiom clauses
0.19/0.37	
0.19/0.37	# Requested 8, 32 cores available to the main process.
0.19/0.37	# There are not enough tableaux to fork, creating more from the initial 6
0.19/0.37	# Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 11 tableaux to operate on
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
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	# Creating equality axioms
0.19/0.38	# Ran out of tableaux, making start rules for all clauses
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# Begin clausification derivation
0.19/0.38	
0.19/0.38	# End clausification derivation
0.19/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.38	cnf(i_0_45, negated_conjecture, (esk21_0=esk22_0)).
0.19/0.38	cnf(i_0_44, negated_conjecture, (r1(esk22_0))).
0.19/0.38	cnf(i_0_42, negated_conjecture, (r1(esk24_0))).
0.19/0.38	cnf(i_0_40, negated_conjecture, (r1(esk25_0))).
0.19/0.38	cnf(i_0_41, negated_conjecture, (r2(esk25_0,esk23_0))).
0.19/0.38	cnf(i_0_25, plain, (r1(esk12_0))).
0.19/0.38	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.19/0.38	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.19/0.38	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.19/0.38	cnf(i_0_43, negated_conjecture, (r3(esk24_0,esk23_0,esk22_0))).
0.19/0.38	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.19/0.38	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.19/0.38	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.19/0.38	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.19/0.38	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.19/0.38	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.19/0.38	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.19/0.38	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.19/0.38	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.19/0.38	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.19/0.38	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.38	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.38	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.19/0.38	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.38	cnf(i_0_232, plain, (X92=X92)).
0.19/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.38	# Begin printing tableau
0.19/0.38	# Found 11 steps
0.19/0.38	cnf(i_0_232, plain, (esk22_0=esk22_0), inference(start_rule)).
0.19/0.38	cnf(i_0_284, plain, (esk22_0=esk22_0), inference(extension_rule, [i_0_236])).
0.19/0.38	cnf(i_0_315, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_313, plain, (r2(esk22_0,esk22_0)), inference(extension_rule, [i_0_36])).
0.19/0.38	cnf(i_0_317, plain, (esk20_1(esk22_0)=esk22_0), inference(extension_rule, [i_0_235])).
0.19/0.38	cnf(i_0_344, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_316, plain, (~r2(esk22_0,esk21_0)), inference(extension_rule, [i_0_236])).
0.19/0.38	cnf(i_0_382, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_383, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_342, plain, (esk20_1(esk22_0)=esk21_0), inference(etableau_closure_rule, [i_0_342, ...])).
0.19/0.38	cnf(i_0_384, plain, (~r2(esk21_0,esk22_0)), inference(etableau_closure_rule, [i_0_384, ...])).
0.19/0.38	# End printing tableau
0.19/0.38	# SZS output end
0.19/0.38	# Branches closed with saturation will be marked with an "s"
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# Begin clausification derivation
0.19/0.38	
0.19/0.38	# End clausification derivation
0.19/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.38	cnf(i_0_45, negated_conjecture, (esk21_0=esk22_0)).
0.19/0.38	cnf(i_0_44, negated_conjecture, (r1(esk22_0))).
0.19/0.38	cnf(i_0_42, negated_conjecture, (r1(esk24_0))).
0.19/0.38	cnf(i_0_40, negated_conjecture, (r1(esk25_0))).
0.19/0.38	cnf(i_0_41, negated_conjecture, (r2(esk25_0,esk23_0))).
0.19/0.38	cnf(i_0_25, plain, (r1(esk12_0))).
0.19/0.38	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.19/0.38	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.19/0.38	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.19/0.38	cnf(i_0_43, negated_conjecture, (r3(esk24_0,esk23_0,esk22_0))).
0.19/0.38	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.19/0.38	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.19/0.38	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.19/0.38	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.19/0.38	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.19/0.38	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.19/0.38	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.19/0.38	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.19/0.38	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.19/0.38	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.19/0.38	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.38	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.38	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.19/0.38	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.38	cnf(i_0_184, plain, (X92=X92)).
0.19/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.38	# Begin printing tableau
0.19/0.38	# Found 11 steps
0.19/0.38	cnf(i_0_184, plain, (esk22_0=esk22_0), inference(start_rule)).
0.19/0.38	cnf(i_0_236, plain, (esk22_0=esk22_0), inference(extension_rule, [i_0_188])).
0.19/0.38	cnf(i_0_267, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_265, plain, (r2(esk22_0,esk22_0)), inference(extension_rule, [i_0_36])).
0.19/0.38	cnf(i_0_271, plain, (esk20_1(esk22_0)=esk22_0), inference(extension_rule, [i_0_187])).
0.19/0.38	cnf(i_0_298, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_268, plain, (~r2(esk22_0,esk21_0)), inference(extension_rule, [i_0_188])).
0.19/0.38	cnf(i_0_336, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_337, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_296, plain, (esk20_1(esk22_0)=esk21_0), inference(etableau_closure_rule, [i_0_296, ...])).
0.19/0.38	cnf(i_0_338, plain, (~r2(esk21_0,esk22_0)), inference(etableau_closure_rule, [i_0_338, ...])).
0.19/0.38	# End printing tableau
0.19/0.38	# SZS output end
0.19/0.38	# Branches closed with saturation will be marked with an "s"
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# Begin clausification derivation
0.19/0.38	
0.19/0.38	# End clausification derivation
0.19/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.38	cnf(i_0_45, negated_conjecture, (esk21_0=esk22_0)).
0.19/0.38	cnf(i_0_44, negated_conjecture, (r1(esk22_0))).
0.19/0.38	cnf(i_0_42, negated_conjecture, (r1(esk24_0))).
0.19/0.38	cnf(i_0_40, negated_conjecture, (r1(esk25_0))).
0.19/0.38	cnf(i_0_41, negated_conjecture, (r2(esk25_0,esk23_0))).
0.19/0.38	cnf(i_0_25, plain, (r1(esk12_0))).
0.19/0.38	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.19/0.38	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.19/0.38	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.19/0.38	cnf(i_0_43, negated_conjecture, (r3(esk24_0,esk23_0,esk22_0))).
0.19/0.38	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.19/0.38	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.19/0.38	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.19/0.38	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.19/0.38	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.19/0.38	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.19/0.38	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.19/0.38	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.19/0.38	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.19/0.38	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.19/0.38	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.38	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.38	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.19/0.38	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.38	cnf(i_0_163, plain, (X92=X92)).
0.19/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.38	# Begin printing tableau
0.19/0.38	# Found 11 steps
0.19/0.38	cnf(i_0_163, plain, (esk22_0=esk22_0), inference(start_rule)).
0.19/0.38	cnf(i_0_215, plain, (esk22_0=esk22_0), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_246, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_244, plain, (r2(esk22_0,esk22_0)), inference(extension_rule, [i_0_36])).
0.19/0.38	cnf(i_0_250, plain, (esk20_1(esk22_0)=esk22_0), inference(extension_rule, [i_0_166])).
0.19/0.38	cnf(i_0_277, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_247, plain, (~r2(esk22_0,esk21_0)), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_315, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_316, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_275, plain, (esk20_1(esk22_0)=esk21_0), inference(etableau_closure_rule, [i_0_275, ...])).
0.19/0.38	cnf(i_0_317, plain, (~r2(esk21_0,esk22_0)), inference(etableau_closure_rule, [i_0_317, ...])).
0.19/0.38	# End printing tableau
0.19/0.38	# SZS output end
0.19/0.38	# Branches closed with saturation will be marked with an "s"
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# Begin clausification derivation
0.19/0.38	
0.19/0.38	# End clausification derivation
0.19/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.38	cnf(i_0_45, negated_conjecture, (esk21_0=esk22_0)).
0.19/0.38	cnf(i_0_44, negated_conjecture, (r1(esk22_0))).
0.19/0.38	cnf(i_0_42, negated_conjecture, (r1(esk24_0))).
0.19/0.38	cnf(i_0_40, negated_conjecture, (r1(esk25_0))).
0.19/0.38	cnf(i_0_41, negated_conjecture, (r2(esk25_0,esk23_0))).
0.19/0.38	cnf(i_0_25, plain, (r1(esk12_0))).
0.19/0.38	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.19/0.38	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.19/0.38	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.19/0.38	cnf(i_0_43, negated_conjecture, (r3(esk24_0,esk23_0,esk22_0))).
0.19/0.38	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.19/0.38	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.19/0.38	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.19/0.38	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.19/0.38	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.19/0.38	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.19/0.38	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.19/0.38	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.19/0.38	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.19/0.38	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.19/0.38	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.38	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.38	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.19/0.38	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.38	cnf(i_0_163, plain, (X92=X92)).
0.19/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.38	# Begin printing tableau
0.19/0.38	# Found 11 steps
0.19/0.38	cnf(i_0_163, plain, (esk22_0=esk22_0), inference(start_rule)).
0.19/0.38	cnf(i_0_215, plain, (esk22_0=esk22_0), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_246, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_244, plain, (r2(esk22_0,esk22_0)), inference(extension_rule, [i_0_36])).
0.19/0.38	cnf(i_0_250, plain, (esk20_1(esk22_0)=esk22_0), inference(extension_rule, [i_0_166])).
0.19/0.38	cnf(i_0_277, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_247, plain, (~r2(esk22_0,esk21_0)), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_315, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_316, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_275, plain, (esk20_1(esk22_0)=esk21_0), inference(etableau_closure_rule, [i_0_275, ...])).
0.19/0.38	cnf(i_0_317, plain, (~r2(esk21_0,esk22_0)), inference(etableau_closure_rule, [i_0_317, ...])).
0.19/0.38	# End printing tableau
0.19/0.38	# SZS output end
0.19/0.38	# Branches closed with saturation will be marked with an "s"
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# Begin clausification derivation
0.19/0.38	
0.19/0.38	# End clausification derivation
0.19/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.38	cnf(i_0_45, negated_conjecture, (esk21_0=esk22_0)).
0.19/0.38	cnf(i_0_44, negated_conjecture, (r1(esk22_0))).
0.19/0.38	cnf(i_0_42, negated_conjecture, (r1(esk24_0))).
0.19/0.38	cnf(i_0_40, negated_conjecture, (r1(esk25_0))).
0.19/0.38	cnf(i_0_41, negated_conjecture, (r2(esk25_0,esk23_0))).
0.19/0.38	cnf(i_0_25, plain, (r1(esk12_0))).
0.19/0.38	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.19/0.38	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.19/0.38	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.19/0.38	cnf(i_0_43, negated_conjecture, (r3(esk24_0,esk23_0,esk22_0))).
0.19/0.38	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.19/0.38	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.19/0.38	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.19/0.38	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.19/0.38	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.19/0.38	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.19/0.38	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.19/0.38	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.19/0.38	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.19/0.38	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.19/0.38	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.38	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.38	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.19/0.38	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.38	cnf(i_0_163, plain, (X92=X92)).
0.19/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.38	# Begin printing tableau
0.19/0.38	# Found 11 steps
0.19/0.38	cnf(i_0_163, plain, (esk22_0=esk22_0), inference(start_rule)).
0.19/0.38	cnf(i_0_215, plain, (esk22_0=esk22_0), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_246, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_244, plain, (r2(esk22_0,esk22_0)), inference(extension_rule, [i_0_36])).
0.19/0.38	cnf(i_0_250, plain, (esk20_1(esk22_0)=esk22_0), inference(extension_rule, [i_0_166])).
0.19/0.38	cnf(i_0_277, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_247, plain, (~r2(esk22_0,esk21_0)), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_315, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_316, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_275, plain, (esk20_1(esk22_0)=esk21_0), inference(etableau_closure_rule, [i_0_275, ...])).
0.19/0.38	cnf(i_0_317, plain, (~r2(esk21_0,esk22_0)), inference(etableau_closure_rule, [i_0_317, ...])).
0.19/0.38	# End printing tableau
0.19/0.38	# SZS output end
0.19/0.38	# Branches closed with saturation will be marked with an "s"
0.19/0.38	# There were 2 total branch saturation attempts.
0.19/0.38	# There were 0 of these attempts blocked.
0.19/0.38	# There were 0 deferred branch saturation attempts.
0.19/0.38	# There were 0 free duplicated saturations.
0.19/0.38	# There were 2 total successful branch saturations.
0.19/0.38	# There were 0 successful branch saturations in interreduction.
0.19/0.38	# There were 0 successful branch saturations on the branch.
0.19/0.38	# There were 2 successful branch saturations after the branch.
0.19/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.38	# Begin clausification derivation
0.19/0.38	
0.19/0.38	# End clausification derivation
0.19/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.38	cnf(i_0_45, negated_conjecture, (esk21_0=esk22_0)).
0.19/0.38	cnf(i_0_44, negated_conjecture, (r1(esk22_0))).
0.19/0.38	cnf(i_0_42, negated_conjecture, (r1(esk24_0))).
0.19/0.38	cnf(i_0_40, negated_conjecture, (r1(esk25_0))).
0.19/0.38	cnf(i_0_41, negated_conjecture, (r2(esk25_0,esk23_0))).
0.19/0.38	cnf(i_0_25, plain, (r1(esk12_0))).
0.19/0.38	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.19/0.38	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.19/0.38	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.19/0.38	cnf(i_0_43, negated_conjecture, (r3(esk24_0,esk23_0,esk22_0))).
0.19/0.38	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.19/0.38	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.19/0.38	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.19/0.38	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.19/0.38	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.19/0.38	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.19/0.38	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.19/0.38	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.19/0.38	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.19/0.38	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.19/0.38	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.19/0.38	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.38	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.19/0.38	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.38	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.38	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.19/0.38	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.19/0.38	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.38	cnf(i_0_163, plain, (X92=X92)).
0.19/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.38	# Begin printing tableau
0.19/0.38	# Found 11 steps
0.19/0.38	cnf(i_0_163, plain, (esk22_0=esk22_0), inference(start_rule)).
0.19/0.38	cnf(i_0_215, plain, (esk22_0=esk22_0), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_246, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_244, plain, (r2(esk22_0,esk22_0)), inference(extension_rule, [i_0_36])).
0.19/0.38	cnf(i_0_250, plain, (esk20_1(esk22_0)=esk22_0), inference(extension_rule, [i_0_166])).
0.19/0.38	cnf(i_0_277, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_247, plain, (~r2(esk22_0,esk21_0)), inference(extension_rule, [i_0_167])).
0.19/0.38	cnf(i_0_315, plain, (esk21_0!=esk22_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_316, plain, (esk22_0!=esk21_0), inference(closure_rule, [i_0_45])).
0.19/0.38	cnf(i_0_275, plain, (esk20_1(esk22_0)=esk21_0), inference(etableau_closure_rule, [i_0_275, ...])).
0.19/0.38	cnf(i_0_317, plain, (~r2(esk21_0,esk22_0)), inference(etableau_closure_rule, [i_0_317, ...])).
0.19/0.38	# End printing tableau
0.19/0.38	# SZS output end
0.19/0.38	# Branches closed with saturation will be marked with an "s"
0.19/0.38	# Child (15276) has found a proof.
0.19/0.38	
0.19/0.38	# Proof search is over...
0.19/0.38	# Freeing feature tree
0.19/0.38	EOF