0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/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   : n008.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   : Tue Jul 13 16:34:29 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.38	# No SInE strategy applied
0.13/0.38	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.13/0.38	# and selection function SelectCQIPrecW.
0.13/0.38	#
0.13/0.38	# Presaturation interreduction done
0.13/0.38	# Number of axioms: 69 Number of unprocessed: 61
0.13/0.38	# Tableaux proof search.
0.13/0.38	# APR header successfully linked.
0.13/0.38	# Hello from C++
0.51/0.69	# The folding up rule is enabled...
0.51/0.69	# Local unification is enabled...
0.51/0.69	# Any saturation attempts will use folding labels...
0.51/0.69	# 61 beginning clauses after preprocessing and clausification
0.51/0.69	# Creating start rules for all 1 conjectures.
0.51/0.69	# There are 1 start rule candidates:
0.51/0.69	# Found 23 unit axioms.
0.51/0.69	# 1 start rule tableaux created.
0.51/0.69	# 38 extension rule candidate clauses
0.51/0.69	# 23 unit axiom clauses
0.51/0.69	
0.51/0.69	# Requested 8, 32 cores available to the main process.
0.51/0.69	# There are not enough tableaux to fork, creating more from the initial 1
0.51/0.72	# There were 1 total branch saturation attempts.
0.51/0.72	# There were 0 of these attempts blocked.
0.51/0.72	# There were 0 deferred branch saturation attempts.
0.51/0.72	# There were 0 free duplicated saturations.
0.51/0.72	# There were 1 total successful branch saturations.
0.51/0.72	# There were 0 successful branch saturations in interreduction.
0.51/0.72	# There were 0 successful branch saturations on the branch.
0.51/0.72	# There were 1 successful branch saturations after the branch.
0.51/0.72	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.51/0.72	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.51/0.72	# Begin clausification derivation
0.51/0.72	
0.51/0.72	# End clausification derivation
0.51/0.72	# Begin listing active clauses obtained from FOF to CNF conversion
0.51/0.72	cnf(i_0_21, plain, (geq(vd526,vd527))).
0.51/0.72	cnf(i_0_57, plain, (geq(vd529,vd530))).
0.51/0.72	cnf(i_0_34, plain, (geq(X1,v1))).
0.51/0.72	cnf(i_0_68, plain, (vmul(X1,v1)=X1)).
0.51/0.72	cnf(i_0_49, plain, (vmul(v1,X1)=X1)).
0.51/0.72	cnf(i_0_65, plain, (geq(X1,X1))).
0.51/0.72	cnf(i_0_5, plain, (leq(X1,X1))).
0.51/0.72	cnf(i_0_3, plain, (greater(vplus(X1,X2),X1))).
0.51/0.72	cnf(i_0_20, plain, (vmul(vmul(X1,X2),X3)=vmul(X1,vmul(X2,X3)))).
0.51/0.72	cnf(i_0_61, plain, (less(X1,vplus(X1,X2)))).
0.51/0.72	cnf(i_0_33, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
0.51/0.72	cnf(i_0_71, plain, (vplus(vmul(X1,X2),vmul(X1,X3))=vmul(X1,vplus(X2,X3)))).
0.51/0.72	cnf(i_0_28, plain, (vmul(X1,X2)=vmul(X2,X1))).
0.51/0.72	cnf(i_0_67, plain, (vplus(X1,X2)=vplus(X2,X1))).
0.51/0.72	cnf(i_0_69, plain, (vplus(X1,vmul(X1,X2))=vmul(X1,vplus(X2,v1)))).
0.51/0.72	cnf(i_0_39, plain, (vmul(vplus(X1,v1),X2)=vplus(X2,vmul(X1,X2)))).
0.51/0.72	cnf(i_0_40, negated_conjecture, (~geq(vmul(vd526,vd529),vmul(vd527,vd530)))).
0.51/0.72	cnf(i_0_70, plain, (vplus(X1,v1)!=v1)).
0.51/0.72	cnf(i_0_25, plain, (vplus(X1,X2)!=X2)).
0.51/0.72	cnf(i_0_1, plain, (vplus(X1,v1)!=X1)).
0.51/0.72	cnf(i_0_29, plain, (~greater(X1,X1))).
0.51/0.72	cnf(i_0_11, plain, (~less(X1,X1))).
0.51/0.72	cnf(i_0_41, plain, (vplus(X1,X2)!=X1)).
0.51/0.72	cnf(i_0_46, plain, (~less(X1,X2)|~greater(X1,X2))).
0.51/0.72	cnf(i_0_26, plain, (geq(X1,X2)|~leq(X2,X1))).
0.51/0.72	cnf(i_0_64, plain, (geq(X1,X2)|~greater(X1,X2))).
0.51/0.72	cnf(i_0_15, plain, (leq(X1,X2)|~geq(X2,X1))).
0.51/0.72	cnf(i_0_63, plain, (greater(X1,X2)|~less(X2,X1))).
0.51/0.72	cnf(i_0_4, plain, (leq(X1,X2)|~less(X1,X2))).
0.51/0.72	cnf(i_0_42, plain, (less(X1,X2)|~greater(X2,X1))).
0.51/0.72	cnf(i_0_2, plain, (X1=X2|vmul(X1,X3)!=vmul(X2,X3))).
0.51/0.72	cnf(i_0_66, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))).
0.51/0.72	cnf(i_0_45, plain, (leq(X1,X2)|~less(X1,vplus(X2,v1)))).
0.51/0.72	cnf(i_0_37, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)).
0.51/0.72	cnf(i_0_35, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))).
0.51/0.72	cnf(i_0_56, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))).
0.51/0.72	cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))).
0.51/0.72	cnf(i_0_17, plain, (geq(X1,vplus(X2,v1))|~greater(X1,X2))).
0.51/0.72	cnf(i_0_38, plain, (greater(X1,X2)|~greater(vmul(X1,X3),vmul(X2,X3)))).
0.51/0.72	cnf(i_0_72, plain, (less(X1,X2)|~less(vmul(X1,X3),vmul(X2,X3)))).
0.51/0.72	cnf(i_0_62, plain, (X1=X2|less(X1,X2)|greater(X1,X2))).
0.51/0.72	cnf(i_0_16, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))).
0.51/0.72	cnf(i_0_24, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))).
0.51/0.72	cnf(i_0_14, plain, (leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2))).
0.51/0.72	cnf(i_0_8, plain, (vplus(X1,esk1_2(X1,X2))=X2|~greater(X2,X1))).
0.51/0.72	cnf(i_0_48, plain, (greater(vmul(X1,X2),vmul(X3,X2))|~greater(X1,X3))).
0.51/0.72	cnf(i_0_18, plain, (less(vmul(X1,X2),vmul(X3,X2))|~less(X1,X3))).
0.51/0.72	cnf(i_0_60, plain, (vplus(X1,esk4_2(X2,X1))=X2|~less(X1,X2))).
0.51/0.72	cnf(i_0_58, plain, (less(X1,X2)|~less(X3,X2)|~leq(X1,X3))).
0.51/0.72	cnf(i_0_59, plain, (less(X1,X2)|~less(X1,X3)|~leq(X3,X2))).
0.51/0.72	cnf(i_0_47, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))).
0.51/0.72	cnf(i_0_23, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))).
0.51/0.72	cnf(i_0_36, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))).
0.51/0.72	cnf(i_0_52, plain, (greater(vmul(X1,X2),vmul(X3,X4))|~geq(X1,X3)|~greater(X2,X4))).
0.51/0.72	cnf(i_0_51, plain, (greater(vmul(X1,X2),vmul(X3,X4))|~geq(X2,X4)|~greater(X1,X3))).
0.51/0.72	cnf(i_0_32, plain, (greater(vmul(X1,X2),vmul(X3,X4))|~greater(X2,X4)|~greater(X1,X3))).
0.51/0.72	cnf(i_0_12, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X2,X4)|~greater(X1,X3))).
0.51/0.72	cnf(i_0_13, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X1,X3)|~greater(X2,X4))).
0.51/0.72	cnf(i_0_54, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~greater(X2,X4)|~greater(X1,X3))).
0.51/0.72	cnf(i_0_53, plain, (geq(vplus(X1,X2),vplus(X3,X4))|~geq(X2,X4)|~geq(X1,X3))).
0.51/0.72	cnf(i_0_50, plain, (vplus(X1,esk2_2(X2,X1))=X2|vplus(X2,esk3_2(X2,X1))=X1|X1=X2)).
0.51/0.72	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.51/0.72	# Begin printing tableau
0.51/0.72	# Found 4 steps
0.51/0.72	cnf(i_0_40, negated_conjecture, (~geq(vmul(vd526,vd529),vmul(vd527,vd530))), inference(start_rule)).
0.51/0.72	cnf(i_0_82, plain, (~geq(vmul(vd526,vd529),vmul(vd527,vd530))), inference(extension_rule, [i_0_64])).
0.51/0.72	cnf(i_0_88, plain, (~greater(vmul(vd526,vd529),vmul(vd527,vd530))), inference(extension_rule, [i_0_63])).
0.51/0.72	cnf(i_0_183, plain, (~less(vmul(vd527,vd530),vmul(vd526,vd529))), inference(etableau_closure_rule, [i_0_183, ...])).
0.51/0.72	# End printing tableau
0.51/0.72	# SZS output end
0.51/0.72	# Branches closed with saturation will be marked with an "s"
0.51/0.72	# Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
0.51/0.72	# We now have 2 tableaux to operate on
0.51/0.72	# Found closed tableau during pool population.
0.51/0.72	# Proof search is over...
0.51/0.72	# Freeing feature tree
0.56/0.72	EOF