%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT024-1 : TPTP v9.3.0. Released v2.4.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 : n015.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 : Unsatisfiable 0.12s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT024-1 : TPTP v9.3.0. Released v2.4.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.12/0.37 % Computer : n015.cluster.edu % 0.12/0.37 % Model : x86_64 x86_64 % 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.37 % Memory : 8046.5625MB % 0.12/0.37 % OS : Linux 6.8.0-71-generic % 0.12/0.37 % CPULimit : 300 % 0.12/0.37 % WCLimit : 300 % 0.12/0.37 % DateTime : Mon Sep 7 12:12:00 UTC 2026 % 0.12/0.37 % CPUTime : % 0.12/0.40 # No SInE strategy applied % 0.12/0.40 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.12/0.40 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.40 # % 0.12/0.40 # Presaturation interreduction done % 0.12/0.40 # Number of axioms: 21 Number of unprocessed: 21 % 0.12/0.40 # Tableaux proof search. % 0.12/0.40 # APR header successfully linked. % 0.12/0.40 # Hello from C++ % 0.12/0.41 # The folding up rule is enabled... % 0.12/0.41 # Local unification is enabled... % 0.12/0.41 # Any saturation attempts will use folding labels... % 0.12/0.41 # 21 beginning clauses after preprocessing and clausification % 0.12/0.41 # Creating start rules for all 6 conjectures. % 0.12/0.41 # There are 6 start rule candidates: % 0.12/0.41 # Found 3 unit axioms. % 0.12/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.41 # 6 start rule tableaux created. % 0.12/0.41 # 18 extension rule candidate clauses % 0.12/0.41 # 3 unit axiom clauses % 0.12/0.41 % 0.12/0.41 # Requested 8, 32 cores available to the main process. % 0.12/0.41 # There are not enough tableaux to fork, creating more from the initial 6 % 0.12/0.41 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.12/0.41 # We now have 13 tableaux to operate on % 0.12/0.42 # There were 4 total branch saturation attempts. % 0.12/0.42 # There were 0 of these attempts blocked. % 0.12/0.42 # There were 0 deferred branch saturation attempts. % 0.12/0.42 # There were 0 free duplicated saturations. % 0.12/0.42 # There were 4 total successful branch saturations. % 0.12/0.42 # There were 0 successful branch saturations in interreduction. % 0.12/0.42 # There were 0 successful branch saturations on the branch. % 0.12/0.42 # There were 4 successful branch saturations after the branch. % 0.12/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.42 # Begin clausification derivation % 0.12/0.42 % 0.12/0.42 # End clausification derivation % 0.12/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.42 cnf(i_0_37, negated_conjecture, (environment(sk1))). % 0.12/0.42 cnf(i_0_39, negated_conjecture, (greater_or_equal(sk2,equilibrium(sk1)))). % 0.12/0.42 cnf(i_0_38, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))). % 0.12/0.42 cnf(i_0_40, negated_conjecture, (growth_rate(first_movers,sk2)!=zero|growth_rate(efficient_producers,sk2)!=zero)). % 0.12/0.42 cnf(i_0_22, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.42 cnf(i_0_23, plain, (greater(number_of_organizations(X1,X2),zero)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.42 cnf(i_0_26, hypothesis, (constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~environment(X1))). % 0.12/0.42 cnf(i_0_24, plain, (~greater_or_equal(X1,equilibrium(X2))|~greater(equilibrium(X2),X1)|~environment(X2))). % 0.12/0.42 cnf(i_0_42, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk2))|~greater(growth_rate(efficient_producers,sk2),zero))). % 0.12/0.42 cnf(i_0_41, negated_conjecture, (~greater(zero,growth_rate(efficient_producers,sk2))|~greater(growth_rate(first_movers,sk2),zero))). % 0.12/0.42 cnf(i_0_28, hypothesis, (constant(number_of_organizations(X1,X2))|~constant(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.12/0.42 cnf(i_0_27, hypothesis, (~decreases(number_of_organizations(X1,X2))|~decreases(resources(X1,X2))|~in_environment(X1,X2)|~environment(X1))). % 0.12/0.42 cnf(i_0_25, hypothesis, (decreases(resources(X1,X2))|~greater(number_of_organizations(X1,X2),zero)|~greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~environment(X1))). % 0.12/0.42 cnf(i_0_32, 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.12/0.42 cnf(i_0_36, 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.12/0.42 cnf(i_0_30, 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.12/0.42 cnf(i_0_31, 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.12/0.42 cnf(i_0_34, 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.12/0.42 cnf(i_0_35, 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.12/0.42 cnf(i_0_29, 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.12/0.42 cnf(i_0_33, 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.12/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.42 # Begin printing tableau % 0.12/0.42 # Found 8 steps % 0.12/0.42 cnf(i_0_37, negated_conjecture, (environment(sk1)), inference(start_rule)). % 0.12/0.42 cnf(i_0_51, plain, (environment(sk1)), inference(extension_rule, [i_0_32])). % 0.12/0.42 cnf(i_0_1055, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_38])). % 0.12/0.42 cnf(i_0_1051, plain, (growth_rate(first_movers,sk2)=zero), inference(extension_rule, [i_0_40])). % 0.12/0.42 cnf(i_0_1052, plain, (greater(zero,growth_rate(efficient_producers,sk2))), inference(etableau_closure_rule, [i_0_1052, ...])). % 0.12/0.42 cnf(i_0_1053, plain, (greater(zero,growth_rate(first_movers,sk2))), inference(etableau_closure_rule, [i_0_1053, ...])). % 0.12/0.42 cnf(i_0_1054, plain, (~constant(number_of_organizations(sk1,sk2))), inference(etableau_closure_rule, [i_0_1054, ...])). % 0.12/0.42 cnf(i_0_1104, plain, (growth_rate(efficient_producers,sk2)!=zero), inference(etableau_closure_rule, [i_0_1104, ...])). % 0.12/0.42 # End printing tableau % 0.12/0.42 # SZS output end % 0.12/0.42 # Branches closed with saturation will be marked with an "s" % 0.12/0.42 # Child (1194637) has found a proof. % 0.12/0.42 % 0.12/0.42 # Proof search is over... % 0.12/0.42 # Freeing feature tree %------------------------------------------------------------------------------