%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT039-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 : n029.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:49 AM UTC 2026 % Result : Unsatisfiable 0.12s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT039-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.12/0.36 % Computer : n029.cluster.edu % 0.12/0.36 % Model : x86_64 x86_64 % 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.36 % Memory : 8046.5625MB % 0.12/0.36 % OS : Linux 6.8.0-71-generic % 0.12/0.36 % CPULimit : 300 % 0.12/0.36 % WCLimit : 300 % 0.12/0.36 % DateTime : Mon Sep 7 12:56:11 UTC 2026 % 0.12/0.36 % CPUTime : % 0.12/0.39 # No SInE strategy applied % 0.12/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.39 # % 0.12/0.39 # Presaturation interreduction done % 0.12/0.39 # Number of axioms: 19 Number of unprocessed: 19 % 0.12/0.39 # Tableaux proof search. % 0.12/0.39 # APR header successfully linked. % 0.12/0.39 # Hello from C++ % 0.12/0.39 # The folding up rule is enabled... % 0.12/0.39 # Local unification is enabled... % 0.12/0.39 # Any saturation attempts will use folding labels... % 0.12/0.39 # 19 beginning clauses after preprocessing and clausification % 0.12/0.39 # Creating start rules for all 3 conjectures. % 0.12/0.39 # There are 3 start rule candidates: % 0.12/0.39 # Found 6 unit axioms. % 0.12/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.39 # 3 start rule tableaux created. % 0.12/0.39 # 13 extension rule candidate clauses % 0.12/0.39 # 6 unit axiom clauses % 0.12/0.39 % 0.12/0.39 # Requested 8, 32 cores available to the main process. % 0.12/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.39 # We now have 11 tableaux to operate on % 0.12/0.40 # There were 2 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 2 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 2 successful branch saturations after the branch. % 0.12/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_36, negated_conjecture, (observational_period(sk3))). % 0.12/0.40 cnf(i_0_37, negated_conjecture, (slow_change(sk3))). % 0.12/0.40 cnf(i_0_25, plain, (propagation_strategy(first_movers))). % 0.12/0.40 cnf(i_0_26, plain, (propagation_strategy(efficient_producers))). % 0.12/0.40 cnf(i_0_33, plain, (greater_or_equal(X1,X1))). % 0.12/0.40 cnf(i_0_38, negated_conjecture, (~selection_favors(efficient_producers,first_movers,sk3))). % 0.12/0.40 cnf(i_0_32, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.12/0.40 cnf(i_0_31, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.40 cnf(i_0_28, plain, (greater_or_equal(end_time(X1),X2)|~in_environment(X1,X2)|~environment(X1))). % 0.12/0.40 cnf(i_0_30, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.40 cnf(i_0_29, plain, (greater_or_equal(critical_point(X1),start_time(X1))|~environment(X1))). % 0.12/0.40 cnf(i_0_22, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))|~observational_period(X1))). % 0.12/0.40 cnf(i_0_20, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(sk1(X1))|~observational_period(X1))). % 0.12/0.40 cnf(i_0_35, hypothesis, (selection_favors(efficient_producers,first_movers,X1)|~greater(X1,critical_point(X2))|~in_environment(X2,X1)|~environment(X2))). % 0.12/0.40 cnf(i_0_21, plain, (in_environment(X1,sk1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1))). % 0.12/0.40 cnf(i_0_34, plain, (greater_or_equal(end_time(X1),X2)|greater(X2,end_time(X1))|~greater(X2,start_time(X1))|~environment(X1))). % 0.12/0.40 cnf(i_0_27, plain, (in_environment(X1,X2)|~greater_or_equal(X2,start_time(X1))|~greater_or_equal(end_time(X1),X2)|~environment(X1))). % 0.12/0.40 cnf(i_0_23, plain, (in_environment(X1,sk2(X1,X2))|~slow_change(X2)|~in_environment(X2,X1)|~environment(X1)|~observational_period(X2))). % 0.12/0.40 cnf(i_0_24, plain, (greater(sk2(X1,X2),critical_point(X1))|~slow_change(X2)|~in_environment(X2,X1)|~environment(X1)|~observational_period(X2))). % 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 6 steps % 0.12/0.40 cnf(i_0_36, negated_conjecture, (observational_period(sk3)), inference(start_rule)). % 0.12/0.40 cnf(i_0_42, plain, (observational_period(sk3)), inference(extension_rule, [i_0_21])). % 0.12/0.40 cnf(i_0_155, plain, (selection_favors(efficient_producers,first_movers,sk3)), inference(closure_rule, [i_0_38])). % 0.12/0.40 cnf(i_0_154, plain, (in_environment(sk3,sk1(sk3))), inference(extension_rule, [i_0_28])). % 0.12/0.40 cnf(i_0_180, plain, (greater_or_equal(end_time(sk3),sk1(sk3))), inference(etableau_closure_rule, [i_0_180, ...])). % 0.12/0.40 cnf(i_0_182, plain, (~environment(sk3)), inference(etableau_closure_rule, [i_0_182, ...])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.41 # Child (2641480) has found a proof. % 0.12/0.41 % 0.12/0.41 # Proof search is over... % 0.12/0.41 # Freeing feature tree %------------------------------------------------------------------------------