%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP135-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 : n011.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:59 EDT 2022 % Result : Satisfiable 64.58s 8.49s % Output : CNFRefutation 64.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP135-2.005 : 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.14/0.34 % Computer : n011.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 13 19:18:34 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.14/0.37 # and selection function SelectCQIPrecW. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 45 Number of unprocessed: 45 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 45 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 1 conjectures. % 0.14/0.37 # There are 1 start rule candidates: % 0.14/0.37 # Found 39 unit axioms. % 0.14/0.37 # 1 start rule tableaux created. % 0.14/0.37 # 6 extension rule candidate clauses % 0.14/0.37 # 39 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 8 tableaux to operate on % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 64.58/8.48 # 675 Satisfiable branch % 64.58/8.49 # Satisfiable branch found. % 64.58/8.49 # There were 3 total branch saturation attempts. % 64.58/8.49 # There were 0 of these attempts blocked. % 64.58/8.49 # There were 0 deferred branch saturation attempts. % 64.58/8.49 # There were 0 free duplicated saturations. % 64.58/8.49 # There were 1 total successful branch saturations. % 64.58/8.49 # There were 0 successful branch saturations in interreduction. % 64.58/8.49 # There were 0 successful branch saturations on the branch. % 64.58/8.49 # There were 1 successful branch saturations after the branch. % 64.58/8.49 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 64.58/8.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 64.58/8.49 # Begin clausification derivation % 64.58/8.49 % 64.58/8.49 # End clausification derivation % 64.58/8.49 # Begin listing active clauses obtained from FOF to CNF conversion % 64.58/8.49 cnf(i_0_61, plain, (group_element(e_1))). % 64.58/8.49 cnf(i_0_62, plain, (group_element(e_2))). % 64.58/8.49 cnf(i_0_63, plain, (group_element(e_3))). % 64.58/8.49 cnf(i_0_64, plain, (group_element(e_4))). % 64.58/8.49 cnf(i_0_65, plain, (group_element(e_5))). % 64.58/8.49 cnf(i_0_46, plain, (next(e_1,e_2))). % 64.58/8.49 cnf(i_0_47, plain, (next(e_2,e_3))). % 64.58/8.49 cnf(i_0_48, plain, (next(e_3,e_4))). % 64.58/8.49 cnf(i_0_49, plain, (next(e_4,e_5))). % 64.58/8.49 cnf(i_0_50, plain, (greater(e_2,e_1))). % 64.58/8.49 cnf(i_0_51, plain, (greater(e_3,e_1))). % 64.58/8.49 cnf(i_0_54, plain, (greater(e_3,e_2))). % 64.58/8.49 cnf(i_0_52, plain, (greater(e_4,e_1))). % 64.58/8.49 cnf(i_0_55, plain, (greater(e_4,e_2))). % 64.58/8.49 cnf(i_0_57, plain, (greater(e_4,e_3))). % 64.58/8.49 cnf(i_0_53, plain, (greater(e_5,e_1))). % 64.58/8.49 cnf(i_0_56, plain, (greater(e_5,e_2))). % 64.58/8.49 cnf(i_0_58, plain, (greater(e_5,e_3))). % 64.58/8.49 cnf(i_0_59, plain, (greater(e_5,e_4))). % 64.58/8.49 cnf(i_0_66, plain, (~equalish(e_1,e_2))). % 64.58/8.49 cnf(i_0_67, plain, (~equalish(e_1,e_3))). % 64.58/8.49 cnf(i_0_68, plain, (~equalish(e_1,e_4))). % 64.58/8.49 cnf(i_0_69, plain, (~equalish(e_1,e_5))). % 64.58/8.49 cnf(i_0_70, plain, (~equalish(e_2,e_1))). % 64.58/8.49 cnf(i_0_71, plain, (~equalish(e_2,e_3))). % 64.58/8.49 cnf(i_0_72, plain, (~equalish(e_2,e_4))). % 64.58/8.49 cnf(i_0_73, plain, (~equalish(e_2,e_5))). % 64.58/8.49 cnf(i_0_74, plain, (~equalish(e_3,e_1))). % 64.58/8.49 cnf(i_0_75, plain, (~equalish(e_3,e_2))). % 64.58/8.49 cnf(i_0_76, plain, (~equalish(e_3,e_4))). % 64.58/8.49 cnf(i_0_77, plain, (~equalish(e_3,e_5))). % 64.58/8.49 cnf(i_0_78, plain, (~equalish(e_4,e_1))). % 64.58/8.49 cnf(i_0_79, plain, (~equalish(e_4,e_2))). % 64.58/8.49 cnf(i_0_80, plain, (~equalish(e_4,e_3))). % 64.58/8.49 cnf(i_0_81, plain, (~equalish(e_4,e_5))). % 64.58/8.49 cnf(i_0_82, plain, (~equalish(e_5,e_1))). % 64.58/8.49 cnf(i_0_83, plain, (~equalish(e_5,e_2))). % 64.58/8.49 cnf(i_0_84, plain, (~equalish(e_5,e_3))). % 64.58/8.49 cnf(i_0_85, plain, (~equalish(e_5,e_4))). % 64.58/8.49 cnf(i_0_87, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 64.58/8.49 cnf(i_0_60, plain, (~product(X1,e_1,X2)|~greater(X2,X3)|~next(X1,X3))). % 64.58/8.49 cnf(i_0_88, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 64.58/8.49 cnf(i_0_89, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 64.58/8.49 cnf(i_0_90, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X2,X3,X4))). % 64.58/8.49 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))). % 64.58/8.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 64.58/8.49 # Begin printing tableau % 64.58/8.49 # Found 27 steps % 64.58/8.49 cnf(i_0_90, negated_conjecture, (product(e_1,e_1,e_1)|~product(e_5,e_1,e_1)|~product(e_1,e_1,e_5)), inference(start_rule)). % 64.58/8.49 cnf(i_0_91, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_87])). % 64.58/8.49 cnf(i_0_94, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_66])). % 64.58/8.49 cnf(i_0_95, plain, (~product(e_1,e_1,e_2)), inference(extension_rule, [i_0_90])). % 64.58/8.49 cnf(i_0_136, plain, (~product(e_1,e_1,e_1)), inference(closure_rule, [i_0_91])). % 64.58/8.49 cnf(i_0_137, plain, (~product(e_1,e_2,e_1)), inference(extension_rule, [i_0_86])). % 64.58/8.49 cnf(i_0_155, plain, (~group_element(e_2)), inference(closure_rule, [i_0_62])). % 64.58/8.49 cnf(i_0_156, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 64.58/8.49 cnf(i_0_92, plain, (~product(e_5,e_1,e_1)), inference(extension_rule, [i_0_90])). % 64.58/8.49 cnf(i_0_170, plain, (~product(e_5,e_1,e_5)), inference(extension_rule, [i_0_86])). % 64.58/8.49 cnf(i_0_188, plain, (product(e_5,e_1,e_1)), inference(closure_rule, [i_0_92])). % 64.58/8.49 cnf(i_0_189, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 64.58/8.49 cnf(i_0_190, plain, (~group_element(e_5)), inference(closure_rule, [i_0_65])). % 64.58/8.49 cnf(i_0_185, plain, (product(e_5,e_1,e_4)), inference(extension_rule, [i_0_87])). % 64.58/8.49 cnf(i_0_225560, plain, (~product(e_5,e_1,e_4)), inference(closure_rule, [i_0_185])). % 64.58/8.49 cnf(i_0_186, plain, (product(e_5,e_1,e_3)), inference(extension_rule, [i_0_60])). % 64.58/8.49 cnf(i_0_225562, plain, (~greater(e_3,e_1)), inference(closure_rule, [i_0_51])). % 64.58/8.49 cnf(i_0_187, plain, (product(e_5,e_1,e_2)), inference(extension_rule, [i_0_88])). % 64.58/8.49 cnf(i_0_225564, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_70])). % 64.58/8.49 cnf(i_0_171, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_90])). % 64.58/8.49 cnf(i_0_225571, plain, (~product(e_1,e_1,e_1)), inference(extension_rule, [i_0_86])). % 64.58/8.49 cnf(i_0_225576, plain, (product(e_1,e_1,e_5)), inference(closure_rule, [i_0_171])). % 64.58/8.49 cnf(i_0_225581, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 64.58/8.49 cnf(i_0_225582, plain, (~group_element(e_1)), inference(closure_rule, [i_0_61])). % 64.58/8.49 cnf(i_0_225572, plain, (~product(e_1,e_5,e_1)), inference(extension_rule, [i_0_90])). % 64.58/8.49 cnf(i_0_93, plain, (~product(e_1,e_1,e_5)), inference(extension_rule, [i_0_90])). % 64.58/8.49 cnf(i_0_150, plain, (product(e_1,e_2,e_5)), inference(etableau_closure_rule, [i_0_150, ...])). % 64.58/8.49 # End printing tableau % 64.58/8.49 # SZS output end % 64.58/8.49 # Branches closed with saturation will be marked with an "s" % 64.58/8.50 # Child (675) has found a proof. % 64.58/8.50 % 64.58/8.50 # Proof search is over... % 64.58/8.50 # Freeing feature tree %------------------------------------------------------------------------------