%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT033-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 : n009.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.08s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT033-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.08/0.35 % Computer : n009.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 12:24:22 UTC 2026 % 0.08/0.36 % CPUTime : % 0.08/0.39 # No SInE strategy applied % 0.08/0.39 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.08/0.39 # and selection function SelectMaxLComplexAvoidPosPred. % 0.08/0.39 # % 0.08/0.39 # Presaturation interreduction done % 0.08/0.39 # Number of axioms: 20 Number of unprocessed: 20 % 0.08/0.39 # Tableaux proof search. % 0.08/0.39 # APR header successfully linked. % 0.08/0.39 # Hello from C++ % 0.08/0.39 # The folding up rule is enabled... % 0.08/0.39 # Local unification is enabled... % 0.08/0.39 # Any saturation attempts will use folding labels... % 0.08/0.39 # 20 beginning clauses after preprocessing and clausification % 0.08/0.39 # Creating start rules for all 5 conjectures. % 0.08/0.39 # There are 5 start rule candidates: % 0.08/0.39 # Found 5 unit axioms. % 0.08/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.08/0.39 # 5 start rule tableaux created. % 0.08/0.39 # 15 extension rule candidate clauses % 0.08/0.39 # 5 unit axiom clauses % 0.08/0.39 % 0.08/0.39 # Requested 8, 32 cores available to the main process. % 0.08/0.39 # There are not enough tableaux to fork, creating more from the initial 5 % 0.08/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.08/0.39 # We now have 11 tableaux to operate on % 0.08/0.39 # 1533433 Satisfiable branch % 0.08/0.39 # Satisfiable branch found. % 0.08/0.39 # There were 1 total branch saturation attempts. % 0.08/0.39 # There were 0 of these attempts blocked. % 0.08/0.39 # There were 0 deferred branch saturation attempts. % 0.08/0.39 # There were 0 free duplicated saturations. % 0.08/0.39 # There were 0 total successful branch saturations. % 0.08/0.39 # There were 0 successful branch saturations in interreduction. % 0.08/0.39 # There were 0 successful branch saturations on the branch. % 0.08/0.39 # There were 0 successful branch saturations after the branch. % 0.08/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.39 # Begin clausification derivation % 0.08/0.39 % 0.08/0.39 # End clausification derivation % 0.08/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.39 cnf(i_0_36, negated_conjecture, (environment(sk2))). % 0.08/0.39 cnf(i_0_37, negated_conjecture, (in_environment(sk2,sk3))). % 0.08/0.39 cnf(i_0_38, negated_conjecture, (greater_or_equal(sk3,appear(first_movers,sk2)))). % 0.08/0.39 cnf(i_0_39, negated_conjecture, (greater(appear(efficient_producers,sk2),sk3))). % 0.08/0.39 cnf(i_0_40, negated_conjecture, (~selection_favors(first_movers,efficient_producers,sk3))). % 0.08/0.39 cnf(i_0_28, plain, (in_environment(X1,start_time(X1))|~environment(X1))). % 0.08/0.39 cnf(i_0_29, plain, (greater_or_equal(appear(first_movers,X1),start_time(X1))|~environment(X1))). % 0.08/0.39 cnf(i_0_30, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.08/0.39 cnf(i_0_25, plain, (cardinality_at_time(X1,t)!=zero|~greater(cardinality_at_time(X1,X2),zero))). % 0.08/0.39 cnf(i_0_31, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.08/0.39 cnf(i_0_32, plain, (in_environment(X1,appear(an_organisation,X1))|~in_environment(X1,appear(first_movers,X1))|~environment(X1))). % 0.08/0.39 cnf(i_0_35, hypothesis, (appear(first_movers,X1)=appear(an_organisation,X1)|~in_environment(X1,appear(an_organisation,X1))|~environment(X1))). % 0.08/0.39 cnf(i_0_26, plain, (in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.08/0.39 cnf(i_0_22, plain, (cardinality_at_time(X1,X2)=zero|~in_environment(X3,X2)|~greater(appear(X1,X3),X2)|~environment(X3))). % 0.08/0.39 cnf(i_0_33, hypothesis, (greater(number_of_organizations(X1,X2),zero)|~greater_or_equal(X2,appear(an_organisation,X1))|~in_environment(X1,X2)|~environment(X1))). % 0.08/0.39 cnf(i_0_27, 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.08/0.39 cnf(i_0_23, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.39 cnf(i_0_34, hypothesis, (X1=efficient_producers|X1=first_movers|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))). % 0.08/0.39 cnf(i_0_24, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.39 cnf(i_0_21, 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.08/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.39 # Begin printing tableau % 0.08/0.39 # Found 7 steps % 0.08/0.39 cnf(i_0_39, negated_conjecture, (greater(appear(efficient_producers,sk2),sk3)), inference(start_rule)). % 0.08/0.39 cnf(i_0_42, plain, (greater(appear(efficient_producers,sk2),sk3)), inference(extension_rule, [i_0_22])). % 0.08/0.39 cnf(i_0_120, plain, (~in_environment(sk2,sk3)), inference(closure_rule, [i_0_37])). % 0.08/0.39 cnf(i_0_122, plain, (~environment(sk2)), inference(closure_rule, [i_0_36])). % 0.08/0.39 cnf(i_0_119, plain, (cardinality_at_time(efficient_producers,sk3)=zero), inference(extension_rule, [i_0_21])). % 0.08/0.39 cnf(i_0_352, plain, (selection_favors(first_movers,efficient_producers,sk3)), inference(closure_rule, [i_0_40])). % 0.08/0.39 cnf(i_0_357, plain, (~environment(sk2)), inference(closure_rule, [i_0_36])). % 0.08/0.39 # End printing tableau % 0.08/0.39 # SZS output end % 0.08/0.39 # Branches closed with saturation will be marked with an "s" % 0.08/0.40 # Child (1533433) has found a proof. % 0.08/0.40 % 0.08/0.40 # Proof search is over... % 0.08/0.40 # Freeing feature tree %------------------------------------------------------------------------------