%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP129-2.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 : n018.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:49 EDT 2022 % Result : Satisfiable 51.59s 6.87s % Output : CNFRefutation 51.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : GRP129-2.005 : TPTP v8.1.0. Released v1.2.0. % 0.04/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n018.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jun 13 07:31:12 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.13/0.36 # and selection function SelectCQIPrecW. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 45 Number of unprocessed: 45 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 45 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 39 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 6 extension rule candidate clauses % 0.13/0.36 # 39 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 9 tableaux to operate on % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.39 # Ran out of tableaux, making start rules for all clauses % 51.59/6.86 # 3047 Satisfiable branch % 51.59/6.87 # Satisfiable branch found. % 51.59/6.87 # There were 5 total branch saturation attempts. % 51.59/6.87 # There were 0 of these attempts blocked. % 51.59/6.87 # There were 0 deferred branch saturation attempts. % 51.59/6.87 # There were 0 free duplicated saturations. % 51.59/6.87 # There were 3 total successful branch saturations. % 51.59/6.87 # There were 0 successful branch saturations in interreduction. % 51.59/6.87 # There were 0 successful branch saturations on the branch. % 51.59/6.87 # There were 3 successful branch saturations after the branch. % 51.59/6.87 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 51.59/6.87 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 51.59/6.87 # Begin clausification derivation % 51.59/6.87 % 51.59/6.87 # End clausification derivation % 51.59/6.87 # Begin listing active clauses obtained from FOF to CNF conversion % 51.59/6.87 cnf(i_0_61, plain, (group_element(e_1))). % 51.59/6.87 cnf(i_0_62, plain, (group_element(e_2))). % 51.59/6.87 cnf(i_0_63, plain, (group_element(e_3))). % 51.59/6.87 cnf(i_0_64, plain, (group_element(e_4))). % 51.59/6.87 cnf(i_0_65, plain, (group_element(e_5))). % 51.59/6.87 cnf(i_0_46, plain, (next(e_1,e_2))). % 51.59/6.87 cnf(i_0_47, plain, (next(e_2,e_3))). % 51.59/6.87 cnf(i_0_48, plain, (next(e_3,e_4))). % 51.59/6.87 cnf(i_0_49, plain, (next(e_4,e_5))). % 51.59/6.87 cnf(i_0_50, plain, (greater(e_2,e_1))). % 51.59/6.87 cnf(i_0_51, plain, (greater(e_3,e_1))). % 51.59/6.87 cnf(i_0_54, plain, (greater(e_3,e_2))). % 51.59/6.87 cnf(i_0_52, plain, (greater(e_4,e_1))). % 51.59/6.87 cnf(i_0_55, plain, (greater(e_4,e_2))). % 51.59/6.87 cnf(i_0_57, plain, (greater(e_4,e_3))). % 51.59/6.87 cnf(i_0_53, plain, (greater(e_5,e_1))). % 51.59/6.87 cnf(i_0_56, plain, (greater(e_5,e_2))). % 51.59/6.87 cnf(i_0_58, plain, (greater(e_5,e_3))). % 51.59/6.87 cnf(i_0_59, plain, (greater(e_5,e_4))). % 51.59/6.87 cnf(i_0_66, plain, (~equalish(e_1,e_2))). % 51.59/6.87 cnf(i_0_67, plain, (~equalish(e_1,e_3))). % 51.59/6.87 cnf(i_0_68, plain, (~equalish(e_1,e_4))). % 51.59/6.87 cnf(i_0_69, plain, (~equalish(e_1,e_5))). % 51.59/6.87 cnf(i_0_70, plain, (~equalish(e_2,e_1))). % 51.59/6.87 cnf(i_0_71, plain, (~equalish(e_2,e_3))). % 51.59/6.87 cnf(i_0_72, plain, (~equalish(e_2,e_4))). % 51.59/6.87 cnf(i_0_73, plain, (~equalish(e_2,e_5))). % 51.59/6.87 cnf(i_0_74, plain, (~equalish(e_3,e_1))). % 51.59/6.87 cnf(i_0_75, plain, (~equalish(e_3,e_2))). % 51.59/6.87 cnf(i_0_76, plain, (~equalish(e_3,e_4))). % 51.59/6.87 cnf(i_0_77, plain, (~equalish(e_3,e_5))). % 51.59/6.87 cnf(i_0_78, plain, (~equalish(e_4,e_1))). % 51.59/6.87 cnf(i_0_79, plain, (~equalish(e_4,e_2))). % 51.59/6.87 cnf(i_0_80, plain, (~equalish(e_4,e_3))). % 51.59/6.87 cnf(i_0_81, plain, (~equalish(e_4,e_5))). % 51.59/6.87 cnf(i_0_82, plain, (~equalish(e_5,e_1))). % 51.59/6.87 cnf(i_0_83, plain, (~equalish(e_5,e_2))). % 51.59/6.87 cnf(i_0_84, plain, (~equalish(e_5,e_3))). % 51.59/6.87 cnf(i_0_85, plain, (~equalish(e_5,e_4))). % 51.59/6.87 cnf(i_0_87, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 51.59/6.87 cnf(i_0_60, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))). % 51.59/6.87 cnf(i_0_88, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 51.59/6.87 cnf(i_0_89, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 51.59/6.87 cnf(i_0_90, negated_conjecture, (product(X1,X2,X3)|~product(X4,X1,X3)|~product(X2,X4,X1))). % 51.59/6.87 cnf(i_0_86, 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))). % 51.59/6.87 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 51.59/6.87 # Begin printing tableau % 51.59/6.87 # Found 38 steps % 51.59/6.87 cnf(i_0_90, negated_conjecture, (product(e_1,e_2,e_5)|~product(e_1,e_1,e_5)|~product(e_2,e_1,e_1)), inference(start_rule)). % 51.59/6.87 cnf(i_0_91, plain, (product(e_1,e_2,e_5)), inference(extension_rule, [i_0_88])). % 51.59/6.87 cnf(i_0_100, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_66])). % 51.59/6.87 cnf(i_0_102, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_86])). % 51.59/6.87 cnf(i_0_133, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 51.59/6.87 cnf(i_0_134, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 51.59/6.87 cnf(i_0_129, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_87])). % 51.59/6.87 cnf(i_0_135, plain, (equalish(e_1,e_4)), inference(closure_rule, [i_0_68])). % 51.59/6.87 cnf(i_0_130, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_60])). % 51.59/6.87 cnf(i_0_139, plain, (~greater(e_3,e_1)), inference(closure_rule, [i_0_51])). % 51.59/6.87 cnf(i_0_131, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_88])). % 51.59/6.87 cnf(i_0_141, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_70])). % 51.59/6.87 cnf(i_0_132, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_89])). % 51.59/6.87 cnf(i_0_144, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_70])). % 51.59/6.87 cnf(i_0_92, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_90])). % 51.59/6.87 cnf(i_0_148, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_86])). % 51.59/6.87 cnf(i_0_155, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 51.59/6.87 cnf(i_0_156, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 51.59/6.87 cnf(i_0_151, plain, (product(e_1,e_1,e_4)), inference(extension_rule, [i_0_87])). % 51.59/6.87 cnf(i_0_209071, plain, (equalish(e_1,e_4)), inference(closure_rule, [i_0_68])). % 51.59/6.87 cnf(i_0_152, plain, (product(e_1,e_1,e_3)), inference(extension_rule, [i_0_60])). % 51.59/6.87 cnf(i_0_209075, plain, (~greater(e_3,e_1)), inference(closure_rule, [i_0_51])). % 51.59/6.87 cnf(i_0_153, plain, (product(e_1,e_1,e_2)), inference(extension_rule, [i_0_88])). % 51.59/6.87 cnf(i_0_209077, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_70])). % 51.59/6.87 cnf(i_0_154, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_89])). % 51.59/6.87 cnf(i_0_209080, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_70])). % 51.59/6.87 cnf(i_0_149, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_90])). % 51.59/6.87 cnf(i_0_209084, plain, (~product(X6,e_1,e_1)), inference(extension_rule, [i_0_86])). % 51.59/6.87 cnf(i_0_209091, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 51.59/6.87 cnf(i_0_209085, plain, (~product(e_1,X6,e_1)), inference(extension_rule, [i_0_90])). % 51.59/6.87 cnf(i_0_93, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_86])). % 51.59/6.87 cnf(i_0_209120, plain, (product(e_2,e_1,e_5)), inference(closure_rule, [i_0_162])). % 51.59/6.87 cnf(i_0_209121, plain, (product(e_2,e_1,e_4)), inference(closure_rule, [i_0_163])). % 51.59/6.87 cnf(i_0_209125, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 51.59/6.87 cnf(i_0_209126, plain, (~group_element(e_2)), inference(closure_rule, [i_0_62])). % 51.59/6.87 cnf(i_0_137, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_137, ...])). % 51.59/6.87 cnf(i_0_140, plain, (~next(e_1,e_1)), inference(etableau_closure_rule, [i_0_140, ...])). % 51.59/6.87 cnf(i_0_143, plain, (~product(e_1,e_2,e_2)), inference(etableau_closure_rule, [i_0_143, ...])). % 51.59/6.87 # End printing tableau % 51.59/6.87 # SZS output end % 51.59/6.87 # Branches closed with saturation will be marked with an "s" % 51.89/6.88 # Child (3047) has found a proof. % 51.89/6.88 % 51.89/6.88 # Proof search is over... % 51.89/6.88 # Freeing feature tree %------------------------------------------------------------------------------