%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT005-1 : TPTP v9.3.0. Released v2.4.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 : n019.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:09:42 AM UTC 2026 % Result : Unsatisfiable 11.09s 1.87s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT005-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.36 % Computer : n019.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 11:37:52 UTC 2026 % 0.09/0.36 % CPUTime : % 0.14/0.40 # No SInE strategy applied % 0.14/0.40 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.40 # % 0.14/0.40 # Presaturation interreduction done % 0.14/0.40 # Number of axioms: 29 Number of unprocessed: 29 % 0.14/0.40 # Tableaux proof search. % 0.14/0.40 # APR header successfully linked. % 0.14/0.40 # Hello from C++ % 0.14/0.40 # The folding up rule is enabled... % 0.14/0.40 # Local unification is enabled... % 0.14/0.40 # Any saturation attempts will use folding labels... % 0.14/0.40 # 29 beginning clauses after preprocessing and clausification % 0.14/0.40 # Creating start rules for all 19 conjectures. % 0.14/0.40 # There are 19 start rule candidates: % 0.14/0.40 # Found 20 unit axioms. % 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.40 # 19 start rule tableaux created. % 0.14/0.40 # 9 extension rule candidate clauses % 0.14/0.40 # 20 unit axiom clauses % 0.14/0.40 % 0.14/0.40 # Requested 8, 32 cores available to the main process. % 11.09/1.86 # Creating equality axioms % 11.09/1.86 # Ran out of tableaux, making start rules for all clauses % 11.09/1.87 # There were 1 total branch saturation attempts. % 11.09/1.87 # There were 0 of these attempts blocked. % 11.09/1.87 # There were 0 deferred branch saturation attempts. % 11.09/1.87 # There were 0 free duplicated saturations. % 11.09/1.87 # There were 1 total successful branch saturations. % 11.09/1.87 # There were 0 successful branch saturations in interreduction. % 11.09/1.87 # There were 0 successful branch saturations on the branch. % 11.09/1.87 # There were 1 successful branch saturations after the branch. % 11.09/1.87 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.09/1.87 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.09/1.87 # Begin clausification derivation % 11.09/1.87 % 11.09/1.87 # End clausification derivation % 11.09/1.87 # Begin listing active clauses obtained from FOF to CNF conversion % 11.09/1.87 cnf(i_0_57, negated_conjecture, (greater(sk10,sk9))). % 11.09/1.87 cnf(i_0_40, negated_conjecture, (organization(sk2,sk11))). % 11.09/1.87 cnf(i_0_42, negated_conjecture, (organization(sk2,sk13))). % 11.09/1.87 cnf(i_0_41, negated_conjecture, (organization(sk3,sk11))). % 11.09/1.87 cnf(i_0_43, negated_conjecture, (organization(sk3,sk13))). % 11.09/1.87 cnf(i_0_46, negated_conjecture, (survival_chance(sk2,sk6,sk11))). % 11.09/1.87 cnf(i_0_53, negated_conjecture, (survival_chance(sk2,sk7,sk13))). % 11.09/1.87 cnf(i_0_47, negated_conjecture, (survival_chance(sk3,sk6,sk11))). % 11.09/1.87 cnf(i_0_54, negated_conjecture, (survival_chance(sk3,sk8,sk13))). % 11.09/1.87 cnf(i_0_48, negated_conjecture, (reorganization(sk2,sk11,sk12))). % 11.09/1.87 cnf(i_0_49, negated_conjecture, (reorganization(sk3,sk11,sk13))). % 11.09/1.87 cnf(i_0_52, negated_conjecture, (reorganization_free(sk2,sk12,sk13))). % 11.09/1.87 cnf(i_0_44, negated_conjecture, (class(sk2,sk5,sk11))). % 11.09/1.87 cnf(i_0_45, negated_conjecture, (class(sk3,sk5,sk11))). % 11.09/1.87 cnf(i_0_50, negated_conjecture, (reorganization_type(sk2,sk4,sk11))). % 11.09/1.87 cnf(i_0_51, negated_conjecture, (reorganization_type(sk3,sk4,sk11))). % 11.09/1.87 cnf(i_0_55, negated_conjecture, (complexity(sk2,sk9,sk11))). % 11.09/1.87 cnf(i_0_56, negated_conjecture, (complexity(sk3,sk10,sk11))). % 11.09/1.87 cnf(i_0_58, negated_conjecture, (~greater(sk7,sk8))). % 11.09/1.87 cnf(i_0_30, plain, (~greater(X1,X1))). % 11.09/1.87 cnf(i_0_31, plain, (~greater(X1,X2)|~greater(X2,X1))). % 11.09/1.87 cnf(i_0_35, plain, (greater(X1,X2)|~reorganization(X3,X2,X1))). % 11.09/1.87 cnf(i_0_32, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 11.09/1.87 cnf(i_0_33, plain, (survival_chance(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 11.09/1.87 cnf(i_0_34, plain, (organization(X1,X2)|~organization(X1,X3)|~organization(X1,X4)|~greater(X2,X4)|~greater(X3,X2))). % 11.09/1.87 cnf(i_0_36, hypothesis, (greater(X1,X2)|~reorganization_free(X3,X4,X5)|~survival_chance(X3,X1,X5)|~survival_chance(X3,X2,X4)|~organization(X3,X5)|~organization(X3,X4)|~greater(X5,X4))). % 11.09/1.87 cnf(i_0_37, hypothesis, (greater(X1,X2)|greater(X3,X4)|greater(X5,X6)|~reorganization(X7,X3,X2)|~survival_chance(X7,X6,X1)|~survival_chance(X7,X5,X4)|~organization(X7,X1)|~organization(X7,X4)|~greater(X1,X4))). % 11.09/1.87 cnf(i_0_38, hypothesis, (greater(X1,X2)|~complexity(X3,X4,X5)|~complexity(X6,X7,X5)|~reorganization_type(X3,X8,X5)|~reorganization_type(X6,X8,X5)|~class(X3,X9,X5)|~class(X6,X9,X5)|~reorganization(X3,X5,X1)|~reorganization(X6,X5,X2)|~organization(X3,X1)|~organization(X3,X5)|~organization(X6,X5)|~greater(X4,X7))). % 11.09/1.87 cnf(i_0_39, hypothesis, (X1=X2|greater(X1,X2)|~complexity(X3,X4,X5)|~complexity(X6,X7,X5)|~reorganization_type(X3,X8,X5)|~reorganization_type(X6,X8,X5)|~class(X3,X9,X5)|~class(X6,X9,X5)|~reorganization(X3,X5,X10)|~reorganization(X6,X5,X11)|~survival_chance(X3,X2,X11)|~survival_chance(X3,X12,X5)|~survival_chance(X6,X1,X11)|~survival_chance(X6,X12,X5)|~organization(X3,X11)|~organization(X3,X5)|~organization(X6,X11)|~organization(X6,X5)|~greater(X4,X7))). % 11.09/1.87 cnf(i_0_8467, plain, (X13=X13)). % 11.09/1.87 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 11.09/1.87 # Begin printing tableau % 11.09/1.87 # Found 6 steps % 11.09/1.87 cnf(i_0_8467, plain, (sk7=sk7), inference(start_rule)). % 11.09/1.87 cnf(i_0_8562, plain, (sk7=sk7), inference(extension_rule, [i_0_8471])). % 11.09/1.87 cnf(i_0_8632, plain, (greater(sk7,sk8)), inference(closure_rule, [i_0_58])). % 11.09/1.87 cnf(i_0_8634, plain, ($false), inference(closure_rule, [i_0_8467])). % 11.09/1.87 cnf(i_0_8635, plain, (~greater(sk7,sk8)), inference(extension_rule, [i_0_35])). % 11.09/1.87 cnf(i_0_8639, plain, (~reorganization(X6,sk8,sk7)), inference(etableau_closure_rule, [i_0_8639, ...])). % 11.09/1.87 # End printing tableau % 11.09/1.87 # SZS output end % 11.09/1.87 # Branches closed with saturation will be marked with an "s" % 11.09/1.87 # Child (2718681) has found a proof. % 11.09/1.87 % 11.09/1.88 # Proof search is over... % 11.09/1.88 # Freeing feature tree %------------------------------------------------------------------------------