%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP126-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 : n032.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:42 EDT 2022 % Result : Satisfiable 9.25s 8.53s % Output : CNFRefutation 9.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : GRP126-2.005 : TPTP v8.1.0. Released v1.2.0. % 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.27 % Computer : n032.cluster.edu % 0.08/0.27 % Model : x86_64 x86_64 % 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.27 % Memory : 8042.1875MB % 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.27 % CPULimit : 300 % 0.08/0.27 % WCLimit : 600 % 0.08/0.27 % DateTime : Mon Jun 13 09:53:56 EDT 2022 % 0.08/0.27 % CPUTime : % 0.12/0.29 # No SInE strategy applied % 0.12/0.29 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.12/0.29 # and selection function SelectCQIPrecW. % 0.12/0.29 # % 0.12/0.29 # Presaturation interreduction done % 0.12/0.29 # Number of axioms: 46 Number of unprocessed: 46 % 0.12/0.29 # Tableaux proof search. % 0.12/0.29 # APR header successfully linked. % 0.12/0.29 # Hello from C++ % 0.12/0.29 # The folding up rule is enabled... % 0.12/0.29 # Local unification is enabled... % 0.12/0.29 # Any saturation attempts will use folding labels... % 0.12/0.29 # 46 beginning clauses after preprocessing and clausification % 0.12/0.29 # Creating start rules for all 1 conjectures. % 0.12/0.29 # There are 1 start rule candidates: % 0.12/0.29 # Found 40 unit axioms. % 0.12/0.29 # 1 start rule tableaux created. % 0.12/0.29 # 6 extension rule candidate clauses % 0.12/0.29 # 40 unit axiom clauses % 0.12/0.29 % 0.12/0.29 # Requested 8, 32 cores available to the main process. % 0.12/0.29 # There are not enough tableaux to fork, creating more from the initial 1 % 8.10/8.29 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 8.10/8.29 # We now have 8 tableaux to operate on % 8.11/8.36 # Ran out of tableaux, making start rules for all clauses % 9.25/8.52 # 6124 Satisfiable branch % 9.25/8.53 # Satisfiable branch found. % 9.25/8.53 # There were 5 total branch saturation attempts. % 9.25/8.53 # There were 0 of these attempts blocked. % 9.25/8.53 # There were 0 deferred branch saturation attempts. % 9.25/8.53 # There were 0 free duplicated saturations. % 9.25/8.53 # There were 2 total successful branch saturations. % 9.25/8.53 # There were 0 successful branch saturations in interreduction. % 9.25/8.53 # There were 0 successful branch saturations on the branch. % 9.25/8.53 # There were 2 successful branch saturations after the branch. % 9.25/8.53 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.25/8.53 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.25/8.53 # Begin clausification derivation % 9.25/8.53 % 9.25/8.53 # End clausification derivation % 9.25/8.53 # Begin listing active clauses obtained from FOF to CNF conversion % 9.25/8.53 cnf(i_0_62, plain, (group_element(e_1))). % 9.25/8.53 cnf(i_0_63, plain, (group_element(e_2))). % 9.25/8.53 cnf(i_0_64, plain, (group_element(e_3))). % 9.25/8.53 cnf(i_0_65, plain, (group_element(e_4))). % 9.25/8.53 cnf(i_0_66, plain, (group_element(e_5))). % 9.25/8.53 cnf(i_0_47, plain, (next(e_1,e_2))). % 9.25/8.53 cnf(i_0_48, plain, (next(e_2,e_3))). % 9.25/8.53 cnf(i_0_49, plain, (next(e_3,e_4))). % 9.25/8.53 cnf(i_0_50, plain, (next(e_4,e_5))). % 9.25/8.53 cnf(i_0_51, plain, (greater(e_2,e_1))). % 9.25/8.53 cnf(i_0_52, plain, (greater(e_3,e_1))). % 9.25/8.53 cnf(i_0_55, plain, (greater(e_3,e_2))). % 9.25/8.53 cnf(i_0_53, plain, (greater(e_4,e_1))). % 9.25/8.53 cnf(i_0_56, plain, (greater(e_4,e_2))). % 9.25/8.53 cnf(i_0_58, plain, (greater(e_4,e_3))). % 9.25/8.53 cnf(i_0_54, plain, (greater(e_5,e_1))). % 9.25/8.53 cnf(i_0_57, plain, (greater(e_5,e_2))). % 9.25/8.53 cnf(i_0_59, plain, (greater(e_5,e_3))). % 9.25/8.53 cnf(i_0_60, plain, (greater(e_5,e_4))). % 9.25/8.53 cnf(i_0_91, plain, (product(X1,X1,X1))). % 9.25/8.53 cnf(i_0_67, plain, (~equalish(e_1,e_2))). % 9.25/8.53 cnf(i_0_68, plain, (~equalish(e_1,e_3))). % 9.25/8.53 cnf(i_0_69, plain, (~equalish(e_1,e_4))). % 9.25/8.53 cnf(i_0_70, plain, (~equalish(e_1,e_5))). % 9.25/8.53 cnf(i_0_71, plain, (~equalish(e_2,e_1))). % 9.25/8.53 cnf(i_0_72, plain, (~equalish(e_2,e_3))). % 9.25/8.53 cnf(i_0_73, plain, (~equalish(e_2,e_4))). % 9.25/8.53 cnf(i_0_74, plain, (~equalish(e_2,e_5))). % 9.25/8.53 cnf(i_0_75, plain, (~equalish(e_3,e_1))). % 9.25/8.53 cnf(i_0_76, plain, (~equalish(e_3,e_2))). % 9.25/8.53 cnf(i_0_77, plain, (~equalish(e_3,e_4))). % 9.25/8.53 cnf(i_0_78, plain, (~equalish(e_3,e_5))). % 9.25/8.53 cnf(i_0_79, plain, (~equalish(e_4,e_1))). % 9.25/8.53 cnf(i_0_80, plain, (~equalish(e_4,e_2))). % 9.25/8.53 cnf(i_0_81, plain, (~equalish(e_4,e_3))). % 9.25/8.53 cnf(i_0_82, plain, (~equalish(e_4,e_5))). % 9.25/8.53 cnf(i_0_83, plain, (~equalish(e_5,e_1))). % 9.25/8.53 cnf(i_0_84, plain, (~equalish(e_5,e_2))). % 9.25/8.53 cnf(i_0_85, plain, (~equalish(e_5,e_3))). % 9.25/8.53 cnf(i_0_86, plain, (~equalish(e_5,e_4))). % 9.25/8.53 cnf(i_0_61, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))). % 9.25/8.53 cnf(i_0_88, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 9.25/8.53 cnf(i_0_89, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 9.25/8.53 cnf(i_0_90, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 9.25/8.53 cnf(i_0_92, negated_conjecture, (product(X1,X2,X3)|~product(X3,X4,X2)|~product(X4,X3,X1))). % 9.25/8.53 cnf(i_0_87, 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))). % 9.25/8.53 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 9.25/8.53 # Begin printing tableau % 9.25/8.53 # Found 8 steps % 9.25/8.53 cnf(i_0_92, negated_conjecture, (product(e_1,e_1,e_1)|~product(e_1,e_1,e_1)|~product(e_1,e_1,e_1)), inference(start_rule)). % 9.25/8.53 cnf(i_0_94, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_91])). % 9.25/8.53 cnf(i_0_95, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_91])). % 9.25/8.53 cnf(i_0_93, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_89])). % 9.25/8.53 cnf(i_0_102, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_67])). % 9.25/8.53 cnf(i_0_103, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_87])). % 9.25/8.53 cnf(i_0_352321, plain, (~group_element(e_2)), inference(closure_rule, [i_0_63])). % 9.25/8.53 cnf(i_0_352322, plain, (~group_element(e_1)), inference(closure_rule, [i_0_62])). % 9.25/8.53 # End printing tableau % 9.25/8.53 # SZS output end % 9.25/8.53 # Branches closed with saturation will be marked with an "s" % 9.25/8.55 # Child (6124) has found a proof. % 9.25/8.55 % 9.25/8.55 # Proof search is over... % 9.25/8.55 # Freeing feature tree %------------------------------------------------------------------------------