%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP452-1 : TPTP v8.1.0. Released v2.6.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 : n011.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:06:32 EDT 2022 % Result : Unsatisfiable 0.13s 0.36s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.08 % Problem : GRP452-1 : TPTP v8.1.0. Released v2.6.0. % 0.02/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.29 % Computer : n011.cluster.edu % 0.08/0.29 % Model : x86_64 x86_64 % 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.29 % Memory : 8042.1875MB % 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.29 % CPULimit : 300 % 0.08/0.29 % WCLimit : 600 % 0.08/0.29 % DateTime : Mon Jun 13 19:33:49 EDT 2022 % 0.08/0.29 % CPUTime : % 0.13/0.31 # No SInE strategy applied % 0.13/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.31 # % 0.13/0.31 # Presaturation interreduction done % 0.13/0.31 # Number of axioms: 4 Number of unprocessed: 4 % 0.13/0.31 # Tableaux proof search. % 0.13/0.31 # APR header successfully linked. % 0.13/0.31 # Hello from C++ % 0.13/0.31 # The folding up rule is enabled... % 0.13/0.31 # Local unification is enabled... % 0.13/0.31 # Any saturation attempts will use folding labels... % 0.13/0.31 # 4 beginning clauses after preprocessing and clausification % 0.13/0.31 # Creating start rules for all 1 conjectures. % 0.13/0.31 # There are 1 start rule candidates: % 0.13/0.31 # Found 4 unit axioms. % 0.13/0.31 # 1 start rule tableaux created. % 0.13/0.31 # 0 extension rule candidate clauses % 0.13/0.31 # 4 unit axiom clauses % 0.13/0.31 % 0.13/0.31 # Requested 8, 32 cores available to the main process. % 0.13/0.31 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.31 # Creating equality axioms % 0.13/0.31 # Ran out of tableaux, making start rules for all clauses % 0.13/0.31 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.13/0.31 # We now have 11 tableaux to operate on % 0.13/0.36 # There were 1 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 1 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 1 successful branch saturations after the branch. % 0.13/0.36 # There were 1 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 1 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 1 successful branch saturations after the branch. % 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))). % 0.13/0.36 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))). % 0.13/0.36 cnf(i_0_5, plain, (divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3)=X2)). % 0.13/0.36 cnf(i_0_8, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). % 0.13/0.36 cnf(i_0_10, plain, (X4=X4)). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 6 steps % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X9,X9),X10)=inverse(X10)), inference(start_rule)). % 0.13/0.36 cnf(i_0_17, plain, (divide(divide(X9,X9),X10)=inverse(X10)), inference(extension_rule, [i_0_15])). % 0.13/0.36 cnf(i_0_33, plain, (divide(divide(inverse(inverse(X10)),inverse(inverse(X10))),inverse(X10))!=inverse(inverse(X10))), inference(closure_rule, [i_0_7])). % 0.13/0.36 cnf(i_0_32, plain, (multiply(divide(divide(inverse(inverse(X10)),inverse(inverse(X10))),inverse(X10)),divide(divide(X9,X9),X10))=multiply(inverse(inverse(X10)),inverse(X10))), inference(extension_rule, [i_0_13])). % 0.13/0.36 cnf(i_0_43, plain, (multiply(inverse(inverse(X10)),inverse(X10))!=divide(inverse(inverse(X10)),inverse(inverse(X10)))), inference(closure_rule, [i_0_6])). % 0.13/0.36 cnf(i_0_41, plain, (multiply(divide(divide(inverse(inverse(X10)),inverse(inverse(X10))),inverse(X10)),divide(divide(X9,X9),X10))=divide(inverse(inverse(X10)),inverse(inverse(X10)))), inference(etableau_closure_rule, [i_0_41, ...])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))). % 0.13/0.36 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))). % 0.13/0.36 cnf(i_0_5, plain, (divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3)=X2)). % 0.13/0.36 cnf(i_0_8, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). % 0.13/0.36 cnf(i_0_10, plain, (X4=X4)). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 5 steps % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X5,X5),X6)=inverse(X6)), inference(start_rule)). % 0.13/0.36 cnf(i_0_17, plain, (divide(divide(X5,X5),X6)=inverse(X6)), inference(extension_rule, [i_0_16])). % 0.13/0.36 cnf(i_0_35, plain, (inverse(divide(divide(X5,X5),X6))=inverse(inverse(X6))), inference(extension_rule, [i_0_13])). % 0.13/0.36 cnf(i_0_43, plain, (inverse(inverse(X6))!=divide(divide(X1,X1),inverse(X6))), inference(closure_rule, [i_0_7])). % 0.13/0.36 cnf(i_0_41, plain, (inverse(divide(divide(X5,X5),X6))=divide(divide(X1,X1),inverse(X6))), inference(etableau_closure_rule, [i_0_41, ...])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # There were 1 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 1 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 1 successful branch saturations after the branch. % 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))). % 0.13/0.36 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))). % 0.13/0.36 cnf(i_0_5, plain, (divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3)=X2)). % 0.13/0.36 cnf(i_0_8, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). % 0.13/0.36 cnf(i_0_10, plain, (X4=X4)). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 6 steps % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X13,X13),X14)=inverse(X14)), inference(start_rule)). % 0.13/0.36 cnf(i_0_17, plain, (divide(divide(X13,X13),X14)=inverse(X14)), inference(extension_rule, [i_0_15])). % 0.13/0.36 cnf(i_0_34, plain, (divide(divide(X11,X11),X12)!=inverse(X12)), inference(closure_rule, [i_0_7])). % 0.13/0.36 cnf(i_0_32, plain, (multiply(divide(divide(X13,X13),X14),divide(divide(X11,X11),X12))=multiply(inverse(X14),inverse(X12))), inference(extension_rule, [i_0_14])). % 0.13/0.36 cnf(i_0_96, plain, (divide(divide(X1,X1),X2)!=inverse(X2)), inference(closure_rule, [i_0_7])). % 0.13/0.36 cnf(i_0_94, plain, (divide(multiply(divide(divide(X13,X13),X14),divide(divide(X11,X11),X12)),divide(divide(X1,X1),X2))=divide(multiply(inverse(X14),inverse(X12)),inverse(X2))), inference(etableau_closure_rule, [i_0_94, ...])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # There were 1 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 1 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 1 successful branch saturations after the branch. % 0.13/0.36 # Child (20362) has found a proof. % 0.13/0.36 % 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))). % 0.13/0.36 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))). % 0.13/0.36 cnf(i_0_5, plain, (divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3)=X2)). % 0.13/0.36 cnf(i_0_8, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). % 0.13/0.36 cnf(i_0_10, plain, (X4=X4)). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 6 steps % 0.13/0.36 cnf(i_0_7, plain, (divide(divide(X7,X7),X6)=inverse(X6)), inference(start_rule)). % 0.13/0.36 cnf(i_0_17, plain, (divide(divide(X7,X7),X6)=inverse(X6)), inference(extension_rule, [i_0_13])). % 0.13/0.36 cnf(i_0_28, plain, (divide(divide(X8,X8),X6)!=inverse(X6)), inference(closure_rule, [i_0_7])). % 0.13/0.36 cnf(i_0_26, plain, (divide(divide(X7,X7),X6)=divide(divide(X8,X8),X6)), inference(extension_rule, [i_0_15])). % 0.13/0.36 cnf(i_0_93, plain, (divide(divide(X1,X1),X2)!=inverse(X2)), inference(closure_rule, [i_0_7])). % 0.13/0.36 cnf(i_0_91, plain, (multiply(divide(divide(X7,X7),X6),divide(divide(X1,X1),X2))=multiply(divide(divide(X8,X8),X6),inverse(X2))), inference(etableau_closure_rule, [i_0_91, ...])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # Proof search is over... % 0.13/0.36 # Freeing feature tree %------------------------------------------------------------------------------