%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT012-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 : n013.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.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT012-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.35 % Computer : n013.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 11:50:20 UTC 2026 % 0.09/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: 14 Number of unprocessed: 14 % 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.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 14 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 7 conjectures. % 0.13/0.39 # There are 7 start rule candidates: % 0.13/0.39 # Found 8 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 7 start rule tableaux created. % 0.13/0.39 # 6 extension rule candidate clauses % 0.13/0.39 # 8 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 7 % 0.13/0.39 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 13 tableaux to operate on % 0.13/0.39 # Creating equality axioms % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 1 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 1 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_22, negated_conjecture, (organization(sk3,sk6))). % 0.13/0.39 cnf(i_0_23, negated_conjecture, (organization(sk3,sk7))). % 0.13/0.39 cnf(i_0_27, negated_conjecture, (greater(sk7,sk6))). % 0.13/0.39 cnf(i_0_28, negated_conjecture, (greater(sk4,sk5))). % 0.13/0.39 cnf(i_0_24, negated_conjecture, (reorganization_free(sk3,sk6,sk7))). % 0.13/0.39 cnf(i_0_25, negated_conjecture, (complexity(sk3,sk4,sk6))). % 0.13/0.39 cnf(i_0_26, negated_conjecture, (complexity(sk3,sk5,sk7))). % 0.13/0.39 cnf(i_0_16, plain, (~greater(X1,X1))). % 0.13/0.39 cnf(i_0_17, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.13/0.39 cnf(i_0_15, plain, (inertia(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.13/0.39 cnf(i_0_18, plain, (class(X1,sk2(X2,X1),X2)|~organization(X1,X2))). % 0.13/0.39 cnf(i_0_19, plain, (X1=X2|~reorganization_free(X3,X4,X5)|~class(X3,X2,X5)|~class(X3,X1,X4)|~organization(X3,X5)|~organization(X3,X4))). % 0.13/0.39 cnf(i_0_21, hypothesis, (greater(X1,X2)|~reorganization_free(X3,X4,X5)|~greater(X5,X4)|~inertia(X3,X1,X5)|~inertia(X3,X2,X4)|~organization(X3,X5)|~organization(X3,X4))). % 0.13/0.39 cnf(i_0_20, hypothesis, (greater(X1,X2)|~complexity(X3,X4,X5)|~complexity(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~greater(X4,X7)|~inertia(X3,X1,X5)|~inertia(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))). % 0.13/0.39 cnf(i_0_211, plain, (X10=X10)). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 6 steps % 0.13/0.39 cnf(i_0_211, plain, (sk3=sk3), inference(start_rule)). % 0.13/0.39 cnf(i_0_260, plain, (sk3=sk3), inference(extension_rule, [i_0_215])). % 0.13/0.39 cnf(i_0_299, plain, ($false), inference(closure_rule, [i_0_211])). % 0.13/0.39 cnf(i_0_300, plain, (~organization(sk3,sk6)), inference(closure_rule, [i_0_22])). % 0.13/0.39 cnf(i_0_297, plain, (organization(sk3,sk6)), inference(extension_rule, [i_0_15])). % 0.13/0.39 cnf(i_0_303, plain, (inertia(sk3,sk1(sk6,sk3),sk6)), inference(etableau_closure_rule, [i_0_303, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (1721357) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------