%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT031-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 : n028.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 : Satisfiable 0.08s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT031-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.34 % Computer : n028.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 12:23:17 UTC 2026 % 0.08/0.34 % CPUTime : % 0.08/0.37 # No SInE strategy applied % 0.08/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.08/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.08/0.37 # % 0.08/0.37 # Presaturation interreduction done % 0.08/0.37 # Number of axioms: 15 Number of unprocessed: 15 % 0.08/0.37 # Tableaux proof search. % 0.08/0.37 # APR header successfully linked. % 0.08/0.37 # Hello from C++ % 0.08/0.37 # The folding up rule is enabled... % 0.08/0.37 # Local unification is enabled... % 0.08/0.37 # Any saturation attempts will use folding labels... % 0.08/0.37 # 15 beginning clauses after preprocessing and clausification % 0.08/0.37 # Creating start rules for all 3 conjectures. % 0.08/0.37 # There are 3 start rule candidates: % 0.08/0.37 # Found 4 unit axioms. % 0.08/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.08/0.37 # 3 start rule tableaux created. % 0.08/0.37 # 11 extension rule candidate clauses % 0.08/0.37 # 4 unit axiom clauses % 0.08/0.37 % 0.08/0.37 # Requested 8, 32 cores available to the main process. % 0.08/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.08/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.08/0.37 # We now have 11 tableaux to operate on % 0.08/0.37 # 2635535 Satisfiable branch % 0.08/0.37 # Satisfiable branch found. % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 0 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 0 successful branch saturations after the branch. % 0.08/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_28, negated_conjecture, (environment(sk2))). % 0.08/0.37 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))). % 0.08/0.37 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.08/0.37 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))). % 0.08/0.37 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.08/0.37 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))). % 0.08/0.37 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.08/0.37 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.08/0.37 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))). % 0.08/0.37 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))). % 0.08/0.37 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))). % 0.08/0.37 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))). % 0.08/0.37 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))). % 0.08/0.37 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.37 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 3 steps % 0.08/0.37 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2)), inference(start_rule)). % 0.08/0.37 cnf(i_0_32, plain, (appear(an_organisation,sk2)!=appear(first_movers,sk2)), inference(extension_rule, [i_0_23])). % 0.08/0.37 cnf(i_0_40, plain, (greater(appear(an_organisation,sk2),appear(first_movers,sk2))), inference(extension_rule, [i_0_22])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.38 # 2635534 Satisfiable branch % 0.08/0.38 # 2635536 Satisfiable branch % 0.08/0.38 # 2635537 Satisfiable branch % 0.08/0.38 # Satisfiable branch found. % 0.08/0.38 # There were 1 total branch saturation attempts. % 0.08/0.38 # There were 0 of these attempts blocked. % 0.08/0.38 # There were 0 deferred branch saturation attempts. % 0.08/0.38 # There were 0 free duplicated saturations. % 0.08/0.38 # There were 0 total successful branch saturations. % 0.08/0.38 # There were 0 successful branch saturations in interreduction. % 0.08/0.38 # There were 0 successful branch saturations on the branch. % 0.08/0.38 # There were 0 successful branch saturations after the branch. % 0.08/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.38 # Begin clausification derivation % 0.08/0.38 % 0.08/0.38 # End clausification derivation % 0.08/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))). % 0.08/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))). % 0.08/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.08/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))). % 0.08/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.08/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))). % 0.08/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.08/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.08/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))). % 0.08/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))). % 0.08/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))). % 0.08/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))). % 0.08/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))). % 0.08/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.38 # Begin printing tableau % 0.08/0.38 # Found 4 steps % 0.08/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2))), inference(start_rule)). % 0.08/0.38 cnf(i_0_33, plain, (in_environment(sk2,appear(an_organisation,sk2))), inference(extension_rule, [i_0_19])). % 0.08/0.38 cnf(i_0_81, plain, (~environment(sk2)), inference(closure_rule, [i_0_28])). % 0.08/0.38 cnf(i_0_79, plain, (~greater(cardinality_at_time(efficient_producers,appear(an_organisation,sk2)),zero)), inference(extension_rule, [i_0_23])). % 0.08/0.38 # End printing tableau % 0.08/0.38 # SZS output end % 0.08/0.38 # Branches closed with saturation will be marked with an "s" % 0.08/0.38 # Satisfiable branch found. % 0.08/0.38 # There were 1 total branch saturation attempts. % 0.08/0.38 # There were 0 of these attempts blocked. % 0.08/0.38 # There were 0 deferred branch saturation attempts. % 0.08/0.38 # There were 0 free duplicated saturations. % 0.08/0.38 # There were 0 total successful branch saturations. % 0.08/0.38 # There were 0 successful branch saturations in interreduction. % 0.08/0.38 # There were 0 successful branch saturations on the branch. % 0.08/0.38 # There were 0 successful branch saturations after the branch. % 0.08/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.38 # Begin clausification derivation % 0.08/0.38 % 0.08/0.38 # End clausification derivation % 0.08/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))). % 0.08/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))). % 0.08/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.08/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))). % 0.08/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.08/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))). % 0.08/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.08/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.08/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))). % 0.08/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))). % 0.08/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))). % 0.08/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))). % 0.08/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))). % 0.08/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.38 # Begin printing tableau % 0.08/0.38 # Found 3 steps % 0.08/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2)), inference(start_rule)). % 0.08/0.38 cnf(i_0_34, plain, (environment(sk2)), inference(extension_rule, [i_0_16])). % 0.08/0.38 cnf(i_0_121, plain, (greater(number_of_organizations(e,appear(an_organisation,sk2)),zero)), inference(extension_rule, [i_0_24])). % 0.08/0.38 # End printing tableau % 0.08/0.38 # SZS output end % 0.08/0.38 # Branches closed with saturation will be marked with an "s" % 0.08/0.38 # Satisfiable branch found. % 0.08/0.38 # There were 1 total branch saturation attempts. % 0.08/0.38 # There were 0 of these attempts blocked. % 0.08/0.38 # There were 0 deferred branch saturation attempts. % 0.08/0.38 # There were 0 free duplicated saturations. % 0.08/0.38 # There were 0 total successful branch saturations. % 0.08/0.38 # There were 0 successful branch saturations in interreduction. % 0.08/0.38 # There were 0 successful branch saturations on the branch. % 0.08/0.38 # There were 0 successful branch saturations after the branch. % 0.08/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.38 # Begin clausification derivation % 0.08/0.38 % 0.08/0.38 # End clausification derivation % 0.08/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2))). % 0.08/0.38 cnf(i_0_29, negated_conjecture, (in_environment(sk2,appear(an_organisation,sk2)))). % 0.08/0.38 cnf(i_0_25, plain, (greater_or_equal(X1,X1))). % 0.08/0.38 cnf(i_0_30, negated_conjecture, (appear(an_organisation,sk2)!=appear(first_movers,sk2))). % 0.08/0.38 cnf(i_0_24, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.08/0.38 cnf(i_0_21, plain, (greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))|~environment(X1))). % 0.08/0.38 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.08/0.38 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.08/0.38 cnf(i_0_19, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(appear(efficient_producers,X1),X2)|~environment(X1))). % 0.08/0.38 cnf(i_0_20, plain, (~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(appear(first_movers,X1),X2)|~environment(X1))). % 0.08/0.38 cnf(i_0_27, hypothesis, (greater(appear(efficient_producers,e),appear(first_movers,X1))|~environment(X1))). % 0.08/0.38 cnf(i_0_16, plain, (greater(number_of_organizations(e,appear(an_organisation,X1)),zero)|~environment(X1))). % 0.08/0.38 cnf(i_0_26, hypothesis, (X1=first_movers|X1=efficient_producers|~subpopulation(X1,X2,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X2))). % 0.08/0.38 cnf(i_0_17, plain, (subpopulation(sk1(X1,X2),X2,X1)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.38 cnf(i_0_18, plain, (greater(cardinality_at_time(sk1(X1,X2),X1),zero)|~greater(number_of_organizations(X2,X1),zero)|~environment(X2))). % 0.08/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.38 # Begin printing tableau % 0.08/0.38 # Found 3 steps % 0.08/0.38 cnf(i_0_28, negated_conjecture, (environment(sk2)), inference(start_rule)). % 0.08/0.38 cnf(i_0_34, plain, (environment(sk2)), inference(extension_rule, [i_0_27])). % 0.08/0.38 cnf(i_0_119, plain, (greater(appear(efficient_producers,e),appear(first_movers,sk2))), inference(extension_rule, [i_0_24])). % 0.08/0.38 # End printing tableau % 0.08/0.38 # SZS output end % 0.08/0.38 # Branches closed with saturation will be marked with an "s" % 0.08/0.38 # Child (2635534) has found a proof. % 0.08/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------