%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP056-1 : TPTP v8.1.0. Released v1.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 : n012.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:04:13 EDT 2022 % Result : Unsatisfiable 43.02s 43.21s % Output : CNFRefutation 43.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP056-1 : TPTP v8.1.0. Released v1.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 : n012.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 : Mon Jun 13 20:58:55 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 2 Number of unprocessed: 2 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 40.50/40.67 # The folding up rule is enabled... % 40.50/40.67 # Local unification is enabled... % 40.50/40.67 # Any saturation attempts will use folding labels... % 40.50/40.67 # 2 beginning clauses after preprocessing and clausification % 40.50/40.67 # Creating start rules for all 1 conjectures. % 40.50/40.67 # There are 1 start rule candidates: % 40.50/40.67 # Found 1 unit axioms. % 40.50/40.67 # 1 start rule tableaux created. % 40.50/40.67 # 1 extension rule candidate clauses % 40.50/40.67 # 1 unit axiom clauses % 40.50/40.67 % 40.50/40.67 # Requested 8, 32 cores available to the main process. % 40.50/40.67 # There are not enough tableaux to fork, creating more from the initial 1 % 40.50/40.67 # Creating equality axioms % 40.50/40.67 # Ran out of tableaux, making start rules for all clauses % 43.02/43.21 # There were 1 total branch saturation attempts. % 43.02/43.21 # There were 0 of these attempts blocked. % 43.02/43.21 # There were 0 deferred branch saturation attempts. % 43.02/43.21 # There were 0 free duplicated saturations. % 43.02/43.21 # There were 1 total successful branch saturations. % 43.02/43.21 # There were 0 successful branch saturations in interreduction. % 43.02/43.21 # There were 0 successful branch saturations on the branch. % 43.02/43.21 # There were 1 successful branch saturations after the branch. % 43.02/43.21 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 43.02/43.21 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 43.02/43.21 # Begin clausification derivation % 43.02/43.21 % 43.02/43.21 # End clausification derivation % 43.02/43.21 # Begin listing active clauses obtained from FOF to CNF conversion % 43.02/43.21 cnf(i_0_3, plain, (multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3)))=X2)). % 43.02/43.21 cnf(i_0_4, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)). % 43.02/43.21 cnf(i_0_17, plain, (X4=X4)). % 43.02/43.21 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 43.02/43.21 # Begin printing tableau % 43.02/43.21 # Found 6 steps % 43.02/43.21 cnf(i_0_3, plain, (multiply(inverse(multiply(inverse(multiply(X10,inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),X11)))),multiply(X10,inverse(X11)))),inverse(multiply(inverse(X11),X11)))=inverse(multiply(inverse(X3),X3))), inference(start_rule)). % 43.02/43.21 cnf(i_0_23, plain, (multiply(inverse(multiply(inverse(multiply(X10,inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),X11)))),multiply(X10,inverse(X11)))),inverse(multiply(inverse(X11),X11)))=inverse(multiply(inverse(X3),X3))), inference(extension_rule, [i_0_22])). % 43.02/43.21 cnf(i_0_41, plain, (multiply(inverse(multiply(inverse(multiply(X16,inverse(multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X9),X3)))),multiply(X1,inverse(X3))))),X14)))),multiply(X16,inverse(X14)))),inverse(multiply(inverse(X14),X14)))!=inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X9),X3)))),multiply(X1,inverse(X3))))), inference(closure_rule, [i_0_3])). % 43.02/43.21 cnf(i_0_40, plain, (multiply(multiply(inverse(multiply(inverse(multiply(X16,inverse(multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X9),X3)))),multiply(X1,inverse(X3))))),X14)))),multiply(X16,inverse(X14)))),inverse(multiply(inverse(X14),X14))),multiply(inverse(multiply(inverse(multiply(X10,inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),X11)))),multiply(X10,inverse(X11)))),inverse(multiply(inverse(X11),X11))))=multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X9),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3)))), inference(extension_rule, [i_0_20])). % 43.02/43.21 cnf(i_0_52, plain, (multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X9),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3)))!=X9), inference(closure_rule, [i_0_3])). % 43.02/43.21 cnf(i_0_50, plain, (multiply(multiply(inverse(multiply(inverse(multiply(X16,inverse(multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X9),X3)))),multiply(X1,inverse(X3))))),X14)))),multiply(X16,inverse(X14)))),inverse(multiply(inverse(X14),X14))),multiply(inverse(multiply(inverse(multiply(X10,inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),X11)))),multiply(X10,inverse(X11)))),inverse(multiply(inverse(X11),X11))))=X9), inference(etableau_closure_rule, [i_0_50, ...])). % 43.02/43.21 # End printing tableau % 43.02/43.21 # SZS output end % 43.02/43.21 # Branches closed with saturation will be marked with an "s" % 43.02/43.21 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 43.02/43.21 # We now have 7 tableaux to operate on % 43.02/43.21 # Found closed tableau during pool population. % 43.02/43.21 # Proof search is over... % 43.02/43.21 # Freeing feature tree %------------------------------------------------------------------------------