0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/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 : n006.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:23:29 EDT 2022 0.13/0.34 % CPUTime : 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S 0.13/0.36 # and selection function SelectNewComplexAHP. 0.13/0.36 # 0.13/0.36 # Presaturation interreduction done 0.13/0.36 # Number of axioms: 12 Number of unprocessed: 10 0.13/0.36 # Tableaux proof search. 0.13/0.36 # APR header successfully linked. 0.13/0.36 # Hello from C++ 0.13/0.36 # The folding up rule is enabled... 0.13/0.36 # Local unification is enabled... 0.13/0.36 # Any saturation attempts will use folding labels... 0.13/0.36 # 10 beginning clauses after preprocessing and clausification 0.13/0.36 # Creating start rules for all 1 conjectures. 0.13/0.36 # There are 1 start rule candidates: 0.13/0.36 # Found 8 unit axioms. 0.13/0.36 # 1 start rule tableaux created. 0.13/0.36 # 2 extension rule candidate clauses 0.13/0.36 # 8 unit axiom clauses 0.13/0.36 0.13/0.36 # Requested 8, 32 cores available to the main process. 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 0.13/0.36 # Creating equality axioms 0.13/0.36 # Ran out of tableaux, making start rules for all clauses 0.13/0.36 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. 0.13/0.36 # We now have 17 tableaux to operate on 0.19/0.51 # There were 1 total branch saturation attempts. 0.19/0.51 # There were 0 of these attempts blocked. 0.19/0.51 # There were 0 deferred branch saturation attempts. 0.19/0.51 # There were 0 free duplicated saturations. 0.19/0.51 # There were 1 total successful branch saturations. 0.19/0.51 # There were 0 successful branch saturations in interreduction. 0.19/0.51 # There were 0 successful branch saturations on the branch. 0.19/0.51 # There were 1 successful branch saturations after the branch. 0.19/0.51 # There were 1 total branch saturation attempts. 0.19/0.51 # There were 0 of these attempts blocked. 0.19/0.51 # There were 0 deferred branch saturation attempts. 0.19/0.51 # There were 0 free duplicated saturations. 0.19/0.51 # There were 1 total successful branch saturations. 0.19/0.51 # There were 0 successful branch saturations in interreduction. 0.19/0.51 # There were 0 successful branch saturations on the branch. 0.19/0.51 # There were 1 successful branch saturations after the branch. 0.19/0.51 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.51 # Begin clausification derivation 0.19/0.51 0.19/0.51 # End clausification derivation 0.19/0.51 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.51 cnf(i_0_12, plain, (mult(X1,unit)=X1)). 0.19/0.51 cnf(i_0_8, plain, (mult(unit,X1)=X1)). 0.19/0.51 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). 0.19/0.51 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). 0.19/0.51 cnf(i_0_6, plain, (mult(rd(X1,X2),X2)=X1)). 0.19/0.51 cnf(i_0_7, plain, (rd(mult(X1,X2),X2)=X1)). 0.19/0.51 cnf(i_0_1, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))). 0.19/0.51 cnf(i_0_9, negated_conjecture, (mult(mult(a,b),c)!=mult(a,mult(b,c)))). 0.19/0.51 cnf(i_0_2, plain, (mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(X1,mult(X2,X3))=mult(X1,mult(X3,X2)))). 0.19/0.51 cnf(i_0_4, plain, (mult(mult(X1,X2),X3)=mult(mult(X1,X3),X2)|mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2)))). 0.19/0.51 cnf(i_0_18, plain, (X23=X23)). 0.19/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.51 # Begin printing tableau 0.19/0.51 # Found 6 steps 0.19/0.51 cnf(i_0_12, plain, (mult(X3,unit)=X3), inference(start_rule)). 0.19/0.51 cnf(i_0_25, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_23])). 0.19/0.51 cnf(i_0_54, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_12])). 0.19/0.51 cnf(i_0_52, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_21])). 0.19/0.51 cnf(i_0_68, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_12])). 0.19/0.51 cnf(i_0_66, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_66, ...])). 0.19/0.51 # End printing tableau 0.19/0.51 # SZS output end 0.19/0.51 # Branches closed with saturation will be marked with an "s" 0.19/0.51 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.51 # Begin clausification derivation 0.19/0.51 0.19/0.51 # End clausification derivation 0.19/0.51 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.51 cnf(i_0_12, plain, (mult(X1,unit)=X1)). 0.19/0.51 cnf(i_0_8, plain, (mult(unit,X1)=X1)). 0.19/0.51 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). 0.19/0.51 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). 0.19/0.51 cnf(i_0_6, plain, (mult(rd(X1,X2),X2)=X1)). 0.19/0.51 cnf(i_0_7, plain, (rd(mult(X1,X2),X2)=X1)). 0.19/0.51 cnf(i_0_1, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))). 0.19/0.51 cnf(i_0_9, negated_conjecture, (mult(mult(a,b),c)!=mult(a,mult(b,c)))). 0.19/0.51 cnf(i_0_2, plain, (mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(X1,mult(X2,X3))=mult(X1,mult(X3,X2)))). 0.19/0.51 cnf(i_0_4, plain, (mult(mult(X1,X2),X3)=mult(mult(X1,X3),X2)|mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2)))). 0.19/0.51 cnf(i_0_18, plain, (X23=X23)). 0.19/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.51 # Begin printing tableau 0.19/0.51 # Found 6 steps 0.19/0.51 cnf(i_0_12, plain, (mult(X5,unit)=X5), inference(start_rule)). 0.19/0.51 cnf(i_0_25, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_24])). 0.19/0.51 cnf(i_0_56, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_12])). 0.19/0.51 cnf(i_0_55, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_21])). 0.19/0.51 cnf(i_0_68, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_12])). 0.19/0.51 cnf(i_0_66, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_66, ...])). 0.19/0.51 # End printing tableau 0.19/0.51 # SZS output end 0.19/0.51 # Branches closed with saturation will be marked with an "s" 0.19/0.51 # There were 1 total branch saturation attempts. 0.19/0.51 # There were 0 of these attempts blocked. 0.19/0.51 # There were 0 deferred branch saturation attempts. 0.19/0.51 # There were 0 free duplicated saturations. 0.19/0.51 # There were 1 total successful branch saturations. 0.19/0.51 # There were 0 successful branch saturations in interreduction. 0.19/0.51 # There were 0 successful branch saturations on the branch. 0.19/0.51 # There were 1 successful branch saturations after the branch. 0.19/0.51 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.51 # Begin clausification derivation 0.19/0.51 0.19/0.51 # End clausification derivation 0.19/0.51 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.51 cnf(i_0_12, plain, (mult(X1,unit)=X1)). 0.19/0.51 cnf(i_0_8, plain, (mult(unit,X1)=X1)). 0.19/0.51 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). 0.19/0.51 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). 0.19/0.51 cnf(i_0_6, plain, (mult(rd(X1,X2),X2)=X1)). 0.19/0.51 cnf(i_0_7, plain, (rd(mult(X1,X2),X2)=X1)). 0.19/0.51 cnf(i_0_1, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))). 0.19/0.51 cnf(i_0_9, negated_conjecture, (mult(mult(a,b),c)!=mult(a,mult(b,c)))). 0.19/0.51 cnf(i_0_2, plain, (mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2))|mult(X1,mult(X2,X3))=mult(X1,mult(X3,X2)))). 0.19/0.51 cnf(i_0_4, plain, (mult(mult(X1,X2),X3)=mult(mult(X1,X3),X2)|mult(mult(X1,X2),X3)=mult(X1,mult(X3,X2)))). 0.19/0.51 cnf(i_0_18, plain, (X23=X23)). 0.19/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.51 # Begin printing tableau 0.19/0.51 # Found 6 steps 0.19/0.51 cnf(i_0_12, plain, (mult(X5,unit)=X5), inference(start_rule)). 0.19/0.51 cnf(i_0_25, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_23])). 0.19/0.51 cnf(i_0_53, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_12])). 0.19/0.51 cnf(i_0_52, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_21])). 0.19/0.51 cnf(i_0_68, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_12])). 0.19/0.51 cnf(i_0_66, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_66, ...])). 0.19/0.51 # End printing tableau 0.19/0.51 # SZS output end 0.19/0.51 # Branches closed with saturation will be marked with an "s" 0.19/0.51 # Child (13113) has found a proof. 0.19/0.51 0.19/0.51 # Proof search is over... 0.19/0.51 # Freeing feature tree 0.19/0.51 EOF