%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT033-2 : 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 : n013.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:47 AM UTC 2026 % Result : Satisfiable 0.14s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT033-2 : 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.36 % Computer : n013.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.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 12:26:05 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___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.14/0.39 # and selection function SelectMaxLComplexAvoidPosPred. % 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 5 conjectures. % 0.14/0.39 # There are 5 start rule candidates: % 0.14/0.39 # Found 6 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 5 start rule tableaux created. % 0.14/0.39 # 20 extension rule candidate clauses % 0.14/0.39 # 6 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 5 % 0.14/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 10 tableaux to operate on % 0.14/0.49 # 1787087 Satisfiable branch % 0.14/0.49 # Satisfiable branch found. % 0.14/0.49 # There were 1 total branch saturation attempts. % 0.14/0.49 # There were 0 of these attempts blocked. % 0.14/0.49 # There were 0 deferred branch saturation attempts. % 0.14/0.49 # There were 0 free duplicated saturations. % 0.14/0.49 # There were 0 total successful branch saturations. % 0.14/0.49 # There were 0 successful branch saturations in interreduction. % 0.14/0.49 # There were 0 successful branch saturations on the branch. % 0.14/0.49 # There were 0 successful branch saturations after the branch. % 0.14/0.49 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.49 # Begin clausification derivation % 0.14/0.49 % 0.14/0.49 # End clausification derivation % 0.14/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.49 cnf(i_0_48, negated_conjecture, (environment(sk2))). % 0.14/0.49 cnf(i_0_49, negated_conjecture, (in_environment(sk2,sk3))). % 0.14/0.49 cnf(i_0_50, negated_conjecture, (greater_or_equal(sk3,appear(first_movers,sk2)))). % 0.14/0.49 cnf(i_0_51, negated_conjecture, (greater(appear(efficient_producers,sk2),sk3))). % 0.14/0.49 cnf(i_0_44, plain, (greater_or_equal(X1,X1))). % 0.14/0.49 cnf(i_0_52, negated_conjecture, (~selection_favors(first_movers,efficient_producers,sk3))). % 0.14/0.49 cnf(i_0_43, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.14/0.49 cnf(i_0_34, plain, (in_environment(X1,start_time(X1))|~environment(X1))). % 0.14/0.49 cnf(i_0_42, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.14/0.49 cnf(i_0_35, plain, (greater_or_equal(appear(first_movers,X1),start_time(X1))|~environment(X1))). % 0.14/0.49 cnf(i_0_39, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.49 cnf(i_0_40, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.49 cnf(i_0_46, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))). % 0.14/0.49 cnf(i_0_37, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))). % 0.14/0.49 cnf(i_0_36, plain, (in_environment(X1,appear(an_organisation,X1))|~in_environment(X1,appear(first_movers,X1))|~environment(X1))). % 0.14/0.49 cnf(i_0_41, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.14/0.49 cnf(i_0_38, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))). % 0.14/0.49 cnf(i_0_30, plain, (cardinality_at_time(X1,t)!=zero|~greater(cardinality_at_time(X1,X2),zero))). % 0.14/0.49 cnf(i_0_32, plain, (in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.14/0.49 cnf(i_0_31, plain, (cardinality_at_time(X1,X2)=zero|~in_environment(X3,X2)|~greater(appear(X1,X3),X2)|~environment(X3))). % 0.14/0.49 cnf(i_0_45, hypothesis, (greater(number_of_organizations(X1,X2),zero)|~greater_or_equal(X2,appear(an_organisation,X1))|~in_environment(X1,X2)|~environment(X1))). % 0.14/0.49 cnf(i_0_29, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.14/0.49 cnf(i_0_33, plain, (in_environment(X1,X2)|~greater_or_equal(X2,X3)|~greater_or_equal(X4,X2)|~in_environment(X1,X4)|~in_environment(X1,X3)|~environment(X1))). % 0.14/0.49 cnf(i_0_47, hypothesis, (X1=efficient_producers|X1=first_movers|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))). % 0.14/0.49 cnf(i_0_28, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.14/0.49 cnf(i_0_27, plain, (selection_favors(X1,X2,X3)|cardinality_at_time(X2,X3)!=zero|~greater(cardinality_at_time(X1,X3),zero)|~subpopulation(X2,X4,X3)|~subpopulation(X1,X4,X3)|~environment(X4))). % 0.14/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.49 # Begin printing tableau % 0.14/0.49 # Found 5 steps % 0.14/0.49 cnf(i_0_51, negated_conjecture, (greater(appear(efficient_producers,sk2),sk3)), inference(start_rule)). % 0.14/0.49 cnf(i_0_55, plain, (greater(appear(efficient_producers,sk2),sk3)), inference(extension_rule, [i_0_41])). % 0.14/0.49 cnf(i_0_144, plain, (greater(appear(efficient_producers,sk2),appear(an_organisation,sk2))), inference(extension_rule, [i_0_43])). % 0.14/0.49 cnf(i_0_248, plain, (greater_or_equal(appear(efficient_producers,sk2),appear(an_organisation,sk2))), inference(extension_rule, [i_0_45])). % 0.14/0.49 cnf(i_0_287, plain, (~environment(sk2)), inference(closure_rule, [i_0_48])). % 0.14/0.49 # End printing tableau % 0.14/0.49 # SZS output end % 0.14/0.49 # Branches closed with saturation will be marked with an "s" % 0.14/0.49 # Child (1787087) has found a proof. % 0.14/0.49 % 0.14/0.49 # Proof search is over... % 0.14/0.49 # Freeing feature tree %------------------------------------------------------------------------------