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