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