0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/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 : n027.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 12:25:55 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.37 # No SInE strategy applied 0.13/0.37 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S 0.13/0.37 # and selection function SelectNewComplexAHP. 0.13/0.37 # 0.13/0.37 # Presaturation interreduction done 0.13/0.37 # Number of axioms: 12 Number of unprocessed: 12 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 # 12 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 12 unit axioms. 0.13/0.37 # 1 start rule tableaux created. 0.13/0.37 # 0 extension rule candidate clauses 0.13/0.37 # 12 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 20 new_tableaux and 0 remaining starting tableaux. 0.13/0.37 # We now have 20 tableaux to operate on 264.67/33.65 # There were 1 total branch saturation attempts. 264.67/33.65 # There were 0 of these attempts blocked. 264.67/33.65 # There were 0 deferred branch saturation attempts. 264.67/33.65 # There were 0 free duplicated saturations. 264.67/33.65 # There were 1 total successful branch saturations. 264.67/33.65 # There were 0 successful branch saturations in interreduction. 264.67/33.65 # There were 0 successful branch saturations on the branch. 264.67/33.65 # There were 1 successful branch saturations after the branch. 264.67/33.65 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 264.67/33.65 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 264.67/33.65 # Begin clausification derivation 264.67/33.65 264.67/33.65 # End clausification derivation 264.67/33.65 # Begin listing active clauses obtained from FOF to CNF conversion 264.67/33.65 cnf(i_0_14, plain, (mult(X1,unit)=X1)). 264.67/33.65 cnf(i_0_22, plain, (mult(unit,X1)=X1)). 264.67/33.65 cnf(i_0_19, plain, (mult(i(X1),X1)=unit)). 264.67/33.65 cnf(i_0_18, plain, (mult(X1,i(X1))=unit)). 264.67/33.65 cnf(i_0_24, plain, (mult(X1,ld(X1,X2))=X2)). 264.67/33.65 cnf(i_0_23, plain, (rd(mult(X1,X2),X2)=X1)). 264.67/33.65 cnf(i_0_13, plain, (ld(X1,mult(X1,X2))=X2)). 264.67/33.65 cnf(i_0_20, plain, (mult(rd(X1,X2),X2)=X1)). 264.67/33.65 cnf(i_0_21, plain, (mult(X1,i(mult(X2,X1)))=i(X2))). 264.67/33.65 cnf(i_0_16, plain, (mult(rd(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(X2,X3)))). 264.67/33.65 cnf(i_0_17, plain, (mult(mult(X1,X2),ld(X2,mult(X3,X2)))=mult(mult(X1,X3),X2))). 264.67/33.65 cnf(i_0_15, negated_conjecture, (mult(mult(mult(a,b),a),mult(a,c))!=mult(a,mult(mult(mult(b,a),a),c)))). 264.67/33.65 cnf(i_0_26, plain, (X4=X4)). 264.67/33.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 264.67/33.65 # Begin printing tableau 264.67/33.65 # Found 6 steps 264.67/33.65 cnf(i_0_14, plain, (mult(X7,unit)=X7), inference(start_rule)). 264.67/33.65 cnf(i_0_34, plain, (mult(X7,unit)=X7), inference(extension_rule, [i_0_30])). 264.67/33.65 cnf(i_0_56, plain, (mult(unit,unit)!=unit), inference(closure_rule, [i_0_14])). 264.67/33.65 cnf(i_0_54, plain, (mult(mult(X7,unit),mult(unit,unit))=mult(X7,unit)), inference(extension_rule, [i_0_29])). 264.67/33.65 cnf(i_0_71, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_14])). 264.67/33.65 cnf(i_0_69, plain, (mult(mult(X7,unit),mult(unit,unit))=X7), inference(etableau_closure_rule, [i_0_69, ...])). 264.67/33.65 # End printing tableau 264.67/33.65 # SZS output end 264.67/33.65 # Branches closed with saturation will be marked with an "s" 264.67/33.67 # There were 1 total branch saturation attempts. 264.67/33.67 # There were 0 of these attempts blocked. 264.67/33.67 # There were 0 deferred branch saturation attempts. 264.67/33.67 # There were 0 free duplicated saturations. 264.67/33.67 # There were 1 total successful branch saturations. 264.67/33.67 # There were 0 successful branch saturations in interreduction. 264.67/33.67 # There were 0 successful branch saturations on the branch. 264.67/33.67 # There were 1 successful branch saturations after the branch. 264.67/33.67 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 264.67/33.67 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 264.67/33.67 # Begin clausification derivation 264.67/33.67 264.67/33.67 # End clausification derivation 264.67/33.67 # Begin listing active clauses obtained from FOF to CNF conversion 264.67/33.67 cnf(i_0_14, plain, (mult(X1,unit)=X1)). 264.67/33.67 cnf(i_0_22, plain, (mult(unit,X1)=X1)). 264.67/33.67 cnf(i_0_19, plain, (mult(i(X1),X1)=unit)). 264.67/33.67 cnf(i_0_18, plain, (mult(X1,i(X1))=unit)). 264.67/33.67 cnf(i_0_24, plain, (mult(X1,ld(X1,X2))=X2)). 264.67/33.67 cnf(i_0_23, plain, (rd(mult(X1,X2),X2)=X1)). 264.67/33.67 cnf(i_0_13, plain, (ld(X1,mult(X1,X2))=X2)). 264.67/33.67 cnf(i_0_20, plain, (mult(rd(X1,X2),X2)=X1)). 264.67/33.67 cnf(i_0_21, plain, (mult(X1,i(mult(X2,X1)))=i(X2))). 264.67/33.67 cnf(i_0_16, plain, (mult(rd(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(X2,X3)))). 264.67/33.67 cnf(i_0_17, plain, (mult(mult(X1,X2),ld(X2,mult(X3,X2)))=mult(mult(X1,X3),X2))). 264.67/33.67 cnf(i_0_15, negated_conjecture, (mult(mult(mult(a,b),a),mult(a,c))!=mult(a,mult(mult(mult(b,a),a),c)))). 264.67/33.67 cnf(i_0_26, plain, (X4=X4)). 264.67/33.67 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 264.67/33.67 # Begin printing tableau 264.67/33.67 # Found 6 steps 264.67/33.67 cnf(i_0_14, plain, (mult(X5,unit)=X5), inference(start_rule)). 264.67/33.67 cnf(i_0_34, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_31])). 264.67/33.67 cnf(i_0_58, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_14])). 264.67/33.67 cnf(i_0_57, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_29])). 264.67/33.67 cnf(i_0_71, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_14])). 264.67/33.67 cnf(i_0_69, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_69, ...])). 264.67/33.67 # End printing tableau 264.67/33.67 # SZS output end 264.67/33.67 # Branches closed with saturation will be marked with an "s" 265.52/33.76 # There were 1 total branch saturation attempts. 265.52/33.76 # There were 0 of these attempts blocked. 265.52/33.76 # There were 0 deferred branch saturation attempts. 265.52/33.76 # There were 0 free duplicated saturations. 265.52/33.76 # There were 1 total successful branch saturations. 265.52/33.76 # There were 0 successful branch saturations in interreduction. 265.52/33.76 # There were 0 successful branch saturations on the branch. 265.52/33.76 # There were 1 successful branch saturations after the branch. 265.52/33.77 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 265.52/33.77 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 265.52/33.77 # Begin clausification derivation 265.52/33.77 265.52/33.77 # End clausification derivation 265.52/33.77 # Begin listing active clauses obtained from FOF to CNF conversion 265.52/33.77 cnf(i_0_14, plain, (mult(X1,unit)=X1)). 265.52/33.77 cnf(i_0_22, plain, (mult(unit,X1)=X1)). 265.52/33.77 cnf(i_0_19, plain, (mult(i(X1),X1)=unit)). 265.52/33.77 cnf(i_0_18, plain, (mult(X1,i(X1))=unit)). 265.52/33.77 cnf(i_0_24, plain, (mult(X1,ld(X1,X2))=X2)). 265.52/33.77 cnf(i_0_23, plain, (rd(mult(X1,X2),X2)=X1)). 265.52/33.77 cnf(i_0_13, plain, (ld(X1,mult(X1,X2))=X2)). 265.52/33.77 cnf(i_0_20, plain, (mult(rd(X1,X2),X2)=X1)). 265.52/33.77 cnf(i_0_21, plain, (mult(X1,i(mult(X2,X1)))=i(X2))). 265.52/33.77 cnf(i_0_16, plain, (mult(rd(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(X2,X3)))). 265.52/33.77 cnf(i_0_17, plain, (mult(mult(X1,X2),ld(X2,mult(X3,X2)))=mult(mult(X1,X3),X2))). 265.52/33.77 cnf(i_0_15, negated_conjecture, (mult(mult(mult(a,b),a),mult(a,c))!=mult(a,mult(mult(mult(b,a),a),c)))). 265.52/33.77 cnf(i_0_26, plain, (X4=X4)). 265.52/33.77 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 265.52/33.77 # Begin printing tableau 265.52/33.77 # Found 6 steps 265.52/33.77 cnf(i_0_14, plain, (mult(X3,unit)=X3), inference(start_rule)). 265.52/33.77 cnf(i_0_34, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_32])). 265.52/33.77 cnf(i_0_62, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_14])). 265.52/33.77 cnf(i_0_60, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_29])). 265.52/33.77 cnf(i_0_71, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_14])). 265.52/33.77 cnf(i_0_69, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_69, ...])). 265.52/33.77 # End printing tableau 265.52/33.77 # SZS output end 265.52/33.77 # Branches closed with saturation will be marked with an "s" 265.52/33.78 # There were 1 total branch saturation attempts. 265.52/33.78 # There were 0 of these attempts blocked. 265.52/33.78 # There were 0 deferred branch saturation attempts. 265.52/33.78 # There were 0 free duplicated saturations. 265.52/33.78 # There were 1 total successful branch saturations. 265.52/33.78 # There were 0 successful branch saturations in interreduction. 265.52/33.78 # There were 0 successful branch saturations on the branch. 265.52/33.78 # There were 1 successful branch saturations after the branch. 265.52/33.78 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 265.52/33.78 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 265.52/33.78 # Begin clausification derivation 265.52/33.78 265.52/33.78 # End clausification derivation 265.52/33.78 # Begin listing active clauses obtained from FOF to CNF conversion 265.52/33.78 cnf(i_0_14, plain, (mult(X1,unit)=X1)). 265.52/33.78 cnf(i_0_22, plain, (mult(unit,X1)=X1)). 265.52/33.78 cnf(i_0_19, plain, (mult(i(X1),X1)=unit)). 265.52/33.78 cnf(i_0_18, plain, (mult(X1,i(X1))=unit)). 265.52/33.78 cnf(i_0_24, plain, (mult(X1,ld(X1,X2))=X2)). 265.52/33.78 cnf(i_0_23, plain, (rd(mult(X1,X2),X2)=X1)). 265.52/33.78 cnf(i_0_13, plain, (ld(X1,mult(X1,X2))=X2)). 265.52/33.78 cnf(i_0_20, plain, (mult(rd(X1,X2),X2)=X1)). 265.52/33.78 cnf(i_0_21, plain, (mult(X1,i(mult(X2,X1)))=i(X2))). 265.52/33.78 cnf(i_0_16, plain, (mult(rd(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(X2,X3)))). 265.52/33.78 cnf(i_0_17, plain, (mult(mult(X1,X2),ld(X2,mult(X3,X2)))=mult(mult(X1,X3),X2))). 265.52/33.78 cnf(i_0_15, negated_conjecture, (mult(mult(mult(a,b),a),mult(a,c))!=mult(a,mult(mult(mult(b,a),a),c)))). 265.52/33.78 cnf(i_0_26, plain, (X4=X4)). 265.52/33.78 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 265.52/33.78 # Begin printing tableau 265.52/33.78 # Found 6 steps 265.52/33.78 cnf(i_0_14, plain, (mult(X5,unit)=X5), inference(start_rule)). 265.52/33.78 cnf(i_0_34, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_32])). 265.52/33.78 cnf(i_0_61, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_14])). 265.52/33.78 cnf(i_0_60, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_29])). 265.52/33.78 cnf(i_0_71, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_14])). 265.52/33.78 cnf(i_0_69, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_69, ...])). 265.52/33.78 # End printing tableau 265.52/33.78 # SZS output end 265.52/33.78 # Branches closed with saturation will be marked with an "s" 265.99/33.81 # There were 1 total branch saturation attempts. 265.99/33.81 # There were 0 of these attempts blocked. 265.99/33.81 # There were 0 deferred branch saturation attempts. 265.99/33.81 # There were 0 free duplicated saturations. 265.99/33.81 # There were 1 total successful branch saturations. 265.99/33.81 # There were 0 successful branch saturations in interreduction. 265.99/33.81 # There were 0 successful branch saturations on the branch. 265.99/33.81 # There were 1 successful branch saturations after the branch. 265.99/33.81 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 265.99/33.81 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 265.99/33.81 # Begin clausification derivation 265.99/33.81 265.99/33.81 # End clausification derivation 265.99/33.81 # Begin listing active clauses obtained from FOF to CNF conversion 265.99/33.81 cnf(i_0_14, plain, (mult(X1,unit)=X1)). 265.99/33.81 cnf(i_0_22, plain, (mult(unit,X1)=X1)). 265.99/33.81 cnf(i_0_19, plain, (mult(i(X1),X1)=unit)). 265.99/33.81 cnf(i_0_18, plain, (mult(X1,i(X1))=unit)). 265.99/33.81 cnf(i_0_24, plain, (mult(X1,ld(X1,X2))=X2)). 265.99/33.81 cnf(i_0_23, plain, (rd(mult(X1,X2),X2)=X1)). 265.99/33.81 cnf(i_0_13, plain, (ld(X1,mult(X1,X2))=X2)). 265.99/33.81 cnf(i_0_20, plain, (mult(rd(X1,X2),X2)=X1)). 265.99/33.81 cnf(i_0_21, plain, (mult(X1,i(mult(X2,X1)))=i(X2))). 265.99/33.81 cnf(i_0_16, plain, (mult(rd(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(X2,X3)))). 265.99/33.81 cnf(i_0_17, plain, (mult(mult(X1,X2),ld(X2,mult(X3,X2)))=mult(mult(X1,X3),X2))). 265.99/33.81 cnf(i_0_15, negated_conjecture, (mult(mult(mult(a,b),a),mult(a,c))!=mult(a,mult(mult(mult(b,a),a),c)))). 265.99/33.81 cnf(i_0_26, plain, (X4=X4)). 265.99/33.81 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 265.99/33.81 # Begin printing tableau 265.99/33.81 # Found 5 steps 265.99/33.81 cnf(i_0_14, plain, (mult(X3,unit)=X3), inference(start_rule)). 265.99/33.81 cnf(i_0_34, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_33])). 265.99/33.81 cnf(i_0_63, plain, (i(mult(X3,unit))=i(X3)), inference(extension_rule, [i_0_29])). 265.99/33.81 cnf(i_0_71, plain, (i(X3)!=mult(i(X3),unit)), inference(closure_rule, [i_0_14])). 265.99/33.81 cnf(i_0_69, plain, (i(mult(X3,unit))=mult(i(X3),unit)), inference(etableau_closure_rule, [i_0_69, ...])). 265.99/33.81 # End printing tableau 265.99/33.81 # SZS output end 265.99/33.81 # Branches closed with saturation will be marked with an "s" 265.99/33.84 # Child (4402) has found a proof. 265.99/33.84 265.99/33.84 # Proof search is over... 265.99/33.84 # Freeing feature tree 265.99/34.09 EOF