%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP772-1 : TPTP v8.1.0. Released v4.1.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 : n010.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:08:24 EDT 2022 % Result : Unsatisfiable 0.19s 0.45s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP772-1 : TPTP v8.1.0. Released v4.1.0. % 0.11/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 : n010.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 : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 14 06:50:24 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 29 Number of unprocessed: 29 % 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 # 29 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 29 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 29 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 41 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 41 tableaux to operate on % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_34, plain, (product(X1,one)=X1)). % 0.19/0.45 cnf(i_0_35, plain, (product(one,X1)=X1)). % 0.19/0.45 cnf(i_0_36, plain, (product(X1,difference(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_37, plain, (difference(X1,product(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_39, plain, (product(quotient(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_38, plain, (quotient(product(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_44, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))). % 0.19/0.45 cnf(i_0_65, plain, (a(quotient(one,X1),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_50, plain, (product(quotient(one,X1),difference(X1,one))=quotient(quotient(one,X1),X1))). % 0.19/0.45 cnf(i_0_63, plain, (a(X1,difference(X2,one),X3)=a(X1,quotient(one,X2),X3))). % 0.19/0.45 cnf(i_0_64, plain, (a(difference(X1,one),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_61, plain, (product(product(X1,X2),a(X3,X4,X5))=product(X1,product(X2,a(X3,X4,X5))))). % 0.19/0.45 cnf(i_0_60, plain, (product(product(a(X1,X2,X3),X4),X5)=product(a(X1,X2,X3),product(X4,X5)))). % 0.19/0.45 cnf(i_0_59, plain, (product(product(X1,X2),c(X3,X4))=product(X1,product(X2,c(X3,X4))))). % 0.19/0.45 cnf(i_0_57, plain, (product(X1,product(X2,c(X2,X1)))=product(X2,X1))). % 0.19/0.45 cnf(i_0_58, plain, (product(product(c(X1,X2),X3),X4)=product(c(X1,X2),product(X3,X4)))). % 0.19/0.45 cnf(i_0_54, plain, (product(difference(product(X1,X2),one),difference(difference(X1,one),one))=difference(X2,one))). % 0.19/0.45 cnf(i_0_55, plain, (product(quotient(one,quotient(one,X1)),quotient(one,product(X2,X1)))=quotient(one,X2))). % 0.19/0.45 cnf(i_0_40, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))). % 0.19/0.45 cnf(i_0_62, plain, (product(a(X1,X2,X3),difference(X3,product(a(X3,X1,X2),X3)))=one)). % 0.19/0.45 cnf(i_0_56, plain, (product(X1,product(X2,product(X3,a(X1,X2,X3))))=product(product(X1,X2),X3))). % 0.19/0.45 cnf(i_0_48, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))). % 0.19/0.45 cnf(i_0_49, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_41, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))). % 0.19/0.45 cnf(i_0_51, plain, (product(product(product(quotient(quotient(one,X1),X1),product(X1,X1)),X2),X3)=product(product(quotient(quotient(one,X1),X1),product(X1,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_53, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))). % 0.19/0.45 cnf(i_0_46, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))). % 0.19/0.45 cnf(i_0_47, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))). % 0.19/0.45 cnf(i_0_66, negated_conjecture, (a(x0,x1,x1)!=a(x1,x1,x0))). % 0.19/0.45 cnf(i_0_68, plain, (X6=X6)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_34, plain, (product(X3,one)=X3), inference(start_rule)). % 0.19/0.45 cnf(i_0_77, plain, (product(X3,one)=X3), inference(extension_rule, [i_0_74])). % 0.19/0.45 cnf(i_0_122, plain, (product(X5,one)!=X5), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_120, plain, (quotient(product(X3,one),product(X5,one))=quotient(X3,X5)), inference(extension_rule, [i_0_71])). % 0.19/0.45 cnf(i_0_136, plain, (quotient(X3,X5)!=product(quotient(X3,X5),one)), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_134, plain, (quotient(product(X3,one),product(X5,one))=product(quotient(X3,X5),one)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_34, plain, (product(X1,one)=X1)). % 0.19/0.45 cnf(i_0_35, plain, (product(one,X1)=X1)). % 0.19/0.45 cnf(i_0_36, plain, (product(X1,difference(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_37, plain, (difference(X1,product(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_39, plain, (product(quotient(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_38, plain, (quotient(product(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_44, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))). % 0.19/0.45 cnf(i_0_65, plain, (a(quotient(one,X1),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_50, plain, (product(quotient(one,X1),difference(X1,one))=quotient(quotient(one,X1),X1))). % 0.19/0.45 cnf(i_0_63, plain, (a(X1,difference(X2,one),X3)=a(X1,quotient(one,X2),X3))). % 0.19/0.45 cnf(i_0_64, plain, (a(difference(X1,one),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_61, plain, (product(product(X1,X2),a(X3,X4,X5))=product(X1,product(X2,a(X3,X4,X5))))). % 0.19/0.45 cnf(i_0_60, plain, (product(product(a(X1,X2,X3),X4),X5)=product(a(X1,X2,X3),product(X4,X5)))). % 0.19/0.45 cnf(i_0_59, plain, (product(product(X1,X2),c(X3,X4))=product(X1,product(X2,c(X3,X4))))). % 0.19/0.45 cnf(i_0_57, plain, (product(X1,product(X2,c(X2,X1)))=product(X2,X1))). % 0.19/0.45 cnf(i_0_58, plain, (product(product(c(X1,X2),X3),X4)=product(c(X1,X2),product(X3,X4)))). % 0.19/0.45 cnf(i_0_54, plain, (product(difference(product(X1,X2),one),difference(difference(X1,one),one))=difference(X2,one))). % 0.19/0.45 cnf(i_0_55, plain, (product(quotient(one,quotient(one,X1)),quotient(one,product(X2,X1)))=quotient(one,X2))). % 0.19/0.45 cnf(i_0_40, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))). % 0.19/0.45 cnf(i_0_62, plain, (product(a(X1,X2,X3),difference(X3,product(a(X3,X1,X2),X3)))=one)). % 0.19/0.45 cnf(i_0_56, plain, (product(X1,product(X2,product(X3,a(X1,X2,X3))))=product(product(X1,X2),X3))). % 0.19/0.45 cnf(i_0_48, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))). % 0.19/0.45 cnf(i_0_49, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_41, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))). % 0.19/0.45 cnf(i_0_51, plain, (product(product(product(quotient(quotient(one,X1),X1),product(X1,X1)),X2),X3)=product(product(quotient(quotient(one,X1),X1),product(X1,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_53, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))). % 0.19/0.45 cnf(i_0_46, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))). % 0.19/0.45 cnf(i_0_47, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))). % 0.19/0.45 cnf(i_0_66, negated_conjecture, (a(x0,x1,x1)!=a(x1,x1,x0))). % 0.19/0.45 cnf(i_0_68, plain, (X6=X6)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_34, plain, (product(X3,one)=X3), inference(start_rule)). % 0.19/0.45 cnf(i_0_77, plain, (product(X3,one)=X3), inference(extension_rule, [i_0_76])). % 0.19/0.45 cnf(i_0_129, plain, (product(X5,one)!=X5), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_127, plain, (c(product(X3,one),product(X5,one))=c(X3,X5)), inference(extension_rule, [i_0_71])). % 0.19/0.45 cnf(i_0_136, plain, (c(X3,X5)!=product(c(X3,X5),one)), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_134, plain, (c(product(X3,one),product(X5,one))=product(c(X3,X5),one)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_34, plain, (product(X1,one)=X1)). % 0.19/0.45 cnf(i_0_35, plain, (product(one,X1)=X1)). % 0.19/0.45 cnf(i_0_36, plain, (product(X1,difference(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_37, plain, (difference(X1,product(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_39, plain, (product(quotient(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_38, plain, (quotient(product(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_44, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))). % 0.19/0.45 cnf(i_0_65, plain, (a(quotient(one,X1),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_50, plain, (product(quotient(one,X1),difference(X1,one))=quotient(quotient(one,X1),X1))). % 0.19/0.45 cnf(i_0_63, plain, (a(X1,difference(X2,one),X3)=a(X1,quotient(one,X2),X3))). % 0.19/0.45 cnf(i_0_64, plain, (a(difference(X1,one),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_61, plain, (product(product(X1,X2),a(X3,X4,X5))=product(X1,product(X2,a(X3,X4,X5))))). % 0.19/0.45 cnf(i_0_60, plain, (product(product(a(X1,X2,X3),X4),X5)=product(a(X1,X2,X3),product(X4,X5)))). % 0.19/0.45 cnf(i_0_59, plain, (product(product(X1,X2),c(X3,X4))=product(X1,product(X2,c(X3,X4))))). % 0.19/0.45 cnf(i_0_57, plain, (product(X1,product(X2,c(X2,X1)))=product(X2,X1))). % 0.19/0.45 cnf(i_0_58, plain, (product(product(c(X1,X2),X3),X4)=product(c(X1,X2),product(X3,X4)))). % 0.19/0.45 cnf(i_0_54, plain, (product(difference(product(X1,X2),one),difference(difference(X1,one),one))=difference(X2,one))). % 0.19/0.45 cnf(i_0_55, plain, (product(quotient(one,quotient(one,X1)),quotient(one,product(X2,X1)))=quotient(one,X2))). % 0.19/0.45 cnf(i_0_40, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))). % 0.19/0.45 cnf(i_0_62, plain, (product(a(X1,X2,X3),difference(X3,product(a(X3,X1,X2),X3)))=one)). % 0.19/0.45 cnf(i_0_56, plain, (product(X1,product(X2,product(X3,a(X1,X2,X3))))=product(product(X1,X2),X3))). % 0.19/0.45 cnf(i_0_48, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))). % 0.19/0.45 cnf(i_0_49, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_41, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))). % 0.19/0.45 cnf(i_0_51, plain, (product(product(product(quotient(quotient(one,X1),X1),product(X1,X1)),X2),X3)=product(product(quotient(quotient(one,X1),X1),product(X1,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_53, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))). % 0.19/0.45 cnf(i_0_46, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))). % 0.19/0.45 cnf(i_0_47, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))). % 0.19/0.45 cnf(i_0_66, negated_conjecture, (a(x0,x1,x1)!=a(x1,x1,x0))). % 0.19/0.45 cnf(i_0_68, plain, (X6=X6)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_34, plain, (product(X5,one)=X5), inference(start_rule)). % 0.19/0.45 cnf(i_0_77, plain, (product(X5,one)=X5), inference(extension_rule, [i_0_73])). % 0.19/0.45 cnf(i_0_118, plain, (product(X3,one)!=X3), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_117, plain, (difference(product(X3,one),product(X5,one))=difference(X3,X5)), inference(extension_rule, [i_0_71])). % 0.19/0.45 cnf(i_0_136, plain, (difference(X3,X5)!=product(difference(X3,X5),one)), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_134, plain, (difference(product(X3,one),product(X5,one))=product(difference(X3,X5),one)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_34, plain, (product(X1,one)=X1)). % 0.19/0.45 cnf(i_0_35, plain, (product(one,X1)=X1)). % 0.19/0.45 cnf(i_0_36, plain, (product(X1,difference(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_37, plain, (difference(X1,product(X1,X2))=X2)). % 0.19/0.45 cnf(i_0_39, plain, (product(quotient(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_38, plain, (quotient(product(X1,X2),X2)=X1)). % 0.19/0.45 cnf(i_0_44, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))). % 0.19/0.45 cnf(i_0_65, plain, (a(quotient(one,X1),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_50, plain, (product(quotient(one,X1),difference(X1,one))=quotient(quotient(one,X1),X1))). % 0.19/0.45 cnf(i_0_63, plain, (a(X1,difference(X2,one),X3)=a(X1,quotient(one,X2),X3))). % 0.19/0.45 cnf(i_0_64, plain, (a(difference(X1,one),X2,X3)=a(X2,X3,X1))). % 0.19/0.45 cnf(i_0_61, plain, (product(product(X1,X2),a(X3,X4,X5))=product(X1,product(X2,a(X3,X4,X5))))). % 0.19/0.45 cnf(i_0_60, plain, (product(product(a(X1,X2,X3),X4),X5)=product(a(X1,X2,X3),product(X4,X5)))). % 0.19/0.45 cnf(i_0_59, plain, (product(product(X1,X2),c(X3,X4))=product(X1,product(X2,c(X3,X4))))). % 0.19/0.45 cnf(i_0_57, plain, (product(X1,product(X2,c(X2,X1)))=product(X2,X1))). % 0.19/0.45 cnf(i_0_58, plain, (product(product(c(X1,X2),X3),X4)=product(c(X1,X2),product(X3,X4)))). % 0.19/0.45 cnf(i_0_54, plain, (product(difference(product(X1,X2),one),difference(difference(X1,one),one))=difference(X2,one))). % 0.19/0.45 cnf(i_0_55, plain, (product(quotient(one,quotient(one,X1)),quotient(one,product(X2,X1)))=quotient(one,X2))). % 0.19/0.45 cnf(i_0_40, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))). % 0.19/0.45 cnf(i_0_62, plain, (product(a(X1,X2,X3),difference(X3,product(a(X3,X1,X2),X3)))=one)). % 0.19/0.45 cnf(i_0_56, plain, (product(X1,product(X2,product(X3,a(X1,X2,X3))))=product(product(X1,X2),X3))). % 0.19/0.45 cnf(i_0_48, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))). % 0.19/0.45 cnf(i_0_49, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_41, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))). % 0.19/0.45 cnf(i_0_51, plain, (product(product(product(quotient(quotient(one,X1),X1),product(X1,X1)),X2),X3)=product(product(quotient(quotient(one,X1),X1),product(X1,X1)),product(X2,X3)))). % 0.19/0.45 cnf(i_0_53, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))). % 0.19/0.45 cnf(i_0_46, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))). % 0.19/0.45 cnf(i_0_47, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))). % 0.19/0.45 cnf(i_0_66, negated_conjecture, (a(x0,x1,x1)!=a(x1,x1,x0))). % 0.19/0.45 cnf(i_0_68, plain, (X6=X6)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_34, plain, (product(X5,one)=X5), inference(start_rule)). % 0.19/0.45 cnf(i_0_77, plain, (product(X5,one)=X5), inference(extension_rule, [i_0_74])). % 0.19/0.45 cnf(i_0_121, plain, (product(X3,one)!=X3), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_120, plain, (quotient(product(X3,one),product(X5,one))=quotient(X3,X5)), inference(extension_rule, [i_0_71])). % 0.19/0.45 cnf(i_0_136, plain, (quotient(X3,X5)!=product(quotient(X3,X5),one)), inference(closure_rule, [i_0_34])). % 0.19/0.45 cnf(i_0_134, plain, (quotient(product(X3,one),product(X5,one))=product(quotient(X3,X5),one)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # Child (1669) has found a proof. % 0.19/0.45 % 0.19/0.45 # Proof search is over... % 0.19/0.45 # Freeing feature tree %------------------------------------------------------------------------------