%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP130-4.003 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 : n007.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:54 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.12 % Problem : GRP130-4.003 : TPTP v8.1.0. Bugfixed v1.2.1. % 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.34 % Computer : n007.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 : Tue Jun 14 04:52:54 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 18 Number of unprocessed: 18 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 18 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 3 conjectures. % 0.20/0.37 # There are 3 start rule candidates: % 0.20/0.37 # Found 9 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 3 start rule tableaux created. % 0.20/0.37 # 9 extension rule candidate clauses % 0.20/0.37 # 9 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 10 tableaux to operate on % 0.20/0.39 # There were 5 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 5 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 5 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/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_23, plain, (group_element(e_1))). % 0.20/0.39 cnf(i_0_24, plain, (group_element(e_2))). % 0.20/0.39 cnf(i_0_25, plain, (group_element(e_3))). % 0.20/0.39 cnf(i_0_26, plain, (~equalish(e_1,e_2))). % 0.20/0.39 cnf(i_0_27, plain, (~equalish(e_1,e_3))). % 0.20/0.39 cnf(i_0_28, plain, (~equalish(e_2,e_1))). % 0.20/0.39 cnf(i_0_29, plain, (~equalish(e_2,e_3))). % 0.20/0.39 cnf(i_0_30, plain, (~equalish(e_3,e_1))). % 0.20/0.39 cnf(i_0_31, plain, (~equalish(e_3,e_2))). % 0.20/0.39 cnf(i_0_33, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.20/0.39 cnf(i_0_34, plain, (equalish(X1,X2)|~product(X3,X2,X4)|~product(X3,X1,X4))). % 0.20/0.39 cnf(i_0_35, plain, (equalish(X1,X2)|~product(X2,X3,X4)|~product(X1,X3,X4))). % 0.20/0.39 cnf(i_0_36, negated_conjecture, (product(X1,X2,X3)|~product(X3,X4,X1)|~product(X3,X2,X4))). % 0.20/0.39 cnf(i_0_21, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X1)|~product(X1,X3,X4))). % 0.20/0.39 cnf(i_0_22, negated_conjecture, (product(X1,X2,X3)|~product(X3,X4,X1)|~product(X1,X4,X2))). % 0.20/0.39 cnf(i_0_32, plain, (product(X1,X2,e_3)|product(X1,X2,e_2)|product(X1,X2,e_1)|~group_element(X2)|~group_element(X1))). % 0.20/0.39 cnf(i_0_20, plain, (product(X1,e_3,X2)|product(X1,e_2,X2)|product(X1,e_1,X2)|~group_element(X2)|~group_element(X1))). % 0.20/0.39 cnf(i_0_19, plain, (product(e_3,X1,X2)|product(e_2,X1,X2)|product(e_1,X1,X2)|~group_element(X2)|~group_element(X1))). % 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 18 steps % 0.20/0.39 cnf(i_0_36, negated_conjecture, (product(e_1,e_3,e_2)|~product(e_2,e_1,e_1)|~product(e_2,e_3,e_1)), inference(start_rule)). % 0.20/0.39 cnf(i_0_43, plain, (product(e_1,e_3,e_2)), inference(extension_rule, [i_0_33])). % 0.20/0.39 cnf(i_0_79, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_26])). % 0.20/0.39 cnf(i_0_81, plain, (~product(e_1,e_3,e_1)), inference(extension_rule, [i_0_20])). % 0.20/0.39 cnf(i_0_96, plain, (~group_element(e_1)), inference(closure_rule, [i_0_23])). % 0.20/0.39 cnf(i_0_97, plain, (~group_element(e_1)), inference(closure_rule, [i_0_23])). % 0.20/0.39 cnf(i_0_94, plain, (product(e_1,e_2,e_1)), inference(extension_rule, [i_0_34])). % 0.20/0.39 cnf(i_0_98, plain, (equalish(e_1,e_2)), inference(closure_rule, [i_0_26])). % 0.20/0.39 cnf(i_0_95, plain, (product(e_1,e_1,e_1)), inference(extension_rule, [i_0_35])). % 0.20/0.39 cnf(i_0_101, plain, (equalish(e_2,e_1)), inference(closure_rule, [i_0_28])). % 0.20/0.39 cnf(i_0_44, plain, (~product(e_2,e_1,e_1)), inference(extension_rule, [i_0_32])). % 0.20/0.39 cnf(i_0_107, plain, (~group_element(e_1)), inference(closure_rule, [i_0_23])). % 0.20/0.39 cnf(i_0_108, plain, (~group_element(e_2)), inference(closure_rule, [i_0_24])). % 0.20/0.39 cnf(i_0_45, plain, (~product(e_2,e_3,e_1)), inference(etableau_closure_rule, [i_0_45, ...])). % 0.20/0.39 cnf(i_0_100, plain, (~product(e_1,e_1,e_1)), inference(etableau_closure_rule, [i_0_100, ...])). % 0.20/0.39 cnf(i_0_103, plain, (~product(e_2,e_1,e_1)), inference(etableau_closure_rule, [i_0_103, ...])). % 0.20/0.39 cnf(i_0_104, plain, (product(e_2,e_1,e_3)), inference(etableau_closure_rule, [i_0_104, ...])). % 0.20/0.39 cnf(i_0_105, plain, (product(e_2,e_1,e_2)), inference(etableau_closure_rule, [i_0_105, ...])). % 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 # Child (3731) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------