%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT025-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 : n019.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 : Unsatisfiable 0.14s 0.40s % 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.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.10/0.35 % Computer : n019.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Mon Sep 7 12:10:22 UTC 2026 % 0.10/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 26 Number of unprocessed: 26 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 26 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 6 conjectures. % 0.14/0.39 # There are 6 start rule candidates: % 0.14/0.39 # Found 3 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 6 start rule tableaux created. % 0.14/0.39 # 23 extension rule candidate clauses % 0.14/0.39 # 3 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 6 % 0.14/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 11 tableaux to operate on % 0.14/0.40 # Creating equality axioms % 0.14/0.40 # Ran out of tableaux, making start rules for all clauses % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 1 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 1 successful branch saturations after the branch. % 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_47, negated_conjecture, (environment(sk1))). % 0.14/0.40 cnf(i_0_49, negated_conjecture, (constant(number_of_organizations(sk1,sk2)))). % 0.14/0.40 cnf(i_0_48, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))). % 0.14/0.40 cnf(i_0_50, negated_conjecture, (growth_rate(first_movers,sk2)!=zero|growth_rate(efficient_producers,sk2)!=zero)). % 0.14/0.40 cnf(i_0_52, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk2))|~greater(growth_rate(efficient_producers,sk2),zero))). % 0.14/0.40 cnf(i_0_30, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.40 cnf(i_0_31, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.40 cnf(i_0_51, negated_conjecture, (~greater(zero,growth_rate(efficient_producers,sk2))|~greater(growth_rate(first_movers,sk2),zero))). % 0.14/0.40 cnf(i_0_45, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.14/0.40 cnf(i_0_37, plain, (increases(X1)|increases(X2)|constant(X1)|~constant(sum(X2,X1)))). % 0.14/0.40 cnf(i_0_43, plain, (greater(cardinality_at_time(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_44, plain, (greater(cardinality_at_time(efficient_producers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_46, hypothesis, (X1=efficient_producers|X1=first_movers|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))). % 0.14/0.40 cnf(i_0_39, plain, (decreases(X1)|increases(X1)|constant(X1)|~constant(sum(X2,X1)))). % 0.14/0.40 cnf(i_0_36, plain, (decreases(X1)|increases(X1)|constant(X2)|~constant(sum(X1,X2)))). % 0.14/0.40 cnf(i_0_35, plain, (decreases(X1)|increases(X1)|constant(X2)|~constant(sum(X2,X1)))). % 0.14/0.40 cnf(i_0_32, plain, (decreases(X1)|increases(X1)|constant(X1)|~constant(sum(X1,X2)))). % 0.14/0.40 cnf(i_0_38, plain, (decreases(X1)|decreases(X2)|constant(X1)|~constant(sum(X2,X1)))). % 0.14/0.40 cnf(i_0_33, plain, (increases(X1)|increases(X2)|constant(X2)|~constant(sum(X2,X1)))). % 0.14/0.40 cnf(i_0_34, plain, (decreases(X1)|decreases(X2)|constant(X2)|~constant(sum(X2,X1)))). % 0.14/0.40 cnf(i_0_40, 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.14/0.40 cnf(i_0_42, 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.14/0.40 cnf(i_0_41, 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.14/0.40 cnf(i_0_29, 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.14/0.40 cnf(i_0_28, 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.14/0.40 cnf(i_0_27, 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.14/0.40 cnf(i_0_760, plain, (X4=X4)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_760, plain, (sk1=sk1), inference(start_rule)). % 0.14/0.40 cnf(i_0_865, plain, (sk1=sk1), inference(extension_rule, [i_0_764])). % 0.14/0.40 cnf(i_0_961, plain, (~environment(sk1)), inference(closure_rule, [i_0_47])). % 0.14/0.40 cnf(i_0_959, plain, (environment(sk1)), inference(extension_rule, [i_0_45])). % 0.14/0.40 cnf(i_0_2516, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_48])). % 0.14/0.40 cnf(i_0_2515, plain, (in_environment(sk1,sk2)), inference(etableau_closure_rule, [i_0_2515, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # Child (2764368) has found a proof. % 0.14/0.40 % 0.14/0.40 # Proof search is over... % 0.14/0.40 # Freeing feature tree %------------------------------------------------------------------------------