%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT028+1 : TPTP v9.3.0. Released v2.0.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 : n026.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:46 AM UTC 2026 % Result : Theorem 0.09s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT028+1 : TPTP v9.3.0. Released v2.0.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 : n026.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 12:17:12 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.40 # No SInE strategy applied % 0.09/0.40 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.09/0.40 # and selection function SelectNewComplexAHP. % 0.09/0.40 # % 0.09/0.40 # Presaturation interreduction done % 0.09/0.40 # Number of axioms: 14 Number of unprocessed: 14 % 0.09/0.40 # Tableaux proof search. % 0.09/0.40 # APR header successfully linked. % 0.09/0.40 # Hello from C++ % 0.09/0.40 # The folding up rule is enabled... % 0.09/0.40 # Local unification is enabled... % 0.09/0.40 # Any saturation attempts will use folding labels... % 0.09/0.40 # 14 beginning clauses after preprocessing and clausification % 0.09/0.40 # Creating start rules for all 5 conjectures. % 0.09/0.40 # There are 5 start rule candidates: % 0.09/0.40 # Found 2 unit axioms. % 0.09/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.40 # 5 start rule tableaux created. % 0.09/0.40 # 12 extension rule candidate clauses % 0.09/0.40 # 2 unit axiom clauses % 0.09/0.40 % 0.09/0.40 # Requested 8, 32 cores available to the main process. % 0.09/0.40 # There are not enough tableaux to fork, creating more from the initial 5 % 0.09/0.40 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.09/0.40 # We now have 12 tableaux to operate on % 0.09/0.41 # There were 4 total branch saturation attempts. % 0.09/0.41 # There were 0 of these attempts blocked. % 0.09/0.41 # There were 0 deferred branch saturation attempts. % 0.09/0.41 # There were 0 free duplicated saturations. % 0.09/0.41 # There were 4 total successful branch saturations. % 0.09/0.41 # There were 0 successful branch saturations in interreduction. % 0.09/0.41 # There were 0 successful branch saturations on the branch. % 0.09/0.41 # There were 4 successful branch saturations after the branch. % 0.09/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.41 # Begin clausification derivation % 0.09/0.41 % 0.09/0.41 # End clausification derivation % 0.09/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.41 cnf(i_0_14, negated_conjecture, (environment(esk4_0))). % 0.09/0.41 cnf(i_0_13, negated_conjecture, (stable(esk4_0))). % 0.09/0.41 cnf(i_0_10, negated_conjecture, (~greater(zero,growth_rate(first_movers,esk5_1(X1)))|~greater(X1,appear(efficient_producers,esk4_0)))). % 0.09/0.41 cnf(i_0_12, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X1))|~greater(X1,appear(efficient_producers,esk4_0)))). % 0.09/0.41 cnf(i_0_11, negated_conjecture, (greater_or_equal(esk5_1(X1),X1)|~greater(X1,appear(efficient_producers,esk4_0)))). % 0.09/0.41 cnf(i_0_9, hypothesis, (in_environment(X1,esk3_1(X1))|~stable(X1)|~environment(X1))). % 0.09/0.41 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,esk3_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))). % 0.09/0.41 cnf(i_0_8, hypothesis, (greater(growth_rate(efficient_producers,X1),zero)|~greater_or_equal(X1,esk3_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))). % 0.09/0.41 cnf(i_0_2, plain, (greater(esk2_1(X1),appear(efficient_producers,X1))|~greater(zero,growth_rate(first_movers,esk1_2(X1,X2)))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))). % 0.09/0.41 cnf(i_0_4, plain, (greater(esk2_1(X1),appear(efficient_producers,X1))|greater_or_equal(esk1_2(X1,X2),X2)|~in_environment(X1,X2)|~stable(X1)|~environment(X1))). % 0.09/0.41 cnf(i_0_6, plain, (greater(esk2_1(X1),appear(efficient_producers,X1))|subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))). % 0.09/0.41 cnf(i_0_3, plain, (greater(zero,growth_rate(first_movers,X1))|greater_or_equal(esk1_2(X2,X3),X3)|~greater_or_equal(X1,esk2_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))). % 0.09/0.41 cnf(i_0_1, plain, (greater(zero,growth_rate(first_movers,X1))|~greater(zero,growth_rate(first_movers,esk1_2(X2,X3)))|~greater_or_equal(X1,esk2_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))). % 0.09/0.41 cnf(i_0_5, plain, (greater(zero,growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X3))|~greater_or_equal(X1,esk2_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))). % 0.09/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.41 # Begin printing tableau % 0.09/0.41 # Found 11 steps % 0.09/0.41 cnf(i_0_11, negated_conjecture, (greater_or_equal(esk5_1(esk2_1(esk4_0)),esk2_1(esk4_0))|~greater(esk2_1(esk4_0),appear(efficient_producers,esk4_0))), inference(start_rule)). % 0.09/0.41 cnf(i_0_16, plain, (~greater(esk2_1(esk4_0),appear(efficient_producers,esk4_0))), inference(extension_rule, [i_0_4])). % 0.09/0.41 cnf(i_0_99, plain, (~stable(esk4_0)), inference(closure_rule, [i_0_13])). % 0.09/0.41 cnf(i_0_100, plain, (~environment(esk4_0)), inference(closure_rule, [i_0_14])). % 0.09/0.41 cnf(i_0_97, plain, (greater_or_equal(esk1_2(esk4_0,esk3_1(esk4_0)),esk3_1(esk4_0))), inference(extension_rule, [i_0_7])). % 0.09/0.41 cnf(i_0_139, plain, (~stable(esk4_0)), inference(closure_rule, [i_0_13])). % 0.09/0.41 cnf(i_0_140, plain, (~environment(esk4_0)), inference(closure_rule, [i_0_14])). % 0.09/0.41 cnf(i_0_15, plain, (greater_or_equal(esk5_1(esk2_1(esk4_0)),esk2_1(esk4_0))), inference(etableau_closure_rule, [i_0_15, ...])). % 0.09/0.41 cnf(i_0_98, plain, (~in_environment(esk4_0,esk3_1(esk4_0))), inference(etableau_closure_rule, [i_0_98, ...])). % 0.09/0.41 cnf(i_0_136, plain, (greater(zero,growth_rate(first_movers,esk1_2(esk4_0,esk3_1(esk4_0))))), inference(etableau_closure_rule, [i_0_136, ...])). % 0.09/0.41 cnf(i_0_138, plain, (~subpopulations(first_movers,efficient_producers,esk4_0,esk1_2(esk4_0,esk3_1(esk4_0)))), inference(etableau_closure_rule, [i_0_138, ...])). % 0.09/0.41 # End printing tableau % 0.09/0.41 # SZS output end % 0.09/0.41 # Branches closed with saturation will be marked with an "s" % 0.09/0.41 # Child (2500783) has found a proof. % 0.09/0.41 % 0.09/0.41 # Proof search is over... % 0.09/0.41 # Freeing feature tree %------------------------------------------------------------------------------