%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP129-4.005 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 : n020.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:51 EDT 2022 % Result : Satisfiable 24.91s 3.51s % Output : CNFRefutation 24.91s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP129-4.005 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.12 % 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 : n020.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 : Mon Jun 13 11:24:05 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_RG_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: 34 Number of unprocessed: 34 % 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 # 34 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 25 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 9 extension rule candidate clauses % 0.12/0.37 # 25 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 3 % 0.12/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 12 tableaux to operate on % 24.91/3.50 # 15034 Satisfiable branch % 24.91/3.51 # Satisfiable branch found. % 24.91/3.51 # There were 6 total branch saturation attempts. % 24.91/3.51 # There were 0 of these attempts blocked. % 24.91/3.51 # There were 0 deferred branch saturation attempts. % 24.91/3.51 # There were 0 free duplicated saturations. % 24.91/3.51 # There were 4 total successful branch saturations. % 24.91/3.51 # There were 0 successful branch saturations in interreduction. % 24.91/3.51 # There were 0 successful branch saturations on the branch. % 24.91/3.51 # There were 4 successful branch saturations after the branch. % 24.91/3.51 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 24.91/3.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 24.91/3.51 # Begin clausification derivation % 24.91/3.51 % 24.91/3.51 # End clausification derivation % 24.91/3.51 # Begin listing active clauses obtained from FOF to CNF conversion % 24.91/3.51 cnf(i_0_39, plain, (group_element(e_1))). % 24.91/3.51 cnf(i_0_40, plain, (group_element(e_2))). % 24.91/3.51 cnf(i_0_41, plain, (group_element(e_3))). % 24.91/3.51 cnf(i_0_42, plain, (group_element(e_4))). % 24.91/3.51 cnf(i_0_43, plain, (group_element(e_5))). % 24.91/3.51 cnf(i_0_44, plain, (~equalish(e_1,e_2))). % 24.91/3.51 cnf(i_0_45, plain, (~equalish(e_1,e_3))). % 24.91/3.51 cnf(i_0_46, plain, (~equalish(e_1,e_4))). % 24.91/3.51 cnf(i_0_47, plain, (~equalish(e_1,e_5))). % 24.91/3.51 cnf(i_0_48, plain, (~equalish(e_2,e_1))). % 24.91/3.51 cnf(i_0_49, plain, (~equalish(e_2,e_3))). % 24.91/3.51 cnf(i_0_50, plain, (~equalish(e_2,e_4))). % 24.91/3.51 cnf(i_0_51, plain, (~equalish(e_2,e_5))). % 24.91/3.51 cnf(i_0_52, plain, (~equalish(e_3,e_1))). % 24.91/3.51 cnf(i_0_53, plain, (~equalish(e_3,e_2))). % 24.91/3.51 cnf(i_0_54, plain, (~equalish(e_3,e_4))). % 24.91/3.51 cnf(i_0_55, plain, (~equalish(e_3,e_5))). % 24.91/3.51 cnf(i_0_56, plain, (~equalish(e_4,e_1))). % 24.91/3.51 cnf(i_0_57, plain, (~equalish(e_4,e_2))). % 24.91/3.51 cnf(i_0_58, plain, (~equalish(e_4,e_3))). % 24.91/3.51 cnf(i_0_59, plain, (~equalish(e_4,e_5))). % 24.91/3.51 cnf(i_0_60, plain, (~equalish(e_5,e_1))). % 24.91/3.51 cnf(i_0_61, plain, (~equalish(e_5,e_2))). % 24.91/3.51 cnf(i_0_62, plain, (~equalish(e_5,e_3))). % 24.91/3.51 cnf(i_0_63, plain, (~equalish(e_5,e_4))). % 24.91/3.51 cnf(i_0_65, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 24.91/3.51 cnf(i_0_66, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 24.91/3.51 cnf(i_0_67, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 24.91/3.51 cnf(i_0_68, negated_conjecture, (product(X1,X2,X3)|~product(X4,X1,X3)|~product(X2,X4,X1))). % 24.91/3.51 cnf(i_0_38, negated_conjecture, (product(X1,X2,X3)|~product(X4,X1,X2)|~product(X2,X4,X3))). % 24.91/3.51 cnf(i_0_37, negated_conjecture, (product(X1,X2,X3)|~product(X3,X1,X4)|~product(X2,X3,X4))). % 24.91/3.51 cnf(i_0_64, plain, (product(X1,X2,e_5)|product(X1,X2,e_4)|product(X1,X2,e_3)|product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 24.91/3.51 cnf(i_0_36, plain, (product(X1,e_5,X2)|product(X1,e_4,X2)|product(X1,e_3,X2)|product(X1,e_2,X2)|product(X1,e_1,X2)|~group_element(X2)|~group_element(X1))). % 24.91/3.51 cnf(i_0_35, plain, (product(e_5,X1,X2)|product(e_4,X1,X2)|product(e_3,X1,X2)|product(e_2,X1,X2)|product(e_1,X1,X2)|~group_element(X2)|~group_element(X1))). % 24.91/3.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 24.91/3.51 # Begin printing tableau % 24.91/3.51 # Found 39 steps % 24.91/3.51 cnf(i_0_37, negated_conjecture, (product(e_2,e_1,e_5)|~product(e_5,e_2,e_1)|~product(e_1,e_5,e_1)), inference(start_rule)). % 24.91/3.51 cnf(i_0_69, plain, (product(e_2,e_1,e_5)), inference(extension_rule, [i_0_67])). % 24.91/3.51 cnf(i_0_84, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_44])). % 24.91/3.51 cnf(i_0_86, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_64])). % 24.91/3.51 cnf(i_0_131, plain, (~group_element(e_1)), inference(closure_rule, [i_0_39])). % 24.91/3.51 cnf(i_0_132, plain, (~group_element(e_1)), inference(closure_rule, [i_0_39])). % 24.91/3.51 cnf(i_0_127, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_65])). % 24.91/3.51 cnf(i_0_133, plain, (equalish(e_1,e_4)), inference(closure_rule, [i_0_46])). % 24.91/3.51 cnf(i_0_128, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_66])). % 24.91/3.51 cnf(i_0_136, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_48])). % 24.91/3.51 cnf(i_0_129, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_67])). % 24.91/3.51 cnf(i_0_139, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_48])). % 24.91/3.51 cnf(i_0_130, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_37])). % 24.91/3.51 cnf(i_0_70, plain, (~product(e_5,e_2,e_1)), inference(extension_rule, [i_0_36])). % 24.91/3.51 cnf(i_0_164, plain, (~group_element(e_1)), inference(closure_rule, [i_0_39])). % 24.91/3.51 cnf(i_0_165, plain, (~group_element(e_5)), inference(closure_rule, [i_0_43])). % 24.91/3.51 cnf(i_0_159, plain, (product(e_5,e_5,e_1)), inference(extension_rule, [i_0_38])). % 24.91/3.51 cnf(i_0_122569, plain, (product(e_5,e_1,X4)), inference(extension_rule, [i_0_68])). % 24.91/3.51 cnf(i_0_122581, plain, (~product(e_5,e_5,e_1)), inference(closure_rule, [i_0_159])). % 24.91/3.51 cnf(i_0_122571, plain, (~product(e_1,e_5,X4)), inference(extension_rule, [i_0_35])). % 24.91/3.51 cnf(i_0_122588, plain, (~group_element(e_5)), inference(closure_rule, [i_0_43])). % 24.91/3.51 cnf(i_0_160, plain, (product(e_5,e_4,e_1)), inference(extension_rule, [i_0_65])). % 24.91/3.51 cnf(i_0_122596, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_48])). % 24.91/3.51 cnf(i_0_122598, plain, (~product(e_5,e_4,e_2)), inference(extension_rule, [i_0_37])). % 24.91/3.51 cnf(i_0_161, plain, (product(e_5,e_3,e_1)), inference(extension_rule, [i_0_66])). % 24.91/3.51 cnf(i_0_122622, plain, (equalish(e_1,e_3)), inference(closure_rule, [i_0_45])). % 24.91/3.51 cnf(i_0_122624, plain, (~product(e_5,e_1,e_1)), inference(extension_rule, [i_0_64])). % 24.91/3.51 cnf(i_0_122630, plain, (~group_element(e_1)), inference(closure_rule, [i_0_39])). % 24.91/3.51 cnf(i_0_122631, plain, (~group_element(e_5)), inference(closure_rule, [i_0_43])). % 24.91/3.51 cnf(i_0_163, plain, (product(e_5,e_1,e_1)), inference(extension_rule, [i_0_67])). % 24.91/3.51 cnf(i_0_122632, plain, (equalish(e_1,e_5)), inference(closure_rule, [i_0_47])). % 24.91/3.51 cnf(i_0_122634, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_36])). % 24.91/3.51 cnf(i_0_122640, plain, (~group_element(e_1)), inference(closure_rule, [i_0_39])). % 24.91/3.51 cnf(i_0_122641, plain, (~group_element(e_1)), inference(closure_rule, [i_0_39])). % 24.91/3.51 cnf(i_0_71, plain, (~product(e_1,e_5,e_1)), inference(extension_rule, [i_0_38])). % 24.91/3.51 cnf(i_0_135, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_135, ...])). % 24.91/3.51 cnf(i_0_138, plain, (~product(e_1,e_2,e_3)), inference(etableau_closure_rule, [i_0_138, ...])). % 24.91/3.51 cnf(i_0_141, plain, (~product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_141, ...])). % 24.91/3.51 cnf(i_0_122625, plain, (product(e_5,e_1,e_5)), inference(etableau_closure_rule, [i_0_122625, ...])). % 24.91/3.51 # End printing tableau % 24.91/3.51 # SZS output end % 24.91/3.51 # Branches closed with saturation will be marked with an "s" % 24.91/3.51 # Child (15034) has found a proof. % 24.91/3.51 % 24.91/3.51 # Proof search is over... % 24.91/3.51 # Freeing feature tree %------------------------------------------------------------------------------