%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT024+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:45 AM UTC 2026 % Result : Theorem 0.13s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT024+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.08/0.34 % Computer : n016.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 12:12:32 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 21 Number of unprocessed: 21 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 21 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 6 conjectures. % 0.13/0.36 # There are 6 start rule candidates: % 0.13/0.36 # Found 3 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 6 start rule tableaux created. % 0.13/0.36 # 18 extension rule candidate clauses % 0.13/0.36 # 3 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 13 tableaux to operate on % 0.13/0.37 # There were 4 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 4 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 4 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_21, negated_conjecture, (environment(esk1_0))). % 0.13/0.37 cnf(i_0_19, negated_conjecture, (greater_or_equal(esk2_0,equilibrium(esk1_0)))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (growth_rate(first_movers,esk2_0)!=zero|growth_rate(efficient_producers,esk2_0)!=zero)). % 0.13/0.37 cnf(i_0_1, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.13/0.37 cnf(i_0_2, plain, (greater(number_of_organizations(X1,X2),zero)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.13/0.37 cnf(i_0_4, hypothesis, (constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.37 cnf(i_0_3, plain, (~greater_or_equal(X1,equilibrium(X2))|~greater(equilibrium(X2),X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~greater(zero,growth_rate(first_movers,esk2_0))|~greater(growth_rate(efficient_producers,esk2_0),zero))). % 0.13/0.37 cnf(i_0_17, negated_conjecture, (~greater(zero,growth_rate(efficient_producers,esk2_0))|~greater(growth_rate(first_movers,esk2_0),zero))). % 0.13/0.37 cnf(i_0_6, hypothesis, (constant(number_of_organizations(X1,X2))|~constant(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.37 cnf(i_0_7, hypothesis, (~decreases(number_of_organizations(X1,X2))|~decreases(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.37 cnf(i_0_5, hypothesis, (decreases(resources(X1,X2))|~greater(number_of_organizations(X1,X2),zero)|~greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.37 cnf(i_0_12, hypothesis, (growth_rate(first_movers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_8, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_14, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_13, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_10, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_9, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_15, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 cnf(i_0_11, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~constant(number_of_organizations(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 9 steps % 0.13/0.37 cnf(i_0_17, negated_conjecture, (~greater(zero,growth_rate(efficient_producers,esk2_0))|~greater(growth_rate(first_movers,esk2_0),zero)), inference(start_rule)). % 0.13/0.37 cnf(i_0_23, plain, (~greater(growth_rate(first_movers,esk2_0),zero)), inference(extension_rule, [i_0_10])). % 0.13/0.37 cnf(i_0_167, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_20])). % 0.13/0.37 cnf(i_0_168, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_21])). % 0.13/0.37 cnf(i_0_163, plain, (growth_rate(efficient_producers,esk2_0)=zero), inference(extension_rule, [i_0_18])). % 0.13/0.37 cnf(i_0_22, plain, (~greater(zero,growth_rate(efficient_producers,esk2_0))), inference(etableau_closure_rule, [i_0_22, ...])). % 0.13/0.37 cnf(i_0_165, plain, (greater(zero,growth_rate(first_movers,esk2_0))), inference(etableau_closure_rule, [i_0_165, ...])). % 0.13/0.37 cnf(i_0_166, plain, (~constant(number_of_organizations(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_166, ...])). % 0.13/0.37 cnf(i_0_272, plain, (growth_rate(first_movers,esk2_0)!=zero), inference(etableau_closure_rule, [i_0_272, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (2673189) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------