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