%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP124-8.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 : n005.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:38 EDT 2022 % Result : Unsatisfiable 0.20s 0.44s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP124-8.004 : TPTP v8.1.0. Released v1.2.0. % 0.07/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.34 % Computer : n005.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 13 23:24:39 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.13/0.37 # and selection function SelectNewComplexAHP. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 48 Number of unprocessed: 48 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 48 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 1 conjectures. % 0.20/0.40 # There are 1 start rule candidates: % 0.20/0.40 # Found 33 unit axioms. % 0.20/0.40 # 1 start rule tableaux created. % 0.20/0.40 # 15 extension rule candidate clauses % 0.20/0.40 # 33 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.44 # There were 3 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 3 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 3 successful branch saturations after the branch. % 0.20/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_70, plain, (group_element(e_1))). % 0.20/0.44 cnf(i_0_71, plain, (group_element(e_2))). % 0.20/0.44 cnf(i_0_72, plain, (group_element(e_3))). % 0.20/0.44 cnf(i_0_73, plain, (group_element(e_4))). % 0.20/0.44 cnf(i_0_49, plain, (next(e_0,e_1))). % 0.20/0.44 cnf(i_0_50, plain, (next(e_1,e_2))). % 0.20/0.44 cnf(i_0_51, plain, (next(e_2,e_3))). % 0.20/0.44 cnf(i_0_52, plain, (next(e_3,e_4))). % 0.20/0.44 cnf(i_0_53, plain, (greater(e_1,e_0))). % 0.20/0.44 cnf(i_0_54, plain, (greater(e_2,e_0))). % 0.20/0.44 cnf(i_0_57, plain, (greater(e_2,e_1))). % 0.20/0.44 cnf(i_0_55, plain, (greater(e_3,e_0))). % 0.20/0.44 cnf(i_0_58, plain, (greater(e_3,e_1))). % 0.20/0.44 cnf(i_0_60, plain, (greater(e_3,e_2))). % 0.20/0.44 cnf(i_0_56, plain, (greater(e_4,e_0))). % 0.20/0.44 cnf(i_0_59, plain, (greater(e_4,e_1))). % 0.20/0.44 cnf(i_0_61, plain, (greater(e_4,e_2))). % 0.20/0.44 cnf(i_0_62, plain, (greater(e_4,e_3))). % 0.20/0.44 cnf(i_0_65, plain, (cycle(e_4,e_0))). % 0.20/0.44 cnf(i_0_90, plain, (product1(X1,X1,X1))). % 0.20/0.44 cnf(i_0_95, plain, (product2(X1,X1,X1))). % 0.20/0.44 cnf(i_0_74, plain, (~equalish(e_1,e_2))). % 0.20/0.44 cnf(i_0_75, plain, (~equalish(e_1,e_3))). % 0.20/0.44 cnf(i_0_76, plain, (~equalish(e_1,e_4))). % 0.20/0.44 cnf(i_0_77, plain, (~equalish(e_2,e_1))). % 0.20/0.44 cnf(i_0_78, plain, (~equalish(e_2,e_3))). % 0.20/0.44 cnf(i_0_79, plain, (~equalish(e_2,e_4))). % 0.20/0.44 cnf(i_0_80, plain, (~equalish(e_3,e_1))). % 0.20/0.44 cnf(i_0_81, plain, (~equalish(e_3,e_2))). % 0.20/0.44 cnf(i_0_82, plain, (~equalish(e_3,e_4))). % 0.20/0.44 cnf(i_0_83, plain, (~equalish(e_4,e_1))). % 0.20/0.44 cnf(i_0_84, plain, (~equalish(e_4,e_2))). % 0.20/0.44 cnf(i_0_85, plain, (~equalish(e_4,e_3))). % 0.20/0.44 cnf(i_0_68, plain, (~product(X1,e_1,X2)|~cycle(X1,e_0)|~greater(X2,X1))). % 0.20/0.44 cnf(i_0_96, negated_conjecture, (product2(X1,X2,X3)|~product1(X4,X3,X1)|~product1(X3,X2,X4))). % 0.20/0.44 cnf(i_0_63, plain, (equalish(X1,X2)|~cycle(X3,X2)|~cycle(X3,X1))). % 0.20/0.44 cnf(i_0_87, plain, (equalish(X1,X2)|~product1(X3,X4,X2)|~product1(X3,X4,X1))). % 0.20/0.44 cnf(i_0_92, plain, (equalish(X1,X2)|~product2(X3,X4,X2)|~product2(X3,X4,X1))). % 0.20/0.44 cnf(i_0_64, plain, (cycle(X1,e_3)|cycle(X1,e_2)|cycle(X1,e_1)|cycle(X1,e_0)|~group_element(X1))). % 0.20/0.44 cnf(i_0_88, plain, (equalish(X1,X2)|~product1(X3,X2,X4)|~product1(X3,X1,X4))). % 0.20/0.44 cnf(i_0_93, plain, (equalish(X1,X2)|~product2(X3,X2,X4)|~product2(X3,X1,X4))). % 0.20/0.44 cnf(i_0_89, plain, (equalish(X1,X2)|~product1(X2,X3,X4)|~product1(X1,X3,X4))). % 0.20/0.44 cnf(i_0_94, plain, (equalish(X1,X2)|~product2(X2,X3,X4)|~product2(X1,X3,X4))). % 0.20/0.44 cnf(i_0_67, plain, (~cycle(X1,e_0)|~cycle(X2,X3)|~cycle(X4,X5)|~greater(X1,X4)|~greater(X5,X3)|~next(X1,X2))). % 0.20/0.44 cnf(i_0_69, plain, (equalish(X1,X2)|~product(X3,e_1,X1)|~cycle(X3,X4)|~greater(X4,e_0)|~next(X3,X2))). % 0.20/0.44 cnf(i_0_66, plain, (equalish(X1,X2)|~cycle(X3,X4)|~cycle(X5,X1)|~greater(X1,e_0)|~next(X4,X2)|~next(X5,X3))). % 0.20/0.44 cnf(i_0_86, plain, (product1(X1,X2,e_4)|product1(X1,X2,e_3)|product1(X1,X2,e_2)|product1(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.20/0.44 cnf(i_0_91, plain, (product2(X1,X2,e_4)|product2(X1,X2,e_3)|product2(X1,X2,e_2)|product2(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 11 steps % 0.20/0.44 cnf(i_0_96, negated_conjecture, (product2(e_1,e_1,e_1)|~product1(e_1,e_1,e_1)|~product1(e_1,e_1,e_1)), inference(start_rule)). % 0.20/0.44 cnf(i_0_98, plain, (~product1(e_1,e_1,e_1)), inference(closure_rule, [i_0_90])). % 0.20/0.44 cnf(i_0_99, plain, (~product1(e_1,e_1,e_1)), inference(closure_rule, [i_0_90])). % 0.20/0.44 cnf(i_0_97, plain, (product2(e_1,e_1,e_1)), inference(extension_rule, [i_0_94])). % 0.20/0.44 cnf(i_0_126, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_74])). % 0.20/0.44 cnf(i_0_127, plain, (~product2(e_2,e_1,e_1)), inference(extension_rule, [i_0_91])). % 0.20/0.44 cnf(i_0_217, plain, (~group_element(e_1)), inference(closure_rule, [i_0_70])). % 0.20/0.44 cnf(i_0_218, plain, (~group_element(e_2)), inference(closure_rule, [i_0_71])). % 0.20/0.44 cnf(i_0_213, plain, (product2(e_2,e_1,e_4)), inference(etableau_closure_rule, [i_0_213, ...])). % 0.20/0.44 cnf(i_0_214, plain, (product2(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_214, ...])). % 0.20/0.44 cnf(i_0_215, plain, (product2(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_215, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.20/0.44 # We now have 6 tableaux to operate on % 0.20/0.44 # Found closed tableau during pool population. % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------