%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT033+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 : n020.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 : CounterSatisfiable 0.10s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT033+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.37 % Computer : n020.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % 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:24:28 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.40 # No SInE strategy applied % 0.10/0.40 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.10/0.40 # and selection function SelectMaxLComplexAvoidPosPred. % 0.10/0.40 # % 0.10/0.40 # Presaturation interreduction done % 0.10/0.40 # Number of axioms: 20 Number of unprocessed: 20 % 0.10/0.40 # Tableaux proof search. % 0.10/0.40 # APR header successfully linked. % 0.10/0.40 # Hello from C++ % 0.10/0.40 # The folding up rule is enabled... % 0.10/0.40 # Local unification is enabled... % 0.10/0.40 # Any saturation attempts will use folding labels... % 0.10/0.40 # 20 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 5 conjectures. % 0.10/0.40 # There are 5 start rule candidates: % 0.10/0.40 # Found 5 unit axioms. % 0.10/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.40 # 5 start rule tableaux created. % 0.10/0.40 # 15 extension rule candidate clauses % 0.10/0.40 # 5 unit axiom clauses % 0.10/0.40 % 0.10/0.40 # Requested 8, 32 cores available to the main process. % 0.10/0.40 # There are not enough tableaux to fork, creating more from the initial 5 % 0.10/0.40 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.10/0.40 # We now have 11 tableaux to operate on % 0.10/0.41 # 2940643 Satisfiable branch % 0.10/0.41 # Satisfiable branch found. % 0.10/0.41 # There were 1 total branch saturation attempts. % 0.10/0.41 # There were 0 of these attempts blocked. % 0.10/0.41 # There were 0 deferred branch saturation attempts. % 0.10/0.41 # There were 0 free duplicated saturations. % 0.10/0.41 # There were 0 total successful branch saturations. % 0.10/0.41 # There were 0 successful branch saturations in interreduction. % 0.10/0.41 # There were 0 successful branch saturations on the branch. % 0.10/0.41 # There were 0 successful branch saturations after the branch. % 0.10/0.41 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.41 # Begin clausification derivation % 0.10/0.41 % 0.10/0.41 # End clausification derivation % 0.10/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.41 cnf(i_0_20, negated_conjecture, (environment(esk2_0))). % 0.10/0.41 cnf(i_0_19, negated_conjecture, (in_environment(esk2_0,esk3_0))). % 0.10/0.41 cnf(i_0_18, negated_conjecture, (greater_or_equal(esk3_0,appear(first_movers,esk2_0)))). % 0.10/0.41 cnf(i_0_17, negated_conjecture, (greater(appear(efficient_producers,esk2_0),esk3_0))). % 0.10/0.41 cnf(i_0_16, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk3_0))). % 0.10/0.41 cnf(i_0_8, plain, (in_environment(X1,start_time(X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_9, plain, (greater_or_equal(appear(first_movers,X1),start_time(X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_11, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.41 cnf(i_0_5, plain, (cardinality_at_time(X1,t)!=zero|~greater(cardinality_at_time(X1,X2),zero))). % 0.10/0.41 cnf(i_0_10, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.41 cnf(i_0_12, plain, (in_environment(X1,appear(an_organisation,X1))|~in_environment(X1,appear(first_movers,X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_15, hypothesis, (appear(first_movers,X1)=appear(an_organisation,X1)|~in_environment(X1,appear(an_organisation,X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_6, plain, (in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.10/0.41 cnf(i_0_2, plain, (cardinality_at_time(X1,X2)=zero|~in_environment(X3,X2)|~greater(appear(X1,X3),X2)|~environment(X3))). % 0.10/0.41 cnf(i_0_13, hypothesis, (greater(number_of_organizations(X1,X2),zero)|~greater_or_equal(X2,appear(an_organisation,X1))|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.41 cnf(i_0_7, 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.10/0.41 cnf(i_0_4, plain, (subpopulation(esk1_2(X1,X2),X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.10/0.41 cnf(i_0_14, hypothesis, (X1=efficient_producers|X1=first_movers|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))). % 0.10/0.41 cnf(i_0_3, plain, (greater(cardinality_at_time(esk1_2(X1,X2),X2),zero)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.10/0.41 cnf(i_0_1, 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.10/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.41 # Begin printing tableau % 0.10/0.41 # Found 7 steps % 0.10/0.41 cnf(i_0_17, negated_conjecture, (greater(appear(efficient_producers,esk2_0),esk3_0)), inference(start_rule)). % 0.10/0.41 cnf(i_0_22, plain, (greater(appear(efficient_producers,esk2_0),esk3_0)), inference(extension_rule, [i_0_2])). % 0.10/0.41 cnf(i_0_100, plain, (~in_environment(esk2_0,esk3_0)), inference(closure_rule, [i_0_19])). % 0.10/0.41 cnf(i_0_102, plain, (~environment(esk2_0)), inference(closure_rule, [i_0_20])). % 0.10/0.41 cnf(i_0_99, plain, (cardinality_at_time(efficient_producers,esk3_0)=zero), inference(extension_rule, [i_0_1])). % 0.10/0.41 cnf(i_0_332, plain, (selection_favors(first_movers,efficient_producers,esk3_0)), inference(closure_rule, [i_0_16])). % 0.10/0.41 cnf(i_0_337, plain, (~environment(esk2_0)), inference(closure_rule, [i_0_20])). % 0.10/0.41 # End printing tableau % 0.10/0.41 # SZS output end % 0.10/0.41 # Branches closed with saturation will be marked with an "s" % 0.10/0.41 # 2940642 Satisfiable branch % 0.10/0.41 # Satisfiable branch found. % 0.10/0.41 # There were 1 total branch saturation attempts. % 0.10/0.41 # There were 0 of these attempts blocked. % 0.10/0.41 # There were 0 deferred branch saturation attempts. % 0.10/0.41 # There were 0 free duplicated saturations. % 0.10/0.41 # There were 0 total successful branch saturations. % 0.10/0.41 # There were 0 successful branch saturations in interreduction. % 0.10/0.41 # There were 0 successful branch saturations on the branch. % 0.10/0.41 # There were 0 successful branch saturations after the branch. % 0.10/0.41 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.41 # Begin clausification derivation % 0.10/0.41 % 0.10/0.41 # End clausification derivation % 0.10/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.41 cnf(i_0_20, negated_conjecture, (environment(esk2_0))). % 0.10/0.41 cnf(i_0_19, negated_conjecture, (in_environment(esk2_0,esk3_0))). % 0.10/0.41 cnf(i_0_18, negated_conjecture, (greater_or_equal(esk3_0,appear(first_movers,esk2_0)))). % 0.10/0.41 cnf(i_0_17, negated_conjecture, (greater(appear(efficient_producers,esk2_0),esk3_0))). % 0.10/0.41 cnf(i_0_16, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk3_0))). % 0.10/0.41 cnf(i_0_8, plain, (in_environment(X1,start_time(X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_9, plain, (greater_or_equal(appear(first_movers,X1),start_time(X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_11, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.41 cnf(i_0_5, plain, (cardinality_at_time(X1,t)!=zero|~greater(cardinality_at_time(X1,X2),zero))). % 0.10/0.41 cnf(i_0_10, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.41 cnf(i_0_12, plain, (in_environment(X1,appear(an_organisation,X1))|~in_environment(X1,appear(first_movers,X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_15, hypothesis, (appear(first_movers,X1)=appear(an_organisation,X1)|~in_environment(X1,appear(an_organisation,X1))|~environment(X1))). % 0.10/0.41 cnf(i_0_6, plain, (in_environment(X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.10/0.41 cnf(i_0_2, plain, (cardinality_at_time(X1,X2)=zero|~in_environment(X3,X2)|~greater(appear(X1,X3),X2)|~environment(X3))). % 0.10/0.41 cnf(i_0_13, hypothesis, (greater(number_of_organizations(X1,X2),zero)|~greater_or_equal(X2,appear(an_organisation,X1))|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.41 cnf(i_0_7, 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.10/0.41 cnf(i_0_4, plain, (subpopulation(esk1_2(X1,X2),X1,X2)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.10/0.41 cnf(i_0_14, hypothesis, (X1=efficient_producers|X1=first_movers|~greater(cardinality_at_time(X1,X2),zero)|~subpopulation(X1,X3,X2)|~environment(X3))). % 0.10/0.41 cnf(i_0_3, plain, (greater(cardinality_at_time(esk1_2(X1,X2),X2),zero)|~greater(number_of_organizations(X1,X2),zero)|~environment(X1))). % 0.10/0.41 cnf(i_0_1, 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.10/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.41 # Begin printing tableau % 0.10/0.41 # Found 6 steps % 0.10/0.41 cnf(i_0_20, negated_conjecture, (environment(esk2_0)), inference(start_rule)). % 0.10/0.41 cnf(i_0_25, plain, (environment(esk2_0)), inference(extension_rule, [i_0_9])). % 0.10/0.41 cnf(i_0_288, plain, (greater_or_equal(appear(first_movers,esk2_0),start_time(esk2_0))), inference(extension_rule, [i_0_7])). % 0.10/0.41 cnf(i_0_317, plain, (~greater_or_equal(esk3_0,appear(first_movers,esk2_0))), inference(closure_rule, [i_0_18])). % 0.10/0.41 cnf(i_0_318, plain, (~in_environment(esk2_0,esk3_0)), inference(closure_rule, [i_0_19])). % 0.10/0.41 cnf(i_0_320, plain, (~environment(esk2_0)), inference(closure_rule, [i_0_20])). % 0.10/0.41 # End printing tableau % 0.10/0.41 # SZS output end % 0.10/0.41 # Branches closed with saturation will be marked with an "s" % 0.10/0.41 # 2940646 Satisfiable branch % 0.10/0.41 # Child (2940643) has found a proof. % 0.10/0.41 % 0.10/0.41 # Proof search is over... % 0.10/0.41 # Freeing feature tree %------------------------------------------------------------------------------