0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.33 Computer : n027.cluster.edu 0.13/0.33 Model : x86_64 x86_64 0.13/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 RAMPerCPU : 8042.1875MB 0.13/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 02:52:51 EDT 2022 0.13/0.33 % CPUTime : 0.18/0.36 # No SInE strategy applied 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. 0.18/0.36 # 0.18/0.36 # Presaturation interreduction done 0.18/0.36 # Number of axioms: 51 Number of unprocessed: 40 0.18/0.36 # Tableaux proof search. 0.18/0.36 # APR header successfully linked. 0.18/0.36 # Hello from C++ 0.18/0.36 # The folding up rule is enabled... 0.18/0.36 # Local unification is enabled... 0.18/0.36 # Any saturation attempts will use folding labels... 0.18/0.36 # 40 beginning clauses after preprocessing and clausification 0.18/0.36 # Creating start rules for all 1 conjectures. 0.18/0.36 # There are 1 start rule candidates: 0.18/0.36 # Found 16 unit axioms. 0.18/0.36 # 1 start rule tableaux created. 0.18/0.36 # 24 extension rule candidate clauses 0.18/0.36 # 16 unit axiom clauses 0.18/0.36 0.18/0.36 # Requested 8, 32 cores available to the main process. 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 0.18/0.38 # There were 2 total branch saturation attempts. 0.18/0.38 # There were 0 of these attempts blocked. 0.18/0.38 # There were 0 deferred branch saturation attempts. 0.18/0.38 # There were 0 free duplicated saturations. 0.18/0.38 # There were 2 total successful branch saturations. 0.18/0.38 # There were 0 successful branch saturations in interreduction. 0.18/0.38 # There were 0 successful branch saturations on the branch. 0.18/0.38 # There were 2 successful branch saturations after the branch. 0.18/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.38 # Begin clausification derivation 0.18/0.38 0.18/0.38 # End clausification derivation 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion 0.18/0.38 cnf(i_0_46, plain, (greater(vd347,vd348))). 0.18/0.38 cnf(i_0_53, plain, (greater(vd344,vd345))). 0.18/0.38 cnf(i_0_32, plain, (leq(X1,X1))). 0.18/0.38 cnf(i_0_3, plain, (greater(vplus(vd347,vd345),vplus(vd348,vd345)))). 0.18/0.38 cnf(i_0_28, plain, (greater(vplus(X1,X2),X1))). 0.18/0.38 cnf(i_0_39, plain, (geq(X1,X1))). 0.18/0.38 cnf(i_0_50, plain, (greater(vplus(vd347,vd344),vplus(vd347,vd345)))). 0.18/0.38 cnf(i_0_43, plain, (less(X1,vplus(X1,X2)))). 0.18/0.38 cnf(i_0_44, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))). 0.18/0.38 cnf(i_0_11, plain, (vplus(X1,X2)=vplus(X2,X1))). 0.18/0.38 cnf(i_0_19, plain, (vplus(X1,X2)!=X2)). 0.18/0.38 cnf(i_0_45, plain, (~greater(X1,X1))). 0.18/0.38 cnf(i_0_22, plain, (vplus(v1,X1)!=v1)). 0.18/0.38 cnf(i_0_33, plain, (~less(X1,X1))). 0.18/0.38 cnf(i_0_13, plain, (vplus(X1,X2)!=X1)). 0.18/0.38 cnf(i_0_21, negated_conjecture, (~greater(vplus(vd347,vd344),vplus(vd348,vd345)))). 0.18/0.38 cnf(i_0_4, plain, (~less(X1,X2)|~greater(X1,X2))). 0.18/0.38 cnf(i_0_52, plain, (less(X1,X2)|~greater(X2,X1))). 0.18/0.38 cnf(i_0_40, plain, (geq(X1,X2)|~greater(X1,X2))). 0.18/0.38 cnf(i_0_18, plain, (greater(X1,X2)|~less(X2,X1))). 0.18/0.38 cnf(i_0_10, plain, (vplus(v1,vskolem2(X1))=X1|v1=X1)). 0.18/0.38 cnf(i_0_29, plain, (leq(X1,X2)|~geq(X2,X1))). 0.18/0.38 cnf(i_0_31, plain, (leq(X1,X2)|~less(X1,X2))). 0.18/0.38 cnf(i_0_51, plain, (geq(X1,X2)|~leq(X2,X1))). 0.18/0.38 cnf(i_0_41, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))). 0.18/0.38 cnf(i_0_23, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))). 0.18/0.38 cnf(i_0_30, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). 0.18/0.38 cnf(i_0_15, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))). 0.18/0.38 cnf(i_0_38, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))). 0.18/0.38 cnf(i_0_24, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))). 0.18/0.38 cnf(i_0_49, plain, (X1=X2|less(X1,X2)|greater(X1,X2))). 0.18/0.38 cnf(i_0_6, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))). 0.18/0.38 cnf(i_0_25, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). 0.18/0.38 cnf(i_0_26, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). 0.18/0.38 cnf(i_0_47, plain, (vplus(X1,esk4_2(X1,X2))=X2|~greater(X2,X1))). 0.18/0.38 cnf(i_0_42, plain, (vplus(X1,esk3_2(X2,X1))=X2|~less(X1,X2))). 0.18/0.38 cnf(i_0_35, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))). 0.18/0.38 cnf(i_0_27, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). 0.18/0.38 cnf(i_0_20, plain, (leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2))). 0.18/0.38 cnf(i_0_9, plain, (vplus(X1,esk2_2(X1,X2))=X2|vplus(X2,esk1_2(X1,X2))=X1|X1=X2)). 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.18/0.38 # Begin printing tableau 0.18/0.38 # Found 5 steps 0.18/0.38 cnf(i_0_21, negated_conjecture, (~greater(vplus(vd347,vd344),vplus(vd348,vd345))), inference(start_rule)). 0.18/0.38 cnf(i_0_63, plain, (~greater(vplus(vd347,vd344),vplus(vd348,vd345))), inference(extension_rule, [i_0_49])). 0.18/0.38 cnf(i_0_95, plain, (less(vplus(vd347,vd344),vplus(vd348,vd345))), inference(extension_rule, [i_0_18])). 0.18/0.38 cnf(i_0_94, plain, (vplus(vd348,vd345)=vplus(vd347,vd344)), inference(etableau_closure_rule, [i_0_94, ...])). 0.18/0.38 cnf(i_0_182, plain, (greater(vplus(vd348,vd345),vplus(vd347,vd344))), inference(etableau_closure_rule, [i_0_182, ...])). 0.18/0.38 # End printing tableau 0.18/0.38 # SZS output end 0.18/0.38 # Branches closed with saturation will be marked with an "s" 0.18/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. 0.18/0.38 # We now have 4 tableaux to operate on 0.18/0.38 # Found closed tableau during pool population. 0.18/0.38 # Proof search is over... 0.18/0.38 # Freeing feature tree 0.18/0.38 EOF