%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP128-3.004 : 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 : n023.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:48 EDT 2022 % Result : Satisfiable 5.43s 1.13s % Output : CNFRefutation 5.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP128-3.004 : TPTP v8.1.0. Released v1.2.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n023.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jun 14 04:55:21 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U % 0.14/0.39 # and selection function SelectComplexAHPExceptRRHorn. % 0.14/0.39 # % 0.14/0.39 # Number of axioms: 42 Number of unprocessed: 42 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 42 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 31 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 11 extension rule candidate clauses % 0.14/0.39 # 31 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 9 tableaux to operate on % 5.43/1.12 # 9590 Satisfiable branch % 5.43/1.13 # Satisfiable branch found. % 5.43/1.13 # There were 1 total branch saturation attempts. % 5.43/1.13 # There were 0 of these attempts blocked. % 5.43/1.13 # There were 0 deferred branch saturation attempts. % 5.43/1.13 # There were 0 free duplicated saturations. % 5.43/1.13 # There were 0 total successful branch saturations. % 5.43/1.13 # There were 0 successful branch saturations in interreduction. % 5.43/1.13 # There were 0 successful branch saturations on the branch. % 5.43/1.13 # There were 0 successful branch saturations after the branch. % 5.43/1.13 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.43/1.13 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.43/1.13 # Begin clausification derivation % 5.43/1.13 % 5.43/1.13 # End clausification derivation % 5.43/1.13 # Begin listing active clauses obtained from FOF to CNF conversion % 5.43/1.13 cnf(i_0_64, plain, (group_element(e_1))). % 5.43/1.13 cnf(i_0_65, plain, (group_element(e_2))). % 5.43/1.13 cnf(i_0_66, plain, (group_element(e_3))). % 5.43/1.13 cnf(i_0_67, plain, (group_element(e_4))). % 5.43/1.13 cnf(i_0_43, plain, (next(e_0,e_1))). % 5.43/1.13 cnf(i_0_44, plain, (next(e_1,e_2))). % 5.43/1.13 cnf(i_0_45, plain, (next(e_2,e_3))). % 5.43/1.13 cnf(i_0_46, plain, (next(e_3,e_4))). % 5.43/1.13 cnf(i_0_47, plain, (greater(e_1,e_0))). % 5.43/1.13 cnf(i_0_48, plain, (greater(e_2,e_0))). % 5.43/1.13 cnf(i_0_51, plain, (greater(e_2,e_1))). % 5.43/1.13 cnf(i_0_49, plain, (greater(e_3,e_0))). % 5.43/1.13 cnf(i_0_52, plain, (greater(e_3,e_1))). % 5.43/1.13 cnf(i_0_54, plain, (greater(e_3,e_2))). % 5.43/1.13 cnf(i_0_50, plain, (greater(e_4,e_0))). % 5.43/1.13 cnf(i_0_53, plain, (greater(e_4,e_1))). % 5.43/1.13 cnf(i_0_55, plain, (greater(e_4,e_2))). % 5.43/1.13 cnf(i_0_56, plain, (greater(e_4,e_3))). % 5.43/1.13 cnf(i_0_59, plain, (cycle(e_4,e_0))). % 5.43/1.13 cnf(i_0_68, plain, (~equalish(e_1,e_2))). % 5.43/1.13 cnf(i_0_69, plain, (~equalish(e_1,e_3))). % 5.43/1.13 cnf(i_0_70, plain, (~equalish(e_1,e_4))). % 5.43/1.13 cnf(i_0_71, plain, (~equalish(e_2,e_1))). % 5.43/1.13 cnf(i_0_72, plain, (~equalish(e_2,e_3))). % 5.43/1.13 cnf(i_0_73, plain, (~equalish(e_2,e_4))). % 5.43/1.13 cnf(i_0_74, plain, (~equalish(e_3,e_1))). % 5.43/1.13 cnf(i_0_75, plain, (~equalish(e_3,e_2))). % 5.43/1.13 cnf(i_0_76, plain, (~equalish(e_3,e_4))). % 5.43/1.13 cnf(i_0_77, plain, (~equalish(e_4,e_1))). % 5.43/1.13 cnf(i_0_78, plain, (~equalish(e_4,e_2))). % 5.43/1.13 cnf(i_0_79, plain, (~equalish(e_4,e_3))). % 5.43/1.13 cnf(i_0_58, plain, (cycle(X1,e_0)|cycle(X1,e_1)|cycle(X1,e_2)|cycle(X1,e_3)|~group_element(X1))). % 5.43/1.13 cnf(i_0_57, plain, (equalish(X2,X3)|~cycle(X1,X3)|~cycle(X1,X2))). % 5.43/1.13 cnf(i_0_60, plain, (equalish(X2,X5)|~next(X4,X5)|~next(X1,X3)|~cycle(X3,X4)|~cycle(X1,X2)|~greater(X2,e_0))). % 5.43/1.13 cnf(i_0_62, plain, (~greater(X2,X1)|~cycle(X1,e_0)|~product(X1,e_1,X2))). % 5.43/1.13 cnf(i_0_61, plain, (~next(X3,X4)|~greater(X3,X1)|~greater(X2,X5)|~cycle(X4,X5)|~cycle(X1,X2)|~cycle(X3,e_0))). % 5.43/1.13 cnf(i_0_63, plain, (equalish(X3,X4)|~next(X1,X4)|~cycle(X1,X2)|~greater(X2,e_0)|~product(X1,e_1,X3))). % 5.43/1.13 cnf(i_0_81, plain, (equalish(X3,X4)|~product(X1,X2,X4)|~product(X1,X2,X3))). % 5.43/1.13 cnf(i_0_82, plain, (equalish(X2,X4)|~product(X1,X4,X3)|~product(X1,X2,X3))). % 5.43/1.13 cnf(i_0_83, plain, (equalish(X1,X4)|~product(X4,X2,X3)|~product(X1,X2,X3))). % 5.43/1.13 cnf(i_0_84, negated_conjecture, (product(X1,X3,X4)|~product(X3,X2,X4)|~product(X1,X2,X3))). % 5.43/1.13 cnf(i_0_80, plain, (product(X1,X2,e_1)|product(X1,X2,e_2)|product(X1,X2,e_3)|product(X1,X2,e_4)|~group_element(X2)|~group_element(X1))). % 5.43/1.13 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.43/1.13 # Begin printing tableau % 5.43/1.13 # Found 21 steps % 5.43/1.13 cnf(i_0_84, negated_conjecture, (product(e_2,e_1,e_1)|~product(e_1,e_2,e_1)|~product(e_2,e_2,e_1)), inference(start_rule)). % 5.43/1.13 cnf(i_0_85, plain, (product(e_2,e_1,e_1)), inference(extension_rule, [i_0_83])). % 5.43/1.13 cnf(i_0_122, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_68])). % 5.43/1.13 cnf(i_0_124, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_80])). % 5.43/1.13 cnf(i_0_175, plain, (~group_element(e_1)), inference(closure_rule, [i_0_64])). % 5.43/1.13 cnf(i_0_176, plain, (~group_element(e_1)), inference(closure_rule, [i_0_64])). % 5.43/1.13 cnf(i_0_172, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_62])). % 5.43/1.13 cnf(i_0_191, plain, (~greater(e_2,e_1)), inference(closure_rule, [i_0_51])). % 5.43/1.13 cnf(i_0_173, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_63])). % 5.43/1.13 cnf(i_0_214, plain, (equalish(e_3,e_1)), inference(closure_rule, [i_0_74])). % 5.43/1.13 cnf(i_0_217, plain, (~greater(e_1,e_0)), inference(closure_rule, [i_0_47])). % 5.43/1.13 cnf(i_0_174, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_81])). % 5.43/1.13 cnf(i_0_241, plain, (~product(e_1,e_1,e_4)), inference(closure_rule, [i_0_174])). % 5.43/1.13 cnf(i_0_86, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_84])). % 5.43/1.13 cnf(i_0_269, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_80])). % 5.43/1.13 cnf(i_0_301, plain, (~group_element(e_1)), inference(closure_rule, [i_0_64])). % 5.43/1.13 cnf(i_0_298, plain, (product(e_2,e_1,e_2)), inference(extension_rule, [i_0_82])). % 5.43/1.13 cnf(i_0_323, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_71])). % 5.43/1.13 cnf(i_0_299, plain, (product(e_2,e_1,e_3)), inference(extension_rule, [i_0_83])). % 5.43/1.13 cnf(i_0_346, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_68])). % 5.43/1.13 cnf(i_0_302, plain, (~group_element(e_2)), inference(closure_rule, [i_0_65])). % 5.43/1.13 # End printing tableau % 5.43/1.13 # SZS output end % 5.43/1.13 # Branches closed with saturation will be marked with an "s" % 5.43/1.13 # Child (9590) has found a proof. % 5.43/1.13 % 5.43/1.13 # Proof search is over... % 5.43/1.13 # Freeing feature tree %------------------------------------------------------------------------------