0.05/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.30	% Computer   : n003.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1200
0.09/0.30	% WCLimit    : 120
0.09/0.30	% DateTime   : Tue Jul 13 16:36:39 EDT 2021
0.09/0.30	% CPUTime    : 
0.15/0.33	# No SInE strategy applied
0.15/0.33	# Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.15/0.33	# and selection function SelectComplexExceptUniqMaxHorn.
0.15/0.33	#
0.15/0.33	# Presaturation interreduction done
0.15/0.33	# Number of axioms: 46 Number of unprocessed: 45
0.15/0.33	# Tableaux proof search.
0.15/0.33	# APR header successfully linked.
0.15/0.33	# Hello from C++
0.15/0.33	# The folding up rule is enabled...
0.15/0.33	# Local unification is enabled...
0.15/0.33	# Any saturation attempts will use folding labels...
0.15/0.33	# 45 beginning clauses after preprocessing and clausification
0.15/0.33	# Creating start rules for all 4 conjectures.
0.15/0.33	# There are 4 start rule candidates:
0.15/0.33	# Found 10 unit axioms.
0.15/0.33	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.15/0.33	# 4 start rule tableaux created.
0.15/0.33	# 35 extension rule candidate clauses
0.15/0.33	# 10 unit axiom clauses
0.15/0.33	
0.15/0.33	# Requested 8, 32 cores available to the main process.
0.15/0.33	# There are not enough tableaux to fork, creating more from the initial 4
0.15/0.33	# Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
0.15/0.33	# We now have 13 tableaux to operate on
0.15/0.38	# Creating equality axioms
0.15/0.38	# Ran out of tableaux, making start rules for all clauses
0.15/0.38	# There were 1 total branch saturation attempts.
0.15/0.38	# There were 0 of these attempts blocked.
0.15/0.38	# There were 0 deferred branch saturation attempts.
0.15/0.38	# There were 0 free duplicated saturations.
0.15/0.38	# There were 1 total successful branch saturations.
0.15/0.38	# There were 0 successful branch saturations in interreduction.
0.15/0.38	# There were 0 successful branch saturations on the branch.
0.15/0.38	# There were 1 successful branch saturations after the branch.
0.15/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.38	# Begin clausification derivation
0.15/0.38	
0.15/0.38	# End clausification derivation
0.15/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.38	cnf(i_0_9, hypothesis, (aNaturalNumber0(xl))).
0.15/0.38	cnf(i_0_8, hypothesis, (aNaturalNumber0(xn))).
0.15/0.38	cnf(i_0_39, hypothesis, (aNaturalNumber0(xm))).
0.15/0.38	cnf(i_0_32, hypothesis, (sdtlseqdt0(xl,xn))).
0.15/0.38	cnf(i_0_18, plain, (aNaturalNumber0(sz00))).
0.15/0.38	cnf(i_0_23, plain, (aNaturalNumber0(sz10))).
0.15/0.38	cnf(i_0_33, hypothesis, (aNaturalNumber0(esk2_0))).
0.15/0.38	cnf(i_0_34, hypothesis, (sdtpldt0(xl,esk2_0)=xn)).
0.15/0.38	cnf(i_0_35, hypothesis, (xl!=xn)).
0.15/0.38	cnf(i_0_24, plain, (sz10!=sz00)).
0.15/0.38	cnf(i_0_36, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_29, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_28, negated_conjecture, (sdtpldt0(xm,xl)=sdtpldt0(xm,xn)|sdtpldt0(xl,xm)=sdtpldt0(xn,xm)|~sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))|~sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn)))).
0.15/0.38	cnf(i_0_26, negated_conjecture, (sdtpldt0(xm,xl)=sdtpldt0(xm,xn)|sdtpldt0(xl,xm)=sdtpldt0(xn,xm)|sdtpldt0(sdtpldt0(xl,xm),X1)!=sdtpldt0(xn,xm)|~sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_27, negated_conjecture, (sdtpldt0(xm,xl)=sdtpldt0(xm,xn)|sdtpldt0(xl,xm)=sdtpldt0(xn,xm)|sdtpldt0(sdtpldt0(xm,xl),X1)!=sdtpldt0(xm,xn)|~sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_30, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_13, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_14, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_47, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_46, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_7, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
0.15/0.38	cnf(i_0_25, negated_conjecture, (sdtpldt0(xm,xl)=sdtpldt0(xm,xn)|sdtpldt0(xl,xm)=sdtpldt0(xn,xm)|sdtpldt0(sdtpldt0(xl,xm),X1)!=sdtpldt0(xn,xm)|sdtpldt0(sdtpldt0(xm,xl),X2)!=sdtpldt0(xm,xn)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
0.15/0.38	cnf(i_0_45, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
0.15/0.38	cnf(i_0_44, plain, (sz00=X1|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_43, plain, (sz00=X1|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_22, plain, (X1=sz00|X2=sz00|sdtasdt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_19, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_10, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_3, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_40, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))).
0.15/0.38	cnf(i_0_41, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_38, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_1, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
0.15/0.38	cnf(i_0_6, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_42, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_2, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_15, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_17, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_16, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
0.15/0.38	cnf(i_0_5, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_20, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_4, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))).
0.15/0.38	cnf(i_0_31, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3))).
0.15/0.38	cnf(i_0_12, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_11, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))).
0.15/0.38	cnf(i_0_743, plain, (X52=X52)).
0.15/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.38	# Begin printing tableau
0.15/0.38	# Found 8 steps
0.15/0.38	cnf(i_0_743, plain, (sdtpldt0(xl,xl)=sdtpldt0(xl,xl)), inference(start_rule)).
0.15/0.38	cnf(i_0_896, plain, (sdtpldt0(xl,xl)=sdtpldt0(xl,xl)), inference(extension_rule, [i_0_40])).
0.15/0.38	cnf(i_0_944, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_9])).
0.15/0.38	cnf(i_0_945, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_9])).
0.15/0.38	cnf(i_0_946, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_9])).
0.15/0.38	cnf(i_0_942, plain, (xl=xl), inference(extension_rule, [i_0_746])).
0.15/0.38	cnf(i_0_1080, plain, (xl=xn), inference(closure_rule, [i_0_35])).
0.15/0.38	cnf(i_0_1082, plain, (xl!=xn), inference(etableau_closure_rule, [i_0_1082, ...])).
0.15/0.38	# End printing tableau
0.15/0.38	# SZS output end
0.15/0.38	# Branches closed with saturation will be marked with an "s"
0.15/0.38	# Child (22588) has found a proof.
0.15/0.38	
0.15/0.38	# Proof search is over...
0.15/0.38	# Freeing feature tree
0.15/0.38	EOF