0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.32	% Computer   : n029.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1200
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Jul 13 16:43:40 EDT 2021
0.11/0.32	% CPUTime    : 
0.11/0.36	# No SInE strategy applied
0.11/0.36	# Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.11/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.11/0.36	#
0.11/0.36	# Presaturation interreduction done
0.11/0.36	# Number of axioms: 70 Number of unprocessed: 59
0.11/0.36	# Tableaux proof search.
0.11/0.36	# APR header successfully linked.
0.11/0.36	# Hello from C++
0.11/0.37	# The folding up rule is enabled...
0.11/0.37	# Local unification is enabled...
0.11/0.37	# Any saturation attempts will use folding labels...
0.11/0.37	# 59 beginning clauses after preprocessing and clausification
0.11/0.37	# Creating start rules for all 1 conjectures.
0.11/0.37	# There are 1 start rule candidates:
0.11/0.37	# Found 24 unit axioms.
0.11/0.37	# 1 start rule tableaux created.
0.11/0.37	# 35 extension rule candidate clauses
0.11/0.37	# 24 unit axiom clauses
0.11/0.37	
0.11/0.37	# Requested 8, 32 cores available to the main process.
0.11/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.11/0.37	# There were 1 total branch saturation attempts.
0.11/0.37	# There were 0 of these attempts blocked.
0.11/0.37	# There were 0 deferred branch saturation attempts.
0.11/0.37	# There were 0 free duplicated saturations.
0.11/0.37	# There were 1 total successful branch saturations.
0.11/0.37	# There were 0 successful branch saturations in interreduction.
0.11/0.37	# There were 0 successful branch saturations on the branch.
0.11/0.37	# There were 1 successful branch saturations after the branch.
0.11/0.37	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.11/0.37	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.11/0.37	# Begin clausification derivation
0.11/0.37	
0.11/0.37	# End clausification derivation
0.11/0.37	# Begin listing active clauses obtained from FOF to CNF conversion
0.11/0.37	cnf(i_0_69, plain, (greater(vd511,vd512))).
0.11/0.37	cnf(i_0_52, plain, (greater(vd508,vd509))).
0.11/0.37	cnf(i_0_10, plain, (geq(X1,v1))).
0.11/0.37	cnf(i_0_22, plain, (vmul(X1,v1)=X1)).
0.11/0.37	cnf(i_0_18, plain, (vmul(v1,X1)=X1)).
0.11/0.37	cnf(i_0_14, plain, (greater(vmul(vd511,vd509),vmul(vd512,vd509)))).
0.11/0.37	cnf(i_0_65, plain, (geq(X1,X1))).
0.11/0.37	cnf(i_0_45, plain, (leq(X1,X1))).
0.11/0.37	cnf(i_0_8, plain, (greater(vplus(X1,X2),X1))).
0.11/0.37	cnf(i_0_16, plain, (greater(vmul(vd511,vd508),vmul(vd511,vd509)))).
0.11/0.37	cnf(i_0_58, plain, (less(X1,vplus(X1,X2)))).
0.11/0.37	cnf(i_0_55, plain, (vmul(vmul(X1,X2),X3)=vmul(X1,vmul(X2,X3)))).
0.11/0.37	cnf(i_0_47, plain, (vplus(vmul(X1,X2),vmul(X1,X3))=vmul(X1,vplus(X2,X3)))).
0.11/0.37	cnf(i_0_6, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
0.11/0.37	cnf(i_0_48, plain, (vmul(X1,X2)=vmul(X2,X1))).
0.11/0.37	cnf(i_0_37, plain, (vplus(X1,X2)=vplus(X2,X1))).
0.11/0.37	cnf(i_0_7, plain, (vplus(X1,vmul(X2,X1))=vmul(vplus(X2,v1),X1))).
0.11/0.37	cnf(i_0_23, plain, (vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2)))).
0.11/0.37	cnf(i_0_29, plain, (vplus(X1,X2)!=X2)).
0.11/0.37	cnf(i_0_40, plain, (vplus(X1,v1)!=X1)).
0.11/0.37	cnf(i_0_12, plain, (~greater(X1,X1))).
0.11/0.37	cnf(i_0_28, plain, (~less(X1,X1))).
0.11/0.37	cnf(i_0_19, plain, (vplus(X1,X2)!=X1)).
0.11/0.37	cnf(i_0_51, negated_conjecture, (~greater(vmul(vd511,vd508),vmul(vd512,vd509)))).
0.11/0.37	cnf(i_0_27, plain, (~less(X1,X2)|~greater(X1,X2))).
0.11/0.37	cnf(i_0_56, plain, (less(X1,X2)|~greater(X2,X1))).
0.11/0.37	cnf(i_0_66, plain, (geq(X1,X2)|~greater(X1,X2))).
0.11/0.37	cnf(i_0_72, plain, (greater(X1,X2)|~less(X2,X1))).
0.11/0.37	cnf(i_0_42, plain, (geq(X1,X2)|~leq(X2,X1))).
0.11/0.37	cnf(i_0_9, plain, (leq(X1,X2)|~geq(X2,X1))).
0.11/0.37	cnf(i_0_71, plain, (X1=X2|vmul(X1,X3)!=vmul(X2,X3))).
0.11/0.37	cnf(i_0_43, plain, (greater(X1,X2)|~greater(vmul(X1,X3),vmul(X2,X3)))).
0.11/0.37	cnf(i_0_46, plain, (leq(X1,X2)|~less(X1,X2))).
0.11/0.37	cnf(i_0_36, plain, (leq(X1,X2)|~less(X1,vplus(X2,v1)))).
0.11/0.37	cnf(i_0_53, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))).
0.11/0.37	cnf(i_0_64, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))).
0.11/0.37	cnf(i_0_73, plain, (greater(vmul(X1,X2),vmul(X3,X2))|~greater(X1,X3))).
0.11/0.37	cnf(i_0_1, plain, (vplus(v1,vskolem2(X1))=X1|v1=X1)).
0.11/0.37	cnf(i_0_3, plain, (X1=X2|less(X1,X2)|greater(X1,X2))).
0.11/0.37	cnf(i_0_68, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))).
0.11/0.37	cnf(i_0_44, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))).
0.11/0.37	cnf(i_0_67, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))).
0.11/0.37	cnf(i_0_21, plain, (less(X1,X2)|~less(vmul(X1,X3),vmul(X2,X3)))).
0.11/0.37	cnf(i_0_50, plain, (geq(X1,vplus(X2,v1))|~greater(X1,X2))).
0.11/0.37	cnf(i_0_25, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))).
0.11/0.37	cnf(i_0_38, plain, (vplus(X1,esk3_2(X1,X2))=X2|~greater(X2,X1))).
0.11/0.37	cnf(i_0_4, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))).
0.11/0.37	cnf(i_0_15, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))).
0.11/0.37	cnf(i_0_26, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))).
0.11/0.37	cnf(i_0_60, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))).
0.11/0.37	cnf(i_0_59, plain, (vplus(X1,esk4_2(X2,X1))=X2|~less(X1,X2))).
0.11/0.37	cnf(i_0_35, plain, (less(vmul(X1,X2),vmul(X3,X2))|~less(X1,X3))).
0.11/0.37	cnf(i_0_57, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))).
0.11/0.37	cnf(i_0_2, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~greater(X1,X3)|~greater(X2,X4))).
0.11/0.37	cnf(i_0_11, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))).
0.11/0.37	cnf(i_0_62, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X1,X3)|~greater(X2,X4))).
0.11/0.37	cnf(i_0_61, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~geq(X2,X4)|~greater(X1,X3))).
0.11/0.37	cnf(i_0_54, plain, (geq(vplus(X1,X2),vplus(X3,X4))|~geq(X2,X4)|~geq(X1,X3))).
0.11/0.37	cnf(i_0_32, plain, (vplus(X1,esk1_2(X2,X1))=X2|vplus(X2,esk2_2(X2,X1))=X1|X1=X2)).
0.11/0.37	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.11/0.37	# Begin printing tableau
0.11/0.37	# Found 4 steps
0.11/0.37	cnf(i_0_51, negated_conjecture, (~greater(vmul(vd511,vd508),vmul(vd512,vd509))), inference(start_rule)).
0.11/0.37	cnf(i_0_83, plain, (~greater(vmul(vd511,vd508),vmul(vd512,vd509))), inference(extension_rule, [i_0_67])).
0.11/0.37	cnf(i_0_122, plain, (~greater(vplus(vmul(vd511,vd508),X5),vplus(vmul(vd512,vd509),X5))), inference(extension_rule, [i_0_72])).
0.11/0.37	cnf(i_0_173, plain, (~less(vplus(vmul(vd512,vd509),X5),vplus(vmul(vd511,vd508),X5))), inference(etableau_closure_rule, [i_0_173, ...])).
0.11/0.37	# End printing tableau
0.11/0.37	# SZS output end
0.11/0.37	# Branches closed with saturation will be marked with an "s"
0.11/0.37	# Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
0.11/0.37	# We now have 5 tableaux to operate on
0.11/0.37	# Found closed tableau during pool population.
0.11/0.37	# Proof search is over...
0.11/0.37	# Freeing feature tree
0.11/0.37	EOF