%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP125-3.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 : n022.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:41 EDT 2022 % Result : Unsatisfiable 1.98s 0.65s % Output : CNFRefutation 1.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : GRP125-3.005 : TPTP v8.1.0. Released v1.2.0. % 0.03/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 : n022.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 14:54:03 EDT 2022 % 0.13/0.35 % CPUTime : % 0.21/0.38 # No SInE strategy applied % 0.21/0.38 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U % 0.21/0.38 # and selection function SelectComplexAHPExceptRRHorn. % 0.21/0.38 # % 0.21/0.38 # Number of axioms: 58 Number of unprocessed: 58 % 0.21/0.38 # Tableaux proof search. % 0.21/0.38 # APR header successfully linked. % 0.21/0.38 # Hello from C++ % 0.21/0.38 # The folding up rule is enabled... % 0.21/0.38 # Local unification is enabled... % 0.21/0.38 # Any saturation attempts will use folding labels... % 0.21/0.38 # 58 beginning clauses after preprocessing and clausification % 0.21/0.38 # Creating start rules for all 1 conjectures. % 0.21/0.38 # There are 1 start rule candidates: % 0.21/0.38 # Found 47 unit axioms. % 0.21/0.38 # 1 start rule tableaux created. % 0.21/0.38 # 11 extension rule candidate clauses % 0.21/0.38 # 47 unit axiom clauses % 0.21/0.38 % 0.21/0.38 # Requested 8, 32 cores available to the main process. % 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.21/0.38 # We now have 8 tableaux to operate on % 0.21/0.40 # Ran out of tableaux, making start rules for all clauses % 1.98/0.65 # There were 4 total branch saturation attempts. % 1.98/0.65 # There were 0 of these attempts blocked. % 1.98/0.65 # There were 0 deferred branch saturation attempts. % 1.98/0.65 # There were 0 free duplicated saturations. % 1.98/0.65 # There were 4 total successful branch saturations. % 1.98/0.65 # There were 0 successful branch saturations in interreduction. % 1.98/0.65 # There were 0 successful branch saturations on the branch. % 1.98/0.65 # There were 4 successful branch saturations after the branch. % 1.98/0.65 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.98/0.65 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.98/0.65 # Begin clausification derivation % 1.98/0.65 % 1.98/0.65 # End clausification derivation % 1.98/0.65 # Begin listing active clauses obtained from FOF to CNF conversion % 1.98/0.65 cnf(i_0_86, plain, (group_element(e_1))). % 1.98/0.65 cnf(i_0_87, plain, (group_element(e_2))). % 1.98/0.65 cnf(i_0_88, plain, (group_element(e_3))). % 1.98/0.65 cnf(i_0_89, plain, (group_element(e_4))). % 1.98/0.65 cnf(i_0_90, plain, (group_element(e_5))). % 1.98/0.65 cnf(i_0_59, plain, (next(e_0,e_1))). % 1.98/0.65 cnf(i_0_60, plain, (next(e_1,e_2))). % 1.98/0.65 cnf(i_0_61, plain, (next(e_2,e_3))). % 1.98/0.65 cnf(i_0_62, plain, (next(e_3,e_4))). % 1.98/0.65 cnf(i_0_63, plain, (next(e_4,e_5))). % 1.98/0.65 cnf(i_0_64, plain, (greater(e_1,e_0))). % 1.98/0.65 cnf(i_0_65, plain, (greater(e_2,e_0))). % 1.98/0.65 cnf(i_0_69, plain, (greater(e_2,e_1))). % 1.98/0.65 cnf(i_0_66, plain, (greater(e_3,e_0))). % 1.98/0.65 cnf(i_0_70, plain, (greater(e_3,e_1))). % 1.98/0.65 cnf(i_0_73, plain, (greater(e_3,e_2))). % 1.98/0.65 cnf(i_0_67, plain, (greater(e_4,e_0))). % 1.98/0.65 cnf(i_0_71, plain, (greater(e_4,e_1))). % 1.98/0.65 cnf(i_0_74, plain, (greater(e_4,e_2))). % 1.98/0.65 cnf(i_0_76, plain, (greater(e_4,e_3))). % 1.98/0.65 cnf(i_0_68, plain, (greater(e_5,e_0))). % 1.98/0.65 cnf(i_0_72, plain, (greater(e_5,e_1))). % 1.98/0.65 cnf(i_0_75, plain, (greater(e_5,e_2))). % 1.98/0.65 cnf(i_0_77, plain, (greater(e_5,e_3))). % 1.98/0.65 cnf(i_0_78, plain, (greater(e_5,e_4))). % 1.98/0.65 cnf(i_0_81, plain, (cycle(e_5,e_0))). % 1.98/0.65 cnf(i_0_91, plain, (~equalish(e_1,e_2))). % 1.98/0.65 cnf(i_0_92, plain, (~equalish(e_1,e_3))). % 1.98/0.65 cnf(i_0_93, plain, (~equalish(e_1,e_4))). % 1.98/0.65 cnf(i_0_94, plain, (~equalish(e_1,e_5))). % 1.98/0.65 cnf(i_0_95, plain, (~equalish(e_2,e_1))). % 1.98/0.65 cnf(i_0_96, plain, (~equalish(e_2,e_3))). % 1.98/0.65 cnf(i_0_97, plain, (~equalish(e_2,e_4))). % 1.98/0.65 cnf(i_0_98, plain, (~equalish(e_2,e_5))). % 1.98/0.65 cnf(i_0_99, plain, (~equalish(e_3,e_1))). % 1.98/0.65 cnf(i_0_100, plain, (~equalish(e_3,e_2))). % 1.98/0.65 cnf(i_0_101, plain, (~equalish(e_3,e_4))). % 1.98/0.65 cnf(i_0_102, plain, (~equalish(e_3,e_5))). % 1.98/0.65 cnf(i_0_103, plain, (~equalish(e_4,e_1))). % 1.98/0.65 cnf(i_0_104, plain, (~equalish(e_4,e_2))). % 1.98/0.65 cnf(i_0_105, plain, (~equalish(e_4,e_3))). % 1.98/0.65 cnf(i_0_106, plain, (~equalish(e_4,e_5))). % 1.98/0.65 cnf(i_0_107, plain, (~equalish(e_5,e_1))). % 1.98/0.65 cnf(i_0_108, plain, (~equalish(e_5,e_2))). % 1.98/0.65 cnf(i_0_109, plain, (~equalish(e_5,e_3))). % 1.98/0.65 cnf(i_0_110, plain, (~equalish(e_5,e_4))). % 1.98/0.65 cnf(i_0_115, plain, (product(X1,X1,X1))). % 1.98/0.65 cnf(i_0_79, plain, (equalish(X2,X3)|~cycle(X1,X3)|~cycle(X1,X2))). % 1.98/0.65 cnf(i_0_80, plain, (cycle(X1,e_0)|cycle(X1,e_1)|cycle(X1,e_2)|cycle(X1,e_3)|cycle(X1,e_4)|~group_element(X1))). % 1.98/0.65 cnf(i_0_82, plain, (equalish(X2,X5)|~next(X4,X5)|~next(X1,X3)|~cycle(X3,X4)|~cycle(X1,X2)|~greater(X2,e_0))). % 1.98/0.65 cnf(i_0_84, plain, (~greater(X2,X1)|~cycle(X1,e_0)|~product(X1,e_1,X2))). % 1.98/0.65 cnf(i_0_83, plain, (~next(X3,X4)|~greater(X3,X1)|~greater(X2,X5)|~cycle(X4,X5)|~cycle(X1,X2)|~cycle(X3,e_0))). % 1.98/0.65 cnf(i_0_85, plain, (equalish(X3,X4)|~next(X1,X4)|~cycle(X1,X2)|~greater(X2,e_0)|~product(X1,e_1,X3))). % 1.98/0.65 cnf(i_0_112, plain, (equalish(X3,X4)|~product(X1,X2,X4)|~product(X1,X2,X3))). % 1.98/0.65 cnf(i_0_113, plain, (equalish(X2,X4)|~product(X1,X4,X3)|~product(X1,X2,X3))). % 1.98/0.65 cnf(i_0_114, plain, (equalish(X1,X4)|~product(X4,X2,X3)|~product(X1,X2,X3))). % 1.98/0.65 cnf(i_0_116, negated_conjecture, (product(X3,X4,X1)|~product(X2,X1,X4)|~product(X1,X2,X3))). % 1.98/0.65 cnf(i_0_111, plain, (product(X1,X2,e_1)|product(X1,X2,e_2)|product(X1,X2,e_3)|product(X1,X2,e_4)|product(X1,X2,e_5)|~group_element(X2)|~group_element(X1))). % 1.98/0.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.98/0.65 # Begin printing tableau % 1.98/0.65 # Found 12 steps % 1.98/0.65 cnf(i_0_116, negated_conjecture, (product(e_2,e_2,e_2)|~product(e_2,e_2,e_2)|~product(e_2,e_2,e_2)), inference(start_rule)). % 1.98/0.65 cnf(i_0_118, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_115])). % 1.98/0.65 cnf(i_0_119, plain, (~product(e_2,e_2,e_2)), inference(closure_rule, [i_0_115])). % 1.98/0.65 cnf(i_0_117, plain, (product(e_2,e_2,e_2)), inference(extension_rule, [i_0_113])). % 1.98/0.65 cnf(i_0_152, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_91])). % 1.98/0.65 cnf(i_0_154, plain, (~product(e_2,e_1,e_2)), inference(extension_rule, [i_0_111])). % 1.98/0.65 cnf(i_0_211, plain, (~group_element(e_1)), inference(closure_rule, [i_0_86])). % 1.98/0.65 cnf(i_0_212, plain, (~group_element(e_2)), inference(closure_rule, [i_0_87])). % 1.98/0.65 cnf(i_0_206, plain, (product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_206, ...])). % 1.98/0.65 cnf(i_0_208, plain, (product(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_208, ...])). % 1.98/0.65 cnf(i_0_209, plain, (product(e_2,e_1,e_4)), inference(etableau_closure_rule, [i_0_209, ...])). % 1.98/0.65 cnf(i_0_210, plain, (product(e_2,e_1,e_5)), inference(etableau_closure_rule, [i_0_210, ...])). % 1.98/0.65 # End printing tableau % 1.98/0.65 # SZS output end % 1.98/0.65 # Branches closed with saturation will be marked with an "s" % 1.98/0.66 # Child (9396) has found a proof. % 1.98/0.66 % 1.98/0.66 # Proof search is over... % 1.98/0.66 # Freeing feature tree %------------------------------------------------------------------------------