%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n007.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sat Jul 16 09:07:58 EDT 2022 % Result : Unsatisfiable 0.21s 0.38s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP679-1 : TPTP v8.1.0. Released v4.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.14/0.34 % Computer : n007.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.21/0.34 % CPULimit : 300 % 0.21/0.34 % WCLimit : 600 % 0.21/0.34 % DateTime : Mon Jun 13 21:31:09 EDT 2022 % 0.21/0.35 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.21/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.21/0.37 # % 0.21/0.37 # Number of axioms: 9 Number of unprocessed: 9 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 0.21/0.37 # The folding up rule is enabled... % 0.21/0.37 # Local unification is enabled... % 0.21/0.37 # Any saturation attempts will use folding labels... % 0.21/0.37 # 9 beginning clauses after preprocessing and clausification % 0.21/0.37 # Creating start rules for all 1 conjectures. % 0.21/0.37 # There are 1 start rule candidates: % 0.21/0.37 # Found 9 unit axioms. % 0.21/0.37 # 1 start rule tableaux created. % 0.21/0.37 # 0 extension rule candidate clauses % 0.21/0.37 # 9 unit axiom clauses % 0.21/0.37 % 0.21/0.37 # Requested 8, 32 cores available to the main process. % 0.21/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.37 # Creating equality axioms % 0.21/0.37 # Ran out of tableaux, making start rules for all clauses % 0.21/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.21/0.37 # We now have 16 tableaux to operate on % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(X3,unit)=X3), inference(start_rule)). % 0.21/0.38 cnf(i_0_27, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_26])). % 0.21/0.38 cnf(i_0_52, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_50, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_23])). % 0.21/0.38 cnf(i_0_59, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_57, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(X5,unit)=X5), inference(start_rule)). % 0.21/0.38 cnf(i_0_27, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_26])). % 0.21/0.38 cnf(i_0_51, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_50, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_23])). % 0.21/0.38 cnf(i_0_59, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_57, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(X2,unit)=X2), inference(start_rule)). % 0.21/0.38 cnf(i_0_27, plain, (mult(X2,unit)=X2), inference(extension_rule, [i_0_25])). % 0.21/0.38 cnf(i_0_49, plain, (mult(unit,unit)!=unit), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_47, plain, (mult(mult(X2,unit),mult(unit,unit))=mult(X2,unit)), inference(extension_rule, [i_0_23])). % 0.21/0.38 cnf(i_0_59, plain, (mult(X2,unit)!=X2), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_57, plain, (mult(mult(X2,unit),mult(unit,unit))=X2), inference(etableau_closure_rule, [i_0_57, ...])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(unit,unit)=unit), inference(start_rule)). % 0.21/0.38 cnf(i_0_27, plain, (mult(unit,unit)=unit), inference(extension_rule, [i_0_25])). % 0.21/0.38 cnf(i_0_48, plain, (mult(X2,unit)!=X2), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_47, plain, (mult(mult(X2,unit),mult(unit,unit))=mult(X2,unit)), inference(extension_rule, [i_0_23])). % 0.21/0.38 cnf(i_0_59, plain, (mult(X2,unit)!=X2), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_57, plain, (mult(mult(X2,unit),mult(unit,unit))=X2), inference(etableau_closure_rule, [i_0_57, ...])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(X5,unit)=X5), inference(start_rule)). % 0.21/0.38 cnf(i_0_27, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_24])). % 0.21/0.38 cnf(i_0_45, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_44, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_23])). % 0.21/0.38 cnf(i_0_59, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_57, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(X3,unit)=X3), inference(start_rule)). % 0.21/0.38 cnf(i_0_27, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_24])). % 0.21/0.38 cnf(i_0_46, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_44, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_23])). % 0.21/0.38 cnf(i_0_59, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_14])). % 0.21/0.38 cnf(i_0_57, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # There were 1 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 1 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 1 successful branch saturations after the branch. % 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.21/0.38 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.21/0.38 cnf(i_0_17, plain, (mult(op_c,X1)=mult(X1,op_c))). % 0.21/0.38 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.21/0.38 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.21/0.38 cnf(i_0_18, negated_conjecture, (mult(mult(op_c,op_c),a)!=mult(a,mult(op_c,op_c)))). % 0.21/0.38 cnf(i_0_16, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))). % 0.21/0.38 cnf(i_0_20, plain, (X4=X4)). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 6 steps % 0.21/0.38 cnf(i_0_14, plain, (mult(mult(a,mult(op_c,op_c)),unit)=mult(a,mult(op_c,op_c))), inference(start_rule)). % 0.21/0.39 cnf(i_0_27, plain, (mult(mult(a,mult(op_c,op_c)),unit)=mult(a,mult(op_c,op_c))), inference(extension_rule, [i_0_23])). % 0.21/0.39 cnf(i_0_41, plain, (mult(mult(op_c,op_c),a)=mult(a,mult(op_c,op_c))), inference(closure_rule, [i_0_18])). % 0.21/0.39 cnf(i_0_42, plain, (mult(mult(op_c,op_c),a)!=mult(mult(a,mult(op_c,op_c)),unit)), inference(extension_rule, [i_0_23])). % 0.21/0.39 cnf(i_0_58, plain, (mult(mult(op_c,op_c),a)!=mult(mult(mult(op_c,op_c),a),unit)), inference(closure_rule, [i_0_14])). % 0.21/0.39 cnf(i_0_59, plain, (mult(mult(mult(op_c,op_c),a),unit)!=mult(mult(a,mult(op_c,op_c)),unit)), inference(etableau_closure_rule, [i_0_59, ...])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # Child (19963) has found a proof. % 0.21/0.39 % 0.21/0.39 # Proof search is over... % 0.21/0.39 # Freeing feature tree %------------------------------------------------------------------------------