0.12/0.13 % 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 : n021.cluster.edu 0.13/0.34 Model : x86_64 x86_64 0.13/0.34 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 RAMPerCPU : 8042.1875MB 0.13/0.34 OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 04:54:05 EDT 2022 0.13/0.35 % CPUTime : 0.13/0.37 # No SInE strategy applied 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. 0.13/0.37 # 0.13/0.37 # Presaturation interreduction done 0.13/0.37 # Number of axioms: 6 Number of unprocessed: 6 0.13/0.37 # Tableaux proof search. 0.13/0.37 # APR header successfully linked. 0.13/0.37 # Hello from C++ 0.13/0.37 # The folding up rule is enabled... 0.13/0.37 # Local unification is enabled... 0.13/0.37 # Any saturation attempts will use folding labels... 0.13/0.37 # 6 beginning clauses after preprocessing and clausification 0.13/0.37 # Creating start rules for all 1 conjectures. 0.13/0.37 # There are 1 start rule candidates: 0.13/0.37 # Found 5 unit axioms. 0.13/0.37 # 1 start rule tableaux created. 0.13/0.37 # 1 extension rule candidate clauses 0.13/0.37 # 5 unit axiom clauses 0.13/0.37 0.13/0.37 # Requested 8, 32 cores available to the main process. 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 0.13/0.37 # Creating equality axioms 0.13/0.37 # Ran out of tableaux, making start rules for all clauses 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. 0.13/0.37 # We now have 13 tableaux to operate on 206.79/26.51 # There were 1 total branch saturation attempts. 206.79/26.51 # There were 0 of these attempts blocked. 206.79/26.51 # There were 0 deferred branch saturation attempts. 206.79/26.51 # There were 0 free duplicated saturations. 206.79/26.51 # There were 1 total successful branch saturations. 206.79/26.51 # There were 0 successful branch saturations in interreduction. 206.79/26.51 # There were 0 successful branch saturations on the branch. 206.79/26.51 # There were 1 successful branch saturations after the branch. 206.79/26.51 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 206.79/26.51 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 206.79/26.51 # Begin clausification derivation 206.79/26.51 206.79/26.51 # End clausification derivation 206.79/26.51 # Begin listing active clauses obtained from FOF to CNF conversion 206.79/26.51 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)). 206.79/26.51 cnf(i_0_5, plain, (rd(mult(X1,X2),X2)=X1)). 206.79/26.51 cnf(i_0_4, plain, (mult(X1,ld(X1,X2))=X2)). 206.79/26.51 cnf(i_0_1, plain, (ld(X1,mult(X1,X2))=X2)). 206.79/26.51 cnf(i_0_2, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2))))). 206.79/26.51 cnf(i_0_6, negated_conjecture, (mult(esk1_0,rd(esk2_0,esk2_0))!=esk1_0|mult(rd(esk2_0,esk2_0),esk1_0)!=esk1_0)). 206.79/26.51 cnf(i_0_13, plain, (X19=X19)). 206.79/26.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 206.79/26.51 # Begin printing tableau 206.79/26.51 # Found 6 steps 206.79/26.51 cnf(i_0_3, plain, (mult(rd(X6,X9),X9)=X6), inference(start_rule)). 206.79/26.51 cnf(i_0_20, plain, (mult(rd(X6,X9),X9)=X6), inference(extension_rule, [i_0_19])). 206.79/26.51 cnf(i_0_44, plain, (mult(rd(X4,X2),X2)!=X4), inference(closure_rule, [i_0_3])). 206.79/26.51 cnf(i_0_43, plain, (rd(mult(rd(X4,X2),X2),mult(rd(X6,X9),X9))=rd(X4,X6)), inference(extension_rule, [i_0_16])). 206.79/26.51 cnf(i_0_54, plain, (rd(X4,X6)!=mult(rd(rd(X4,X6),X2),X2)), inference(closure_rule, [i_0_3])). 206.79/26.51 cnf(i_0_52, plain, (rd(mult(rd(X4,X2),X2),mult(rd(X6,X9),X9))=mult(rd(rd(X4,X6),X2),X2)), inference(etableau_closure_rule, [i_0_52, ...])). 206.79/26.51 # End printing tableau 206.79/26.51 # SZS output end 206.79/26.51 # Branches closed with saturation will be marked with an "s" 207.79/26.60 # There were 1 total branch saturation attempts. 207.79/26.60 # There were 0 of these attempts blocked. 207.79/26.60 # There were 0 deferred branch saturation attempts. 207.79/26.60 # There were 0 free duplicated saturations. 207.79/26.60 # There were 1 total successful branch saturations. 207.79/26.60 # There were 0 successful branch saturations in interreduction. 207.79/26.60 # There were 0 successful branch saturations on the branch. 207.79/26.60 # There were 1 successful branch saturations after the branch. 207.79/26.60 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 207.79/26.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 207.79/26.60 # Begin clausification derivation 207.79/26.60 207.79/26.60 # End clausification derivation 207.79/26.60 # Begin listing active clauses obtained from FOF to CNF conversion 207.79/26.60 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)). 207.79/26.60 cnf(i_0_5, plain, (rd(mult(X1,X2),X2)=X1)). 207.79/26.60 cnf(i_0_4, plain, (mult(X1,ld(X1,X2))=X2)). 207.79/26.60 cnf(i_0_1, plain, (ld(X1,mult(X1,X2))=X2)). 207.79/26.60 cnf(i_0_2, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2))))). 207.79/26.60 cnf(i_0_6, negated_conjecture, (mult(esk1_0,rd(esk2_0,esk2_0))!=esk1_0|mult(rd(esk2_0,esk2_0),esk1_0)!=esk1_0)). 207.79/26.60 cnf(i_0_13, plain, (X19=X19)). 207.79/26.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 207.79/26.60 # Begin printing tableau 207.79/26.60 # Found 6 steps 207.79/26.60 cnf(i_0_3, plain, (mult(rd(X4,X7),X7)=X4), inference(start_rule)). 207.79/26.60 cnf(i_0_20, plain, (mult(rd(X4,X7),X7)=X4), inference(extension_rule, [i_0_18])). 207.79/26.60 cnf(i_0_42, plain, (mult(rd(X6,X2),X2)!=X6), inference(closure_rule, [i_0_3])). 207.79/26.60 cnf(i_0_40, plain, (ld(mult(rd(X4,X7),X7),mult(rd(X6,X2),X2))=ld(X4,X6)), inference(extension_rule, [i_0_16])). 207.79/26.60 cnf(i_0_54, plain, (ld(X4,X6)!=mult(rd(ld(X4,X6),X2),X2)), inference(closure_rule, [i_0_3])). 207.79/26.60 cnf(i_0_52, plain, (ld(mult(rd(X4,X7),X7),mult(rd(X6,X2),X2))=mult(rd(ld(X4,X6),X2),X2)), inference(etableau_closure_rule, [i_0_52, ...])). 207.79/26.60 # End printing tableau 207.79/26.60 # SZS output end 207.79/26.60 # Branches closed with saturation will be marked with an "s" 207.79/26.61 # Child (6027) has found a proof. 207.79/26.61 207.79/26.61 # Proof search is over... 207.79/26.61 # Freeing feature tree 207.79/26.82 EOF