%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT022-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 : n027.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 : Unsatisfiable 0.10s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT022-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 : n027.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:08:30 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.39 # No SInE strategy applied % 0.10/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.39 # % 0.10/0.39 # Presaturation interreduction done % 0.10/0.39 # Number of axioms: 10 Number of unprocessed: 10 % 0.10/0.39 # Tableaux proof search. % 0.10/0.39 # APR header successfully linked. % 0.10/0.39 # Hello from C++ % 0.10/0.39 # The folding up rule is enabled... % 0.10/0.39 # Local unification is enabled... % 0.10/0.39 # Any saturation attempts will use folding labels... % 0.10/0.39 # 10 beginning clauses after preprocessing and clausification % 0.10/0.39 # Creating start rules for all 6 conjectures. % 0.10/0.39 # There are 6 start rule candidates: % 0.10/0.39 # Found 3 unit axioms. % 0.10/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.39 # 6 start rule tableaux created. % 0.10/0.39 # 7 extension rule candidate clauses % 0.10/0.39 # 3 unit axiom clauses % 0.10/0.39 % 0.10/0.39 # Requested 8, 32 cores available to the main process. % 0.10/0.39 # There are not enough tableaux to fork, creating more from the initial 6 % 0.10/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.10/0.39 # We now have 11 tableaux to operate on % 0.10/0.40 # There were 2 total branch saturation attempts. % 0.10/0.40 # There were 0 of these attempts blocked. % 0.10/0.40 # There were 0 deferred branch saturation attempts. % 0.10/0.40 # There were 0 free duplicated saturations. % 0.10/0.40 # There were 2 total successful branch saturations. % 0.10/0.40 # There were 0 successful branch saturations in interreduction. % 0.10/0.40 # There were 0 successful branch saturations on the branch. % 0.10/0.40 # There were 2 successful branch saturations after the branch. % 0.10/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # Begin clausification derivation % 0.10/0.40 % 0.10/0.40 # End clausification derivation % 0.10/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.40 cnf(i_0_15, negated_conjecture, (environment(sk1))). % 0.10/0.40 cnf(i_0_16, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))). % 0.10/0.40 cnf(i_0_14, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.10/0.40 cnf(i_0_17, negated_conjecture, (decreases(resources(sk1,sk2))|constant(resources(sk1,sk2)))). % 0.10/0.40 cnf(i_0_19, negated_conjecture, (constant(resources(sk1,sk2))|~increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))))). % 0.10/0.40 cnf(i_0_20, negated_conjecture, (decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))|~increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))))). % 0.10/0.40 cnf(i_0_11, plain, (~decreases(X1)|~constant(X1))). % 0.10/0.40 cnf(i_0_18, negated_conjecture, (decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))|decreases(resources(sk1,sk2)))). % 0.10/0.40 cnf(i_0_13, hypothesis, (constant(difference(disbanding_rate(X1,X2),disbanding_rate(X3,X2)))|~greater(resilience(X3),resilience(X1))|~subpopulations(X1,X3,X4,X2)|~environment(X4)|~constant(resources(X4,X2)))). % 0.10/0.40 cnf(i_0_12, hypothesis, (increases(difference(disbanding_rate(X1,X2),disbanding_rate(X3,X2)))|~greater(resilience(X3),resilience(X1))|~subpopulations(X1,X3,X4,X2)|~environment(X4)|~decreases(resources(X4,X2)))). % 0.10/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.40 # Begin printing tableau % 0.10/0.40 # Found 8 steps % 0.10/0.40 cnf(i_0_19, negated_conjecture, (constant(resources(sk1,sk2))|~increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))), inference(start_rule)). % 0.10/0.40 cnf(i_0_26, plain, (~increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))), inference(extension_rule, [i_0_12])). % 0.10/0.40 cnf(i_0_139, plain, (~greater(resilience(efficient_producers),resilience(first_movers))), inference(closure_rule, [i_0_14])). % 0.10/0.40 cnf(i_0_140, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_16])). % 0.10/0.40 cnf(i_0_141, plain, (~environment(sk1)), inference(closure_rule, [i_0_15])). % 0.10/0.40 cnf(i_0_142, plain, (~decreases(resources(sk1,sk2))), inference(extension_rule, [i_0_18])). % 0.10/0.40 cnf(i_0_25, plain, (constant(resources(sk1,sk2))), inference(etableau_closure_rule, [i_0_25, ...])). % 0.10/0.40 cnf(i_0_163, plain, (decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))), inference(etableau_closure_rule, [i_0_163, ...])). % 0.10/0.40 # End printing tableau % 0.10/0.40 # SZS output end % 0.10/0.40 # Branches closed with saturation will be marked with an "s" % 0.10/0.40 # Child (2930374) has found a proof. % 0.10/0.40 % 0.10/0.40 # Proof search is over... % 0.10/0.40 # Freeing feature tree %------------------------------------------------------------------------------