%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT020+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 : n017.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:44 AM UTC 2026 % Result : Theorem 0.12s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT020+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.35 % Computer : n017.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 11:55:39 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.12/0.37 # and selection function SelectUnlessUniqMax. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 14 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 3 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 11 extension rule candidate clauses % 0.12/0.37 # 3 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 10 tableaux to operate on % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (~greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))). % 0.12/0.38 cnf(i_0_5, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.38 cnf(i_0_9, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_6, plain, (greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_10, hypothesis, (greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_2, plain, (greater_or_equal(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_3, plain, (subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~in_environment(X1,initial_FM_EP(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_7, plain, (in_environment(X1,X2)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~in_environment(X1,X3)|~environment(X1))). % 0.12/0.38 cnf(i_0_1, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_11, 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.12/0.38 cnf(i_0_4, 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.12/0.38 cnf(i_0_138, plain, (X34=X34)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_138, plain, (esk1_0=esk1_0), inference(start_rule)). % 0.12/0.38 cnf(i_0_195, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_142])). % 0.12/0.38 cnf(i_0_245, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_243, plain, (environment(esk1_0)), inference(extension_rule, [i_0_5])). % 0.12/0.38 cnf(i_0_247, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_246, plain, (in_environment(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_246, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (~greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))). % 0.12/0.38 cnf(i_0_5, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.38 cnf(i_0_9, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_6, plain, (greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_10, hypothesis, (greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_2, plain, (greater_or_equal(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_3, plain, (subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~in_environment(X1,initial_FM_EP(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_7, plain, (in_environment(X1,X2)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~in_environment(X1,X3)|~environment(X1))). % 0.12/0.38 cnf(i_0_1, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_11, 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.12/0.38 cnf(i_0_4, 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.12/0.38 cnf(i_0_138, plain, (X34=X34)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_138, plain, (esk1_0=esk1_0), inference(start_rule)). % 0.12/0.38 cnf(i_0_195, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_142])). % 0.12/0.38 cnf(i_0_245, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_243, plain, (environment(esk1_0)), inference(extension_rule, [i_0_5])). % 0.12/0.38 cnf(i_0_247, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_246, plain, (in_environment(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_246, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (~greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))). % 0.12/0.38 cnf(i_0_5, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.38 cnf(i_0_9, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_6, plain, (greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_10, hypothesis, (greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_2, plain, (greater_or_equal(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_3, plain, (subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~in_environment(X1,initial_FM_EP(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_7, plain, (in_environment(X1,X2)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~in_environment(X1,X3)|~environment(X1))). % 0.12/0.38 cnf(i_0_1, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_11, 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.12/0.38 cnf(i_0_4, 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.12/0.38 cnf(i_0_138, plain, (X34=X34)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_138, plain, (esk1_0=esk1_0), inference(start_rule)). % 0.12/0.38 cnf(i_0_195, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_142])). % 0.12/0.38 cnf(i_0_245, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_243, plain, (environment(esk1_0)), inference(extension_rule, [i_0_5])). % 0.12/0.38 cnf(i_0_247, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_246, plain, (in_environment(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_246, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (~greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))). % 0.12/0.38 cnf(i_0_5, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.38 cnf(i_0_9, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_6, plain, (greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_10, hypothesis, (greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_2, plain, (greater_or_equal(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_3, plain, (subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~in_environment(X1,initial_FM_EP(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_7, plain, (in_environment(X1,X2)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~in_environment(X1,X3)|~environment(X1))). % 0.12/0.38 cnf(i_0_1, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_11, 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.12/0.38 cnf(i_0_4, 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.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_16, plain, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(extension_rule, [i_0_2])). % 0.12/0.38 cnf(i_0_73, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_71, plain, (greater_or_equal(esk2_0,initial_FM_EP(esk1_0))), inference(extension_rule, [i_0_9])). % 0.12/0.38 cnf(i_0_101, plain, (initial_FM_EP(esk1_0)=esk2_0), inference(etableau_closure_rule, [i_0_101, ...])). % 0.12/0.38 cnf(i_0_102, plain, (greater(esk2_0,initial_FM_EP(esk1_0))), inference(etableau_closure_rule, [i_0_102, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 3 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 3 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 3 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (~greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))). % 0.12/0.38 cnf(i_0_5, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.12/0.38 cnf(i_0_9, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_6, plain, (greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_10, hypothesis, (greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_2, plain, (greater_or_equal(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_3, plain, (subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~in_environment(X1,initial_FM_EP(X1))|~environment(X1))). % 0.12/0.38 cnf(i_0_7, plain, (in_environment(X1,X2)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~in_environment(X1,X3)|~environment(X1))). % 0.12/0.38 cnf(i_0_1, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.12/0.38 cnf(i_0_11, 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.12/0.38 cnf(i_0_4, 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.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 14 steps % 0.12/0.38 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_16, plain, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(extension_rule, [i_0_1])). % 0.12/0.38 cnf(i_0_84, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_82, plain, (~decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))), inference(extension_rule, [i_0_4])). % 0.12/0.38 cnf(i_0_131, plain, (greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_136, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_137, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_134, plain, (~greater_or_equal(esk2_0,esk2_0)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.12/0.38 cnf(i_0_133, plain, (~greater(disbanding_rate(first_movers,initial_FM_EP(esk1_0)),disbanding_rate(efficient_producers,initial_FM_EP(esk1_0)))), inference(extension_rule, [i_0_9])). % 0.12/0.38 cnf(i_0_135, plain, (~greater_or_equal(esk2_0,initial_FM_EP(esk1_0))), inference(extension_rule, [i_0_2])). % 0.12/0.38 cnf(i_0_204, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_205, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_190, plain, (disbanding_rate(efficient_producers,initial_FM_EP(esk1_0))=disbanding_rate(first_movers,initial_FM_EP(esk1_0))), inference(etableau_closure_rule, [i_0_190, ...])). % 0.12/0.38 cnf(i_0_192, plain, (~greater_or_equal(disbanding_rate(first_movers,initial_FM_EP(esk1_0)),disbanding_rate(efficient_producers,initial_FM_EP(esk1_0)))), inference(etableau_closure_rule, [i_0_192, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Child (1769828) has found a proof. % 0.12/0.39 % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------