%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT035+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 : n016.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:47 AM UTC 2026 % Result : Theorem 0.50s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT035+1 : TPTP v9.3.0. Released v2.0.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.36 % Computer : n016.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:37:32 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 25 Number of unprocessed: 25 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # 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 # 25 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 5 conjectures. % 0.13/0.39 # There are 5 start rule candidates: % 0.13/0.39 # Found 3 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 5 start rule tableaux created. % 0.13/0.39 # 22 extension rule candidate clauses % 0.13/0.39 # 3 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 5 % 0.13/0.39 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 14 tableaux to operate on % 0.13/0.43 # Creating equality axioms % 0.13/0.43 # Ran out of tableaux, making start rules for all clauses % 0.13/0.45 # Creating equality axioms % 0.13/0.45 # Ran out of tableaux, making start rules for all clauses % 0.50/0.46 # Creating equality axioms % 0.50/0.46 # Ran out of tableaux, making start rules for all clauses % 0.50/0.52 # There were 6 total branch saturation attempts. % 0.50/0.52 # There were 0 of these attempts blocked. % 0.50/0.52 # There were 0 deferred branch saturation attempts. % 0.50/0.52 # There were 0 free duplicated saturations. % 0.50/0.52 # There were 6 total successful branch saturations. % 0.50/0.52 # There were 0 successful branch saturations in interreduction. % 0.50/0.52 # There were 0 successful branch saturations on the branch. % 0.50/0.52 # There were 6 successful branch saturations after the branch. % 0.50/0.52 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.50/0.52 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.50/0.52 # Begin clausification derivation % 0.50/0.52 % 0.50/0.52 # End clausification derivation % 0.50/0.52 # Begin listing active clauses obtained from FOF to CNF conversion % 0.50/0.52 cnf(i_0_25, negated_conjecture, (environment(esk3_0))). % 0.50/0.52 cnf(i_0_24, negated_conjecture, (stable(esk3_0))). % 0.50/0.52 cnf(i_0_3, plain, (greater_or_equal(X1,X1))). % 0.50/0.52 cnf(i_0_21, negated_conjecture, (~outcompetes(efficient_producers,first_movers,esk4_1(X1))|~in_environment(esk3_0,X1))). % 0.50/0.52 cnf(i_0_23, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk3_0,esk4_1(X1))|~in_environment(esk3_0,X1))). % 0.50/0.52 cnf(i_0_22, negated_conjecture, (greater_or_equal(esk4_1(X1),X1)|~in_environment(esk3_0,X1))). % 0.50/0.52 cnf(i_0_4, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.50/0.52 cnf(i_0_18, hypothesis, (in_environment(X1,esk1_1(X1))|~stable(X1)|~environment(X1))). % 0.50/0.52 cnf(i_0_20, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))). % 0.50/0.52 cnf(i_0_5, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.50/0.52 cnf(i_0_19, hypothesis, (greater_or_equal(esk2_1(X1),equilibrium(X1))|~stable(X1)|~environment(X1))). % 0.50/0.52 cnf(i_0_1, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.50/0.52 cnf(i_0_7, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.50/0.52 cnf(i_0_17, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,esk1_1(X2)))). % 0.50/0.52 cnf(i_0_6, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.50/0.52 cnf(i_0_2, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~in_environment(X3,X2)|~in_environment(X3,X1))). % 0.50/0.52 cnf(i_0_8, hypothesis, (outcompetes(X1,X2,X3)|~subpopulations(X2,X1,X4,X3)|~environment(X4)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))). % 0.50/0.52 cnf(i_0_13, hypothesis, (growth_rate(first_movers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_9, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_15, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_14, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_11, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_10, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_16, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_12, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.50/0.52 cnf(i_0_223, plain, (X33=X33)). % 0.50/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.50/0.52 # Begin printing tableau % 0.50/0.52 # Found 18 steps % 0.50/0.52 cnf(i_0_223, plain, (esk2_1(esk3_0)=esk2_1(esk3_0)), inference(start_rule)). % 0.50/0.52 cnf(i_0_333, plain, (esk2_1(esk3_0)=esk2_1(esk3_0)), inference(extension_rule, [i_0_227])). % 0.50/0.52 cnf(i_0_437, plain, ($false), inference(closure_rule, [i_0_223])). % 0.50/0.52 cnf(i_0_435, plain, (greater(esk2_1(esk3_0),esk1_1(esk3_0))), inference(extension_rule, [i_0_4])). % 0.50/0.52 cnf(i_0_439, plain, (greater_or_equal(esk2_1(esk3_0),esk1_1(esk3_0))), inference(extension_rule, [i_0_17])). % 0.50/0.52 cnf(i_0_461, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_24])). % 0.50/0.52 cnf(i_0_463, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_25])). % 0.50/0.52 cnf(i_0_438, plain, (~greater(esk2_1(esk3_0),esk1_1(esk3_0))), inference(extension_rule, [i_0_2])). % 0.50/0.52 cnf(i_0_2290, plain, (esk2_1(esk3_0)=esk1_1(esk3_0)), inference(extension_rule, [i_0_230])). % 0.50/0.52 cnf(i_0_2293, plain, (~in_environment(esk3_0,esk2_1(esk3_0))), inference(extension_rule, [i_0_20])). % 0.50/0.52 cnf(i_0_2378, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_24])). % 0.50/0.52 cnf(i_0_2379, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_25])). % 0.50/0.52 cnf(i_0_460, plain, (greater(growth_rate(efficient_producers,esk2_1(esk3_0)),growth_rate(first_movers,esk2_1(esk3_0)))), inference(etableau_closure_rule, [i_0_460, ...])). % 0.50/0.52 cnf(i_0_462, plain, (~subpopulations(first_movers,efficient_producers,esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_462, ...])). % 0.50/0.52 cnf(i_0_2294, plain, (~in_environment(esk3_0,esk1_1(esk3_0))), inference(etableau_closure_rule, [i_0_2294, ...])). % 0.50/0.52 cnf(i_0_2291, plain, (greater(esk1_1(esk3_0),esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_2291, ...])). % 0.50/0.52 cnf(i_0_2374, plain, (environment(esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_2374, ...])). % 0.50/0.52 cnf(i_0_2376, plain, (~environment(esk1_1(esk3_0))), inference(etableau_closure_rule, [i_0_2376, ...])). % 0.50/0.52 # End printing tableau % 0.50/0.52 # SZS output end % 0.50/0.52 # Branches closed with saturation will be marked with an "s" % 0.50/0.52 # Child (2695397) has found a proof. % 0.50/0.52 % 0.50/0.52 # Proof search is over... % 0.50/0.52 # Freeing feature tree %------------------------------------------------------------------------------