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