%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT020-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 : n008.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.14s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT020-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.09/0.35 % Computer : n008.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 12:02:23 UTC 2026 % 0.09/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.14/0.39 # and selection function SelectUnlessUniqMax. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 14 Number of unprocessed: 14 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 14 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 3 conjectures. % 0.14/0.39 # There are 3 start rule candidates: % 0.14/0.39 # Found 3 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 3 start rule tableaux created. % 0.14/0.39 # 11 extension rule candidate clauses % 0.14/0.39 # 3 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 10 tableaux to operate on % 0.14/0.40 # There were 3 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 3 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 3 successful branch saturations after the branch. % 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_26, negated_conjecture, (environment(sk1))). % 0.14/0.40 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))). % 0.14/0.40 cnf(i_0_28, negated_conjecture, (~greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))). % 0.14/0.40 cnf(i_0_19, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.14/0.40 cnf(i_0_23, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.14/0.40 cnf(i_0_20, plain, (greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1))). % 0.14/0.40 cnf(i_0_24, hypothesis, (greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1))). % 0.14/0.40 cnf(i_0_22, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.14/0.40 cnf(i_0_17, plain, (greater_or_equal(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_16, plain, (subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~in_environment(X1,initial_FM_EP(X1))|~environment(X1))). % 0.14/0.40 cnf(i_0_21, plain, (in_environment(X1,X2)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~in_environment(X1,X3)|~environment(X1))). % 0.14/0.40 cnf(i_0_15, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_25, hypothesis, (subpopulations(first_movers,efficient_producers,X1,X2)|~greater_or_equal(X2,X3)|~greater_or_equal(X4,X2)|~subpopulations(first_movers,efficient_producers,X1,X4)|~subpopulations(first_movers,efficient_producers,X1,X3)|~environment(X1))). % 0.14/0.40 cnf(i_0_18, plain, (greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))|decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))|~greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))|~greater_or_equal(X1,X2)|~greater_or_equal(X2,X3)|~subpopulations(first_movers,efficient_producers,X4,X1)|~environment(X4))). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 14 steps % 0.14/0.40 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(start_rule)). % 0.14/0.40 cnf(i_0_30, plain, (subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(extension_rule, [i_0_15])). % 0.14/0.40 cnf(i_0_98, plain, (~environment(sk1)), inference(closure_rule, [i_0_26])). % 0.14/0.40 cnf(i_0_96, plain, (~decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))), inference(extension_rule, [i_0_18])). % 0.14/0.40 cnf(i_0_145, plain, (greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_150, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_27])). % 0.14/0.40 cnf(i_0_151, plain, (~environment(sk1)), inference(closure_rule, [i_0_26])). % 0.14/0.40 cnf(i_0_148, plain, (~greater_or_equal(sk2,sk2)), inference(etableau_closure_rule, [i_0_148, ...])). % 0.14/0.40 cnf(i_0_147, plain, (~greater(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1)))), inference(extension_rule, [i_0_23])). % 0.14/0.40 cnf(i_0_149, plain, (~greater_or_equal(sk2,initial_FM_EP(sk1))), inference(extension_rule, [i_0_17])). % 0.14/0.40 cnf(i_0_218, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_27])). % 0.14/0.40 cnf(i_0_219, plain, (~environment(sk1)), inference(closure_rule, [i_0_26])). % 0.14/0.40 cnf(i_0_204, plain, (disbanding_rate(efficient_producers,initial_FM_EP(sk1))=disbanding_rate(first_movers,initial_FM_EP(sk1))), inference(etableau_closure_rule, [i_0_204, ...])). % 0.14/0.40 cnf(i_0_206, plain, (~greater_or_equal(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1)))), inference(etableau_closure_rule, [i_0_206, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # Child (1333902) has found a proof. % 0.14/0.40 % 0.14/0.40 # Proof search is over... % 0.14/0.40 # Freeing feature tree %------------------------------------------------------------------------------