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