%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT008-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 : n001.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:43 AM UTC 2026 % Result : Unsatisfiable 0.13s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT008-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.08/0.35 % Computer : n001.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 11:50:22 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 15 Number of unprocessed: 15 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 15 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 12 conjectures. % 0.13/0.38 # There are 12 start rule candidates: % 0.13/0.38 # Found 12 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 12 start rule tableaux created. % 0.13/0.38 # 3 extension rule candidate clauses % 0.13/0.38 # 12 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.40 # There were 6 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 1 free duplicated saturations. % 0.13/0.40 # There were 6 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 5 successful branch saturations after the branch. % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_19, negated_conjecture, (organization(sk2,sk9))). % 0.13/0.40 cnf(i_0_20, negated_conjecture, (organization(sk3,sk10))). % 0.13/0.40 cnf(i_0_29, negated_conjecture, (greater(sk8,sk7))). % 0.13/0.40 cnf(i_0_23, negated_conjecture, (class(sk2,sk4,sk9))). % 0.13/0.40 cnf(i_0_24, negated_conjecture, (class(sk3,sk4,sk10))). % 0.13/0.40 cnf(i_0_27, negated_conjecture, (size(sk2,sk7,sk9))). % 0.13/0.40 cnf(i_0_28, negated_conjecture, (size(sk3,sk8,sk10))). % 0.13/0.40 cnf(i_0_21, negated_conjecture, (reorganization_free(sk2,sk9,sk9))). % 0.13/0.40 cnf(i_0_22, negated_conjecture, (reorganization_free(sk3,sk10,sk10))). % 0.13/0.40 cnf(i_0_25, negated_conjecture, (survival_chance(sk2,sk5,sk9))). % 0.13/0.40 cnf(i_0_26, negated_conjecture, (survival_chance(sk3,sk6,sk10))). % 0.13/0.40 cnf(i_0_30, negated_conjecture, (~greater(sk6,sk5))). % 0.13/0.40 cnf(i_0_16, plain, (inertia(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.13/0.40 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~size(X5,X3,X6)|~size(X7,X4,X8)|~class(X5,X9,X6)|~class(X7,X9,X8)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.13/0.40 cnf(i_0_18, hypothesis, (greater(X1,X2)|~survival_chance(X3,X1,X4)|~survival_chance(X5,X2,X6)|~reorganization_free(X3,X4,X4)|~reorganization_free(X5,X6,X6)|~greater(X7,X8)|~inertia(X3,X7,X4)|~inertia(X5,X8,X6)|~organization(X3,X4)|~organization(X5,X6))). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 20 steps % 0.13/0.40 cnf(i_0_27, negated_conjecture, (size(sk2,sk7,sk9)), inference(start_rule)). % 0.13/0.40 cnf(i_0_1194, plain, (size(sk2,sk7,sk9)), inference(extension_rule, [i_0_17])). % 0.13/0.40 cnf(i_0_3561, plain, (greater(sk6,sk5)), inference(closure_rule, [i_0_30])). % 0.13/0.40 cnf(i_0_3564, plain, (~size(sk2,sk7,sk9)), inference(closure_rule, [i_0_27])). % 0.13/0.40 cnf(i_0_3565, plain, (~class(sk2,sk4,sk9)), inference(closure_rule, [i_0_23])). % 0.13/0.40 cnf(i_0_3566, plain, (~class(sk2,sk4,sk9)), inference(closure_rule, [i_0_23])). % 0.13/0.40 cnf(i_0_3569, plain, (~organization(sk2,sk9)), inference(closure_rule, [i_0_19])). % 0.13/0.40 cnf(i_0_3570, plain, (~organization(sk2,sk9)), inference(closure_rule, [i_0_19])). % 0.13/0.40 cnf(i_0_3562, plain, (~greater(sk7,sk7)), inference(extension_rule, [i_0_18])). % 0.13/0.40 cnf(i_0_3576, plain, (~reorganization_free(sk2,sk9,sk9)), inference(closure_rule, [i_0_21])). % 0.13/0.40 cnf(i_0_3577, plain, (~reorganization_free(sk2,sk9,sk9)), inference(closure_rule, [i_0_21])). % 0.13/0.40 cnf(i_0_3578, plain, (~greater(sk8,sk7)), inference(closure_rule, [i_0_29])). % 0.13/0.40 cnf(i_0_3581, plain, (~organization(sk2,sk9)), inference(closure_rule, [i_0_19])). % 0.13/0.40 cnf(i_0_3582, plain, (~organization(sk2,sk9)), inference(closure_rule, [i_0_19])). % 0.13/0.40 cnf(i_0_3567, plain, (~inertia(sk2,sk6,sk9)), inference(etableau_closure_rule, [i_0_3567, ...])). % 0.13/0.40 cnf(i_0_3568, plain, (~inertia(sk2,sk5,sk9)), inference(etableau_closure_rule, [i_0_3568, ...])). % 0.13/0.40 cnf(i_0_3574, plain, (~survival_chance(sk2,sk7,sk9)), inference(etableau_closure_rule, [i_0_3574, ...])). % 0.13/0.40 cnf(i_0_3575, plain, (~survival_chance(sk2,sk7,sk9)), inference(etableau_closure_rule, [i_0_3575, ...])). % 0.13/0.40 cnf(i_0_3579, plain, (~inertia(sk2,sk8,sk9)), inference(etableau_closure_rule, [i_0_3579, ...])). % 0.13/0.40 cnf(i_0_3580, plain, (~inertia(sk2,sk7,sk9)), inference(etableau_closure_rule, [i_0_3580, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (2932571) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------