%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP135-2.002 : TPTP v8.1.0. Released v1.2.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:04:59 EDT 2022 % Result : Unsatisfiable 0.06s 0.28s % Output : CNFRefutation 0.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.07 % Problem : GRP135-2.002 : TPTP v8.1.0. Released v1.2.0. % 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.06/0.26 % Computer : n007.cluster.edu % 0.06/0.26 % Model : x86_64 x86_64 % 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.26 % Memory : 8042.1875MB % 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.26 % CPULimit : 300 % 0.06/0.26 % WCLimit : 600 % 0.06/0.26 % DateTime : Tue Jun 14 12:10:24 EDT 2022 % 0.06/0.26 % CPUTime : % 0.06/0.27 # No SInE strategy applied % 0.06/0.27 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.06/0.27 # and selection function SelectComplexExceptUniqMaxHorn. % 0.06/0.27 # % 0.06/0.27 # Presaturation interreduction done % 0.06/0.27 # Number of axioms: 12 Number of unprocessed: 12 % 0.06/0.27 # Tableaux proof search. % 0.06/0.27 # APR header successfully linked. % 0.06/0.27 # Hello from C++ % 0.06/0.27 # The folding up rule is enabled... % 0.06/0.27 # Local unification is enabled... % 0.06/0.27 # Any saturation attempts will use folding labels... % 0.06/0.27 # 12 beginning clauses after preprocessing and clausification % 0.06/0.27 # Creating start rules for all 1 conjectures. % 0.06/0.27 # There are 1 start rule candidates: % 0.06/0.27 # Found 6 unit axioms. % 0.06/0.27 # 1 start rule tableaux created. % 0.06/0.27 # 6 extension rule candidate clauses % 0.06/0.27 # 6 unit axiom clauses % 0.06/0.27 % 0.06/0.27 # Requested 8, 32 cores available to the main process. % 0.06/0.27 # There are not enough tableaux to fork, creating more from the initial 1 % 0.06/0.27 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.06/0.27 # We now have 8 tableaux to operate on % 0.06/0.28 # Ran out of tableaux, making start rules for all clauses % 0.06/0.28 # There were 2 total branch saturation attempts. % 0.06/0.28 # There were 0 of these attempts blocked. % 0.06/0.28 # There were 0 deferred branch saturation attempts. % 0.06/0.28 # There were 0 free duplicated saturations. % 0.06/0.28 # There were 2 total successful branch saturations. % 0.06/0.28 # There were 0 successful branch saturations in interreduction. % 0.06/0.28 # There were 0 successful branch saturations on the branch. % 0.06/0.28 # There were 2 successful branch saturations after the branch. % 0.06/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.28 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.28 # Begin clausification derivation % 0.06/0.28 % 0.06/0.28 # End clausification derivation % 0.06/0.28 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.28 cnf(i_0_16, plain, (group_element(e_1))). % 0.06/0.28 cnf(i_0_17, plain, (group_element(e_2))). % 0.06/0.28 cnf(i_0_13, plain, (next(e_1,e_2))). % 0.06/0.28 cnf(i_0_14, plain, (greater(e_2,e_1))). % 0.06/0.28 cnf(i_0_18, plain, (~equalish(e_1,e_2))). % 0.06/0.28 cnf(i_0_19, plain, (~equalish(e_2,e_1))). % 0.06/0.28 cnf(i_0_21, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.06/0.28 cnf(i_0_15, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))). % 0.06/0.28 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 0.06/0.28 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 0.06/0.28 cnf(i_0_24, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))). % 0.06/0.28 cnf(i_0_20, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.06/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.28 # Begin printing tableau % 0.06/0.28 # Found 9 steps % 0.06/0.28 cnf(i_0_20, plain, (product(e_1,e_1,e_2)|product(e_1,e_1,e_1)|~group_element(e_1)|~group_element(e_1)), inference(start_rule)). % 0.06/0.28 cnf(i_0_89, plain, (~group_element(e_1)), inference(closure_rule, [i_0_16])). % 0.06/0.28 cnf(i_0_90, plain, (~group_element(e_1)), inference(closure_rule, [i_0_16])). % 0.06/0.28 cnf(i_0_87, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_21])). % 0.06/0.28 cnf(i_0_91, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_18])). % 0.06/0.28 cnf(i_0_93, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_24])). % 0.06/0.28 cnf(i_0_109, plain, (~product(e_1,e_1,e_2)), inference(closure_rule, [i_0_87])). % 0.06/0.28 cnf(i_0_88, plain, (product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_88, ...])). % 0.06/0.28 cnf(i_0_108, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_108, ...])). % 0.06/0.28 # End printing tableau % 0.06/0.28 # SZS output end % 0.06/0.28 # Branches closed with saturation will be marked with an "s" % 0.06/0.28 # There were 3 total branch saturation attempts. % 0.06/0.28 # There were 0 of these attempts blocked. % 0.06/0.28 # There were 0 deferred branch saturation attempts. % 0.06/0.28 # There were 0 free duplicated saturations. % 0.06/0.28 # There were 3 total successful branch saturations. % 0.06/0.28 # There were 0 successful branch saturations in interreduction. % 0.06/0.28 # There were 0 successful branch saturations on the branch. % 0.06/0.28 # There were 3 successful branch saturations after the branch. % 0.06/0.28 # There were 3 total branch saturation attempts. % 0.06/0.28 # There were 0 of these attempts blocked. % 0.06/0.28 # There were 0 deferred branch saturation attempts. % 0.06/0.28 # There were 0 free duplicated saturations. % 0.06/0.28 # There were 3 total successful branch saturations. % 0.06/0.28 # There were 0 successful branch saturations in interreduction. % 0.06/0.28 # There were 0 successful branch saturations on the branch. % 0.06/0.28 # There were 3 successful branch saturations after the branch. % 0.06/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.28 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.28 # Begin clausification derivation % 0.06/0.28 % 0.06/0.28 # End clausification derivation % 0.06/0.28 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.28 cnf(i_0_16, plain, (group_element(e_1))). % 0.06/0.28 cnf(i_0_17, plain, (group_element(e_2))). % 0.06/0.28 cnf(i_0_13, plain, (next(e_1,e_2))). % 0.06/0.28 cnf(i_0_14, plain, (greater(e_2,e_1))). % 0.06/0.28 cnf(i_0_18, plain, (~equalish(e_1,e_2))). % 0.06/0.28 cnf(i_0_19, plain, (~equalish(e_2,e_1))). % 0.06/0.28 cnf(i_0_21, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.06/0.28 cnf(i_0_15, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))). % 0.06/0.28 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 0.06/0.28 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 0.06/0.28 cnf(i_0_24, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))). % 0.06/0.28 cnf(i_0_20, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.06/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.28 # Begin printing tableau % 0.06/0.28 # Found 13 steps % 0.06/0.28 cnf(i_0_24, negated_conjecture, (product(e_2,e_2,e_2)|~product(e_1,e_2,e_2)|~product(e_2,e_2,e_1)), inference(start_rule)). % 0.06/0.28 cnf(i_0_25, plain, (product(e_2,e_2,e_2)), inference(extension_rule, [i_0_24])). % 0.06/0.28 cnf(i_0_44, plain, (product(e_2,e_2,e_2)), inference(extension_rule, [i_0_21])). % 0.06/0.28 cnf(i_0_46, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_25])). % 0.06/0.28 cnf(i_0_47, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_18])). % 0.06/0.28 cnf(i_0_49, plain, (~product(e_2,e_2,e_1)), inference(extension_rule, [i_0_24])). % 0.06/0.28 cnf(i_0_64, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_44])). % 0.06/0.28 cnf(i_0_26, plain, (~product(e_1,e_2,e_2)), inference(extension_rule, [i_0_20])). % 0.06/0.28 cnf(i_0_77, plain, (~group_element(e_2)), inference(closure_rule, [i_0_17])). % 0.06/0.28 cnf(i_0_78, plain, (~group_element(e_1)), inference(closure_rule, [i_0_16])). % 0.06/0.28 cnf(i_0_27, plain, (~product(e_2,e_2,e_1)), inference(etableau_closure_rule, [i_0_27, ...])). % 0.06/0.28 cnf(i_0_65, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.06/0.28 cnf(i_0_76, plain, (product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_76, ...])). % 0.06/0.28 # End printing tableau % 0.06/0.28 # SZS output end % 0.06/0.28 # Branches closed with saturation will be marked with an "s" % 0.06/0.28 # There were 3 total branch saturation attempts. % 0.06/0.28 # There were 0 of these attempts blocked. % 0.06/0.28 # There were 0 deferred branch saturation attempts. % 0.06/0.28 # There were 0 free duplicated saturations. % 0.06/0.28 # There were 3 total successful branch saturations. % 0.06/0.28 # There were 0 successful branch saturations in interreduction. % 0.06/0.28 # There were 0 successful branch saturations on the branch. % 0.06/0.28 # There were 3 successful branch saturations after the branch. % 0.06/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.28 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.28 # Begin clausification derivation % 0.06/0.28 % 0.06/0.28 # End clausification derivation % 0.06/0.28 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.28 cnf(i_0_16, plain, (group_element(e_1))). % 0.06/0.28 cnf(i_0_17, plain, (group_element(e_2))). % 0.06/0.28 cnf(i_0_13, plain, (next(e_1,e_2))). % 0.06/0.28 cnf(i_0_14, plain, (greater(e_2,e_1))). % 0.06/0.28 cnf(i_0_18, plain, (~equalish(e_1,e_2))). % 0.06/0.28 cnf(i_0_19, plain, (~equalish(e_2,e_1))). % 0.06/0.28 cnf(i_0_21, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.06/0.28 cnf(i_0_15, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))). % 0.06/0.28 cnf(i_0_22, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 0.06/0.28 cnf(i_0_23, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 0.06/0.28 cnf(i_0_24, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))). % 0.06/0.28 cnf(i_0_20, plain, (product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.06/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.28 # Begin printing tableau % 0.06/0.28 # Found 16 steps % 0.06/0.28 cnf(i_0_24, negated_conjecture, (product(e_1,e_1,e_2)|~product(e_2,e_1,e_1)|~product(e_1,e_2,e_2)), inference(start_rule)). % 0.06/0.28 cnf(i_0_25, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_23])). % 0.06/0.28 cnf(i_0_37, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_18])). % 0.06/0.28 cnf(i_0_38, plain, (~product(e_2,e_1,e_2)), inference(extension_rule, [i_0_20])). % 0.06/0.28 cnf(i_0_61, plain, (~group_element(e_1)), inference(closure_rule, [i_0_16])). % 0.06/0.28 cnf(i_0_62, plain, (~group_element(e_2)), inference(closure_rule, [i_0_17])). % 0.06/0.28 cnf(i_0_60, plain, (product(e_2,e_1,e_1)), inference(extension_rule, [i_0_21])). % 0.06/0.28 cnf(i_0_65, plain, (~product(e_2,e_1,e_1)), inference(closure_rule, [i_0_60])). % 0.06/0.28 cnf(i_0_26, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_24])). % 0.06/0.28 cnf(i_0_76, plain, (~product(e_2,e_1,e_2)), inference(extension_rule, [i_0_20])). % 0.06/0.28 cnf(i_0_88, plain, (product(e_2,e_1,e_1)), inference(closure_rule, [i_0_26])). % 0.06/0.28 cnf(i_0_89, plain, (~group_element(e_1)), inference(closure_rule, [i_0_16])). % 0.06/0.28 cnf(i_0_90, plain, (~group_element(e_2)), inference(closure_rule, [i_0_17])). % 0.06/0.28 cnf(i_0_27, plain, (~product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_27, ...])). % 0.06/0.28 cnf(i_0_63, plain, (equalish(e_1,e_1)), inference(etableau_closure_rule, [i_0_63, ...])). % 0.06/0.28 cnf(i_0_77, plain, (~product(e_1,e_1,e_2)), inference(etableau_closure_rule, [i_0_77, ...])). % 0.06/0.28 # End printing tableau % 0.06/0.28 # SZS output end % 0.06/0.28 # Branches closed with saturation will be marked with an "s" % 0.06/0.28 # Child (22470) has found a proof. % 0.06/0.28 % 0.06/0.28 # Proof search is over... % 0.06/0.28 # Freeing feature tree %------------------------------------------------------------------------------