%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT037+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 : n014.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:48 AM UTC 2026 % Result : Theorem 0.14s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT037+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.35 % Computer : n014.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 12:43:11 UTC 2026 % 0.09/0.35 % CPUTime : % 0.09/0.37 # No SInE strategy applied % 0.09/0.37 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.09/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.09/0.37 # % 0.09/0.37 # Presaturation interreduction done % 0.09/0.37 # Number of axioms: 27 Number of unprocessed: 27 % 0.09/0.37 # Tableaux proof search. % 0.09/0.37 # APR header successfully linked. % 0.09/0.37 # Hello from C++ % 0.09/0.37 # The folding up rule is enabled... % 0.09/0.37 # Local unification is enabled... % 0.09/0.37 # Any saturation attempts will use folding labels... % 0.09/0.37 # 27 beginning clauses after preprocessing and clausification % 0.09/0.37 # Creating start rules for all 4 conjectures. % 0.09/0.37 # There are 4 start rule candidates: % 0.09/0.37 # Found 5 unit axioms. % 0.09/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.37 # 4 start rule tableaux created. % 0.09/0.37 # 22 extension rule candidate clauses % 0.09/0.37 # 5 unit axiom clauses % 0.09/0.37 % 0.09/0.37 # Requested 8, 32 cores available to the main process. % 0.09/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.09/0.37 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. % 0.09/0.37 # We now have 21 tableaux to operate on % 0.14/0.39 # There were 3 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 3 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 3 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_27, negated_conjecture, (environment(esk3_0))). % 0.14/0.39 cnf(i_0_26, negated_conjecture, (in_environment(esk3_0,esk4_0))). % 0.14/0.39 cnf(i_0_25, negated_conjecture, (greater_or_equal(esk4_0,appear(efficient_producers,esk3_0)))). % 0.14/0.39 cnf(i_0_22, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.14/0.39 cnf(i_0_24, negated_conjecture, (~greater(cardinality_at_time(efficient_producers,esk4_0),zero))). % 0.14/0.39 cnf(i_0_10, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_11, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_14, plain, (~constant(X1)|~decreases(X1))). % 0.14/0.39 cnf(i_0_13, plain, (cardinality_at_time(efficient_producers,X1)=zero|greater(cardinality_at_time(efficient_producers,X1),zero)|~in_environment(X2,X1)|~environment(X2))). % 0.14/0.39 cnf(i_0_12, plain, (cardinality_at_time(X1,X2)!=zero|~greater(zero,growth_rate(X1,X2)))). % 0.14/0.39 cnf(i_0_5, plain, (number_of_organizations(X1,X2)=zero|~in_environment(X1,X2)|~greater(appear(an_organisation,X1),X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_19, hypothesis, (constant(number_of_organizations(X1,X2))|~constant(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_20, hypothesis, (~decreases(number_of_organizations(X1,X2))|~decreases(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_15, plain, (greater(appear(an_organisation,X1),X2)|greater_or_equal(X2,appear(an_organisation,X1))|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_18, hypothesis, (greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~greater_or_equal(X2,appear(an_organisation,X1))|~environment(X1))). % 0.14/0.39 cnf(i_0_4, plain, (greater(esk1_2(X1,X2),appear(efficient_producers,X1))|cardinality_at_time(efficient_producers,X2)!=zero|~greater_or_equal(X2,appear(efficient_producers,X1))|~environment(X1))). % 0.14/0.39 cnf(i_0_8, plain, (subpopulation(esk2_2(X1,X2),X1,X2)|decreases(number_of_organizations(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_2, plain, (greater(X1,esk1_2(X2,X1))|cardinality_at_time(efficient_producers,X1)!=zero|~greater_or_equal(X1,appear(efficient_producers,X2))|~environment(X2))). % 0.14/0.39 cnf(i_0_3, plain, (in_environment(X1,esk1_2(X1,X2))|cardinality_at_time(efficient_producers,X2)!=zero|~greater_or_equal(X2,appear(efficient_producers,X1))|~environment(X1))). % 0.14/0.39 cnf(i_0_1, plain, (greater(zero,growth_rate(efficient_producers,esk1_2(X1,X2)))|cardinality_at_time(efficient_producers,X2)!=zero|~greater_or_equal(X2,appear(efficient_producers,X1))|~environment(X1))). % 0.14/0.39 cnf(i_0_23, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))). % 0.14/0.39 cnf(i_0_7, plain, (decreases(number_of_organizations(X1,X2))|greater(cardinality_at_time(esk2_2(X1,X2),X2),zero)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_16, hypothesis, (constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.14/0.39 cnf(i_0_17, hypothesis, (decreases(resources(X1,X2))|~in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~greater(equilibrium(X1),X2)|~environment(X1))). % 0.14/0.39 cnf(i_0_9, plain, (cardinality_at_time(X1,X2)=zero|number_of_organizations(X3,X2)!=zero|~subpopulation(X1,X3,X2)|~in_environment(X3,X2)|~environment(X3))). % 0.14/0.39 cnf(i_0_6, plain, (decreases(number_of_organizations(X1,X2))|~in_environment(X1,X2)|~greater(zero,growth_rate(esk2_2(X1,X2),X2))|~environment(X1))). % 0.14/0.39 cnf(i_0_21, hypothesis, (greater(zero,growth_rate(X1,X2))|~in_environment(X3,X2)|~greater(zero,growth_rate(X4,X2))|~greater(resilience(X4),resilience(X1))|~environment(X3))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 7 steps % 0.14/0.39 cnf(i_0_26, negated_conjecture, (in_environment(esk3_0,esk4_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_30, plain, (in_environment(esk3_0,esk4_0)), inference(extension_rule, [i_0_16])). % 0.14/0.39 cnf(i_0_273, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_27])). % 0.14/0.39 cnf(i_0_269, plain, (constant(resources(esk3_0,esk4_0))), inference(extension_rule, [i_0_14])). % 0.14/0.39 cnf(i_0_270, plain, (greater(equilibrium(esk3_0),esk4_0)), inference(etableau_closure_rule, [i_0_270, ...])). % 0.14/0.39 cnf(i_0_272, plain, (~greater(number_of_organizations(esk3_0,esk4_0),zero)), inference(etableau_closure_rule, [i_0_272, ...])). % 0.14/0.39 cnf(i_0_300, plain, (~decreases(resources(esk3_0,esk4_0))), inference(etableau_closure_rule, [i_0_300, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (3916914) has found a proof. % 0.14/0.39 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------