%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP130-1.005 : 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 : n024.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:52 EDT 2022 % Result : Satisfiable 43.60s 5.94s % Output : CNFRefutation 43.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : GRP130-1.005 : TPTP v8.1.0. Released v1.2.0. % 0.12/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.35 % Computer : n024.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 13 07:24:03 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 30 Number of unprocessed: 30 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 30 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 25 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 5 extension rule candidate clauses % 0.13/0.38 # 25 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 11 tableaux to operate on % 43.60/5.93 # 15999 Satisfiable branch % 43.60/5.94 # Satisfiable branch found. % 43.60/5.94 # There were 8 total branch saturation attempts. % 43.60/5.94 # There were 0 of these attempts blocked. % 43.60/5.94 # There were 0 deferred branch saturation attempts. % 43.60/5.94 # There were 0 free duplicated saturations. % 43.60/5.94 # There were 6 total successful branch saturations. % 43.60/5.94 # There were 0 successful branch saturations in interreduction. % 43.60/5.94 # There were 0 successful branch saturations on the branch. % 43.60/5.94 # There were 6 successful branch saturations after the branch. % 43.60/5.94 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 43.60/5.94 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 43.60/5.94 # Begin clausification derivation % 43.60/5.94 % 43.60/5.94 # End clausification derivation % 43.60/5.94 # Begin listing active clauses obtained from FOF to CNF conversion % 43.60/5.94 cnf(i_0_31, plain, (group_element(e_1))). % 43.60/5.94 cnf(i_0_32, plain, (group_element(e_2))). % 43.60/5.94 cnf(i_0_33, plain, (group_element(e_3))). % 43.60/5.94 cnf(i_0_34, plain, (group_element(e_4))). % 43.60/5.94 cnf(i_0_35, plain, (group_element(e_5))). % 43.60/5.94 cnf(i_0_36, plain, (~equalish(e_1,e_2))). % 43.60/5.94 cnf(i_0_37, plain, (~equalish(e_1,e_3))). % 43.60/5.94 cnf(i_0_38, plain, (~equalish(e_1,e_4))). % 43.60/5.94 cnf(i_0_39, plain, (~equalish(e_1,e_5))). % 43.60/5.94 cnf(i_0_40, plain, (~equalish(e_2,e_1))). % 43.60/5.94 cnf(i_0_41, plain, (~equalish(e_2,e_3))). % 43.60/5.94 cnf(i_0_42, plain, (~equalish(e_2,e_4))). % 43.60/5.94 cnf(i_0_43, plain, (~equalish(e_2,e_5))). % 43.60/5.94 cnf(i_0_44, plain, (~equalish(e_3,e_1))). % 43.60/5.94 cnf(i_0_45, plain, (~equalish(e_3,e_2))). % 43.60/5.94 cnf(i_0_46, plain, (~equalish(e_3,e_4))). % 43.60/5.94 cnf(i_0_47, plain, (~equalish(e_3,e_5))). % 43.60/5.94 cnf(i_0_48, plain, (~equalish(e_4,e_1))). % 43.60/5.94 cnf(i_0_49, plain, (~equalish(e_4,e_2))). % 43.60/5.94 cnf(i_0_50, plain, (~equalish(e_4,e_3))). % 43.60/5.94 cnf(i_0_51, plain, (~equalish(e_4,e_5))). % 43.60/5.94 cnf(i_0_52, plain, (~equalish(e_5,e_1))). % 43.60/5.94 cnf(i_0_53, plain, (~equalish(e_5,e_2))). % 43.60/5.94 cnf(i_0_54, plain, (~equalish(e_5,e_3))). % 43.60/5.94 cnf(i_0_55, plain, (~equalish(e_5,e_4))). % 43.60/5.94 cnf(i_0_57, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 43.60/5.94 cnf(i_0_58, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 43.60/5.94 cnf(i_0_59, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 43.60/5.94 cnf(i_0_60, negated_conjecture, (product(X1,X2,X3)|~product(X3,X4,X1)|~product(X3,X2,X4))). % 43.60/5.94 cnf(i_0_56, 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))). % 43.60/5.94 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 43.60/5.94 # Begin printing tableau % 43.60/5.94 # Found 41 steps % 43.60/5.94 cnf(i_0_60, negated_conjecture, (product(e_5,e_2,e_1)|~product(e_1,e_1,e_5)|~product(e_1,e_2,e_1)), inference(start_rule)). % 43.60/5.94 cnf(i_0_62, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_56])). % 43.60/5.94 cnf(i_0_97, plain, (~group_element(e_1)), inference(closure_rule, [i_0_31])). % 43.60/5.94 cnf(i_0_98, plain, (~group_element(e_1)), inference(closure_rule, [i_0_31])). % 43.60/5.94 cnf(i_0_93, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_57])). % 43.60/5.94 cnf(i_0_102, plain, (equalish(e_1,e_4)), inference(closure_rule, [i_0_38])). % 43.60/5.94 cnf(i_0_104, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_60])). % 43.60/5.94 cnf(i_0_120, plain, (~product(e_1,e_1,e_4)), inference(closure_rule, [i_0_93])). % 43.60/5.94 cnf(i_0_94, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_58])). % 43.60/5.94 cnf(i_0_121, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_40])). % 43.60/5.94 cnf(i_0_123, plain, (~product(e_1,e_2,e_3)), inference(extension_rule, [i_0_56])). % 43.60/5.94 cnf(i_0_132, plain, (~group_element(e_2)), inference(closure_rule, [i_0_32])). % 43.60/5.94 cnf(i_0_133, plain, (~group_element(e_1)), inference(closure_rule, [i_0_31])). % 43.60/5.94 cnf(i_0_95, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_59])). % 43.60/5.94 cnf(i_0_134, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_40])). % 43.60/5.94 cnf(i_0_136, plain, (~product(e_2,e_1,e_2)), inference(extension_rule, [i_0_60])). % 43.60/5.94 cnf(i_0_96, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_57])). % 43.60/5.94 cnf(i_0_143, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_40])). % 43.60/5.94 cnf(i_0_145, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_60])). % 43.60/5.94 cnf(i_0_61, plain, (product(e_5,e_2,e_1)), inference(extension_rule, [i_0_58])). % 43.60/5.94 cnf(i_0_162, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_36])). % 43.60/5.94 cnf(i_0_164, plain, (~product(e_5,e_1,e_1)), inference(extension_rule, [i_0_56])). % 43.60/5.94 cnf(i_0_206273, plain, (~group_element(e_1)), inference(closure_rule, [i_0_31])). % 43.60/5.94 cnf(i_0_206274, plain, (~group_element(e_5)), inference(closure_rule, [i_0_35])). % 43.60/5.94 cnf(i_0_206268, plain, (product(e_5,e_1,e_5)), inference(extension_rule, [i_0_59])). % 43.60/5.94 cnf(i_0_206275, plain, (equalish(e_1,e_5)), inference(closure_rule, [i_0_39])). % 43.60/5.94 cnf(i_0_206269, plain, (product(e_5,e_1,e_4)), inference(extension_rule, [i_0_57])). % 43.60/5.94 cnf(i_0_206280, plain, (~product(e_5,e_1,e_4)), inference(closure_rule, [i_0_206269])). % 43.60/5.94 cnf(i_0_206270, plain, (product(e_5,e_1,e_3)), inference(extension_rule, [i_0_60])). % 43.60/5.94 cnf(i_0_206283, plain, (~product(e_5,e_2,e_1)), inference(closure_rule, [i_0_61])). % 43.60/5.94 cnf(i_0_206271, plain, (product(e_5,e_1,e_2)), inference(extension_rule, [i_0_58])). % 43.60/5.94 cnf(i_0_206284, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_40])). % 43.60/5.94 cnf(i_0_63, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_56])). % 43.60/5.94 cnf(i_0_206292, plain, (~group_element(e_2)), inference(closure_rule, [i_0_32])). % 43.60/5.94 cnf(i_0_206293, plain, (~group_element(e_1)), inference(closure_rule, [i_0_31])). % 43.60/5.94 cnf(i_0_119, plain, (~product(e_1,e_4,e_1)), inference(etableau_closure_rule, [i_0_119, ...])). % 43.60/5.94 cnf(i_0_127, plain, (product(e_1,e_2,e_5)), inference(etableau_closure_rule, [i_0_127, ...])). % 43.60/5.94 cnf(i_0_128, plain, (product(e_1,e_2,e_4)), inference(etableau_closure_rule, [i_0_128, ...])). % 43.60/5.94 cnf(i_0_130, plain, (product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_130, ...])). % 43.60/5.94 cnf(i_0_131, plain, (product(e_1,e_2,e_1)), inference(etableau_closure_rule, [i_0_131, ...])). % 43.60/5.94 cnf(i_0_206277, plain, (~product(e_1,e_1,e_5)), inference(etableau_closure_rule, [i_0_206277, ...])). % 43.60/5.94 # End printing tableau % 43.60/5.94 # SZS output end % 43.60/5.94 # Branches closed with saturation will be marked with an "s" % 43.60/5.95 # Child (15999) has found a proof. % 43.60/5.95 % 43.60/5.95 # Proof search is over... % 43.60/5.95 # Freeing feature tree %------------------------------------------------------------------------------