%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP123-8.003 : 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 : n029.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:33 EDT 2022 % Result : Unsatisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : GRP123-8.003 : 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.12/0.35 % Computer : n029.cluster.edu % 0.12/0.35 % Model : x86_64 x86_64 % 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.35 % Memory : 8042.1875MB % 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.35 % CPULimit : 300 % 0.12/0.35 % WCLimit : 600 % 0.12/0.35 % DateTime : Mon Jun 13 05:21:25 EDT 2022 % 0.12/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.20/0.38 # and selection function SelectNewComplexAHP. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 36 Number of unprocessed: 36 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 36 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 21 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 15 extension rule candidate clauses % 0.20/0.38 # 21 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.39 # There were 2 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 2 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 2 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_53, plain, (group_element(e_1))). % 0.20/0.39 cnf(i_0_54, plain, (group_element(e_2))). % 0.20/0.39 cnf(i_0_55, plain, (group_element(e_3))). % 0.20/0.39 cnf(i_0_37, plain, (next(e_0,e_1))). % 0.20/0.39 cnf(i_0_38, plain, (next(e_1,e_2))). % 0.20/0.39 cnf(i_0_39, plain, (next(e_2,e_3))). % 0.20/0.39 cnf(i_0_40, plain, (greater(e_1,e_0))). % 0.20/0.39 cnf(i_0_41, plain, (greater(e_2,e_0))). % 0.20/0.39 cnf(i_0_43, plain, (greater(e_2,e_1))). % 0.20/0.39 cnf(i_0_42, plain, (greater(e_3,e_0))). % 0.20/0.39 cnf(i_0_44, plain, (greater(e_3,e_1))). % 0.20/0.39 cnf(i_0_45, plain, (greater(e_3,e_2))). % 0.20/0.39 cnf(i_0_48, plain, (cycle(e_3,e_0))). % 0.20/0.39 cnf(i_0_66, plain, (product1(X1,X1,X1))). % 0.20/0.39 cnf(i_0_71, plain, (product2(X1,X1,X1))). % 0.20/0.39 cnf(i_0_56, plain, (~equalish(e_1,e_2))). % 0.20/0.39 cnf(i_0_57, plain, (~equalish(e_1,e_3))). % 0.20/0.39 cnf(i_0_58, plain, (~equalish(e_2,e_1))). % 0.20/0.39 cnf(i_0_59, plain, (~equalish(e_2,e_3))). % 0.20/0.39 cnf(i_0_60, plain, (~equalish(e_3,e_1))). % 0.20/0.39 cnf(i_0_61, plain, (~equalish(e_3,e_2))). % 0.20/0.39 cnf(i_0_51, plain, (~product(X1,e_1,X2)|~cycle(X1,e_0)|~greater(X2,X1))). % 0.20/0.39 cnf(i_0_46, plain, (equalish(X1,X2)|~cycle(X3,X2)|~cycle(X3,X1))). % 0.20/0.39 cnf(i_0_72, negated_conjecture, (product2(X1,X2,X3)|~product1(X4,X3,X1)|~product1(X2,X3,X4))). % 0.20/0.39 cnf(i_0_63, plain, (equalish(X1,X2)|~product1(X3,X4,X2)|~product1(X3,X4,X1))). % 0.20/0.39 cnf(i_0_68, plain, (equalish(X1,X2)|~product2(X3,X4,X2)|~product2(X3,X4,X1))). % 0.20/0.39 cnf(i_0_64, plain, (equalish(X1,X2)|~product1(X3,X2,X4)|~product1(X3,X1,X4))). % 0.20/0.39 cnf(i_0_47, plain, (cycle(X1,e_2)|cycle(X1,e_1)|cycle(X1,e_0)|~group_element(X1))). % 0.20/0.39 cnf(i_0_69, plain, (equalish(X1,X2)|~product2(X3,X2,X4)|~product2(X3,X1,X4))). % 0.20/0.39 cnf(i_0_65, plain, (equalish(X1,X2)|~product1(X2,X3,X4)|~product1(X1,X3,X4))). % 0.20/0.39 cnf(i_0_70, plain, (equalish(X1,X2)|~product2(X2,X3,X4)|~product2(X1,X3,X4))). % 0.20/0.39 cnf(i_0_50, plain, (~cycle(X1,e_0)|~cycle(X2,X3)|~cycle(X4,X5)|~greater(X1,X4)|~greater(X5,X3)|~next(X1,X2))). % 0.20/0.39 cnf(i_0_52, plain, (equalish(X1,X2)|~product(X3,e_1,X1)|~cycle(X3,X4)|~greater(X4,e_0)|~next(X3,X2))). % 0.20/0.39 cnf(i_0_62, plain, (product1(X1,X2,e_3)|product1(X1,X2,e_2)|product1(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.20/0.39 cnf(i_0_67, plain, (product2(X1,X2,e_3)|product2(X1,X2,e_2)|product2(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.20/0.39 cnf(i_0_49, plain, (equalish(X1,X2)|~cycle(X3,X4)|~cycle(X5,X1)|~greater(X1,e_0)|~next(X4,X2)|~next(X5,X3))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 10 steps % 0.20/0.39 cnf(i_0_72, 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.39 cnf(i_0_74, plain, (~product1(e_1,e_1,e_1)), inference(closure_rule, [i_0_66])). % 0.20/0.39 cnf(i_0_75, plain, (~product1(e_1,e_1,e_1)), inference(closure_rule, [i_0_66])). % 0.20/0.39 cnf(i_0_73, plain, (product2(e_1,e_1,e_1)), inference(extension_rule, [i_0_70])). % 0.20/0.39 cnf(i_0_101, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_56])). % 0.20/0.39 cnf(i_0_102, plain, (~product2(e_2,e_1,e_1)), inference(extension_rule, [i_0_67])). % 0.20/0.39 cnf(i_0_181, plain, (~group_element(e_1)), inference(closure_rule, [i_0_53])). % 0.20/0.39 cnf(i_0_182, plain, (~group_element(e_2)), inference(closure_rule, [i_0_54])). % 0.20/0.39 cnf(i_0_178, plain, (product2(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_178, ...])). % 0.20/0.39 cnf(i_0_179, plain, (product2(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_179, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 6 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------