%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT021+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 : n003.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:45 AM UTC 2026 % Result : Theorem 0.11s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT021+1 : TPTP v9.3.0. Released v2.0.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 : n003.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:03:24 UTC 2026 % 0.08/0.34 % CPUTime : % 0.11/0.35 # No SInE strategy applied % 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.35 # % 0.11/0.35 # Presaturation interreduction done % 0.11/0.35 # Number of axioms: 11 Number of unprocessed: 11 % 0.11/0.35 # Tableaux proof search. % 0.11/0.35 # APR header successfully linked. % 0.11/0.35 # Hello from C++ % 0.11/0.35 # The folding up rule is enabled... % 0.11/0.35 # Local unification is enabled... % 0.11/0.35 # Any saturation attempts will use folding labels... % 0.11/0.35 # 11 beginning clauses after preprocessing and clausification % 0.11/0.35 # Creating start rules for all 3 conjectures. % 0.11/0.35 # There are 3 start rule candidates: % 0.11/0.35 # Found 3 unit axioms. % 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.35 # 3 start rule tableaux created. % 0.11/0.35 # 8 extension rule candidate clauses % 0.11/0.35 # 3 unit axiom clauses % 0.11/0.35 % 0.11/0.35 # Requested 8, 32 cores available to the main process. % 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 3 % 0.11/0.35 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.11/0.35 # We now have 12 tableaux to operate on % 0.11/0.36 # Creating equality axioms % 0.11/0.36 # Ran out of tableaux, making start rules for all clauses % 0.11/0.36 # There were 1 total branch saturation attempts. % 0.11/0.36 # There were 0 of these attempts blocked. % 0.11/0.36 # There were 0 deferred branch saturation attempts. % 0.11/0.36 # There were 0 free duplicated saturations. % 0.11/0.36 # There were 1 total successful branch saturations. % 0.11/0.36 # There were 0 successful branch saturations in interreduction. % 0.11/0.36 # There were 0 successful branch saturations on the branch. % 0.11/0.36 # There were 1 successful branch saturations after the branch. % 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # Begin clausification derivation % 0.11/0.36 % 0.11/0.36 # End clausification derivation % 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.36 cnf(i_0_11, negated_conjecture, (environment(esk1_0))). % 0.11/0.36 cnf(i_0_10, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.11/0.36 cnf(i_0_9, negated_conjecture, (decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))))). % 0.11/0.36 cnf(i_0_3, plain, (~decreases(X1)|~increases(X1))). % 0.11/0.36 cnf(i_0_1, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_4, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.36 cnf(i_0_2, plain, (greater(number_of_organizations(X1,X2),zero)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_7, hypothesis, (~constant(resources(X1,X2))|~decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_6, hypothesis, (decreases(resources(X1,X2))|~greater(number_of_organizations(X1,X2),zero)|~greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_5, hypothesis, (constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_8, hypothesis, (increases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~decreases(resources(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.11/0.36 cnf(i_0_131, plain, (X18=X18)). % 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.36 # Begin printing tableau % 0.11/0.36 # Found 6 steps % 0.11/0.36 cnf(i_0_131, plain, (esk1_0=esk1_0), inference(start_rule)). % 0.11/0.36 cnf(i_0_180, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_135])). % 0.11/0.36 cnf(i_0_219, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_11])). % 0.11/0.36 cnf(i_0_217, plain, (environment(esk1_0)), inference(extension_rule, [i_0_1])). % 0.11/0.36 cnf(i_0_223, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_10])). % 0.11/0.36 cnf(i_0_222, plain, (in_environment(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_222, ...])). % 0.11/0.36 # End printing tableau % 0.11/0.36 # SZS output end % 0.11/0.36 # Branches closed with saturation will be marked with an "s" % 0.11/0.36 # There were 1 total branch saturation attempts. % 0.11/0.36 # There were 0 of these attempts blocked. % 0.11/0.36 # There were 0 deferred branch saturation attempts. % 0.11/0.36 # There were 0 free duplicated saturations. % 0.11/0.36 # There were 1 total successful branch saturations. % 0.11/0.36 # There were 0 successful branch saturations in interreduction. % 0.11/0.36 # There were 0 successful branch saturations on the branch. % 0.11/0.36 # There were 1 successful branch saturations after the branch. % 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # Begin clausification derivation % 0.11/0.36 % 0.11/0.36 # End clausification derivation % 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.36 cnf(i_0_11, negated_conjecture, (environment(esk1_0))). % 0.11/0.36 cnf(i_0_10, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.11/0.36 cnf(i_0_9, negated_conjecture, (decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))))). % 0.11/0.36 cnf(i_0_3, plain, (~decreases(X1)|~increases(X1))). % 0.11/0.36 cnf(i_0_1, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_4, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.11/0.36 cnf(i_0_2, plain, (greater(number_of_organizations(X1,X2),zero)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_7, hypothesis, (~constant(resources(X1,X2))|~decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_6, hypothesis, (decreases(resources(X1,X2))|~greater(number_of_organizations(X1,X2),zero)|~greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_5, hypothesis, (constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~environment(X1))). % 0.11/0.36 cnf(i_0_8, hypothesis, (increases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~decreases(resources(X2,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.36 # Begin printing tableau % 0.11/0.36 # Found 6 steps % 0.11/0.36 cnf(i_0_9, negated_conjecture, (decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))), inference(start_rule)). % 0.11/0.36 cnf(i_0_12, plain, (decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))), inference(extension_rule, [i_0_3])). % 0.11/0.36 cnf(i_0_16, plain, (~increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))), inference(extension_rule, [i_0_8])). % 0.11/0.36 cnf(i_0_158, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_10])). % 0.11/0.36 cnf(i_0_159, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_11])). % 0.11/0.36 cnf(i_0_157, plain, (~decreases(resources(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.11/0.36 # End printing tableau % 0.11/0.36 # SZS output end % 0.11/0.36 # Branches closed with saturation will be marked with an "s" % 0.11/0.36 # Creating equality axioms % 0.11/0.36 # Ran out of tableaux, making start rules for all clauses % 0.11/0.36 # Creating equality axioms % 0.11/0.36 # Ran out of tableaux, making start rules for all clauses % 0.11/0.36 # Child (71997) has found a proof. % 0.11/0.36 % 0.11/0.36 # Proof search is over... % 0.11/0.36 # Freeing feature tree %------------------------------------------------------------------------------