TSTP Solution File: MGT023-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT023-2 : TPTP v8.1.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 : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:10:27 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT023-2 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 09:50:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 17 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 3 conjectures.
% 0.12/0.36 # There are 3 start rule candidates:
% 0.12/0.36 # Found 3 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 3 start rule tableaux created.
% 0.12/0.36 # 14 extension rule candidate clauses
% 0.12/0.36 # 3 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.36 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 16 tableaux to operate on
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_32, negated_conjecture, (environment(sk5))).
% 0.12/0.37 cnf(i_0_33, negated_conjecture, (stable(sk5))).
% 0.12/0.37 cnf(i_0_34, negated_conjecture, (~in_environment(sk5,critical_point(sk5)))).
% 0.12/0.37 cnf(i_0_30, hypothesis, (in_environment(X1,sk4(X1))|~stable(X1)|~environment(X1))).
% 0.12/0.37 cnf(i_0_19, plain, (greater_or_equal(sk1(X1,X2),X1)|in_environment(X2,sk2(X2))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_28, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(sk3(X1,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_18, plain, (subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|in_environment(X1,sk2(X1))|~in_environment(X1,X2)|~environment(X1))).
% 0.12/0.37 cnf(i_0_24, plain, (in_environment(X1,sk2(X1))|~greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1)))|~in_environment(X1,X2)|~environment(X1))).
% 0.12/0.37 cnf(i_0_25, plain, (~greater(growth_rate(efficient_producers,sk1(X1,X2)),growth_rate(first_movers,sk1(X1,X2)))|~greater(growth_rate(efficient_producers,sk2(X2)),growth_rate(first_movers,sk2(X2)))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_22, plain, (greater_or_equal(sk1(X1,X2),X1)|~greater(growth_rate(efficient_producers,sk2(X2)),growth_rate(first_movers,sk2(X2)))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_31, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~greater_or_equal(X1,sk4(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_20, plain, (subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|~greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))|~in_environment(X1,X2)|~environment(X1))).
% 0.12/0.37 cnf(i_0_29, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(growth_rate(efficient_producers,sk3(X1,X2)),growth_rate(first_movers,sk3(X1,X2)))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_27, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk3(X1,X2))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_23, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater_or_equal(sk1(X2,X3),X2)|~greater(X1,sk2(X3))|~subpopulations(first_movers,efficient_producers,X3,X1)|~in_environment(X3,X2)|~environment(X3))).
% 0.12/0.37 cnf(i_0_26, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(growth_rate(efficient_producers,sk1(X2,X3)),growth_rate(first_movers,sk1(X2,X3)))|~greater(X1,sk2(X3))|~subpopulations(first_movers,efficient_producers,X3,X1)|~in_environment(X3,X2)|~environment(X3))).
% 0.12/0.37 cnf(i_0_21, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk1(X3,X2))|~greater(X1,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~environment(X2))).
% 0.12/0.37 cnf(i_0_363, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_363, plain, (sk5=sk5), inference(start_rule)).
% 0.12/0.37 cnf(i_0_447, plain, (sk5=sk5), inference(extension_rule, [i_0_367])).
% 0.12/0.37 cnf(i_0_522, plain, (~environment(sk5)), inference(closure_rule, [i_0_32])).
% 0.12/0.37 cnf(i_0_520, plain, (environment(sk5)), inference(extension_rule, [i_0_30])).
% 0.12/0.37 cnf(i_0_524, plain, (~stable(sk5)), inference(closure_rule, [i_0_33])).
% 0.12/0.37 cnf(i_0_523, plain, (in_environment(sk5,sk4(sk5))), inference(etableau_closure_rule, [i_0_523, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_32, negated_conjecture, (environment(sk5))).
% 0.12/0.37 cnf(i_0_33, negated_conjecture, (stable(sk5))).
% 0.12/0.37 cnf(i_0_34, negated_conjecture, (~in_environment(sk5,critical_point(sk5)))).
% 0.12/0.37 cnf(i_0_30, hypothesis, (in_environment(X1,sk4(X1))|~stable(X1)|~environment(X1))).
% 0.12/0.37 cnf(i_0_19, plain, (greater_or_equal(sk1(X1,X2),X1)|in_environment(X2,sk2(X2))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_28, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(sk3(X1,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_18, plain, (subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|in_environment(X1,sk2(X1))|~in_environment(X1,X2)|~environment(X1))).
% 0.12/0.37 cnf(i_0_24, plain, (in_environment(X1,sk2(X1))|~greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1)))|~in_environment(X1,X2)|~environment(X1))).
% 0.12/0.37 cnf(i_0_25, plain, (~greater(growth_rate(efficient_producers,sk1(X1,X2)),growth_rate(first_movers,sk1(X1,X2)))|~greater(growth_rate(efficient_producers,sk2(X2)),growth_rate(first_movers,sk2(X2)))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_22, plain, (greater_or_equal(sk1(X1,X2),X1)|~greater(growth_rate(efficient_producers,sk2(X2)),growth_rate(first_movers,sk2(X2)))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_31, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~greater_or_equal(X1,sk4(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_20, plain, (subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|~greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))|~in_environment(X1,X2)|~environment(X1))).
% 0.12/0.37 cnf(i_0_29, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(growth_rate(efficient_producers,sk3(X1,X2)),growth_rate(first_movers,sk3(X1,X2)))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_27, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk3(X1,X2))|~in_environment(X2,X1)|~environment(X2))).
% 0.12/0.37 cnf(i_0_23, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater_or_equal(sk1(X2,X3),X2)|~greater(X1,sk2(X3))|~subpopulations(first_movers,efficient_producers,X3,X1)|~in_environment(X3,X2)|~environment(X3))).
% 0.12/0.37 cnf(i_0_26, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(growth_rate(efficient_producers,sk1(X2,X3)),growth_rate(first_movers,sk1(X2,X3)))|~greater(X1,sk2(X3))|~subpopulations(first_movers,efficient_producers,X3,X1)|~in_environment(X3,X2)|~environment(X3))).
% 0.12/0.37 cnf(i_0_21, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk1(X3,X2))|~greater(X1,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~environment(X2))).
% 0.12/0.37 cnf(i_0_363, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_363, plain, (sk5=sk5), inference(start_rule)).
% 0.12/0.37 cnf(i_0_447, plain, (sk5=sk5), inference(extension_rule, [i_0_367])).
% 0.12/0.37 cnf(i_0_522, plain, (~environment(sk5)), inference(closure_rule, [i_0_32])).
% 0.12/0.37 cnf(i_0_520, plain, (environment(sk5)), inference(extension_rule, [i_0_30])).
% 0.12/0.37 cnf(i_0_524, plain, (~stable(sk5)), inference(closure_rule, [i_0_33])).
% 0.12/0.37 cnf(i_0_523, plain, (in_environment(sk5,sk4(sk5))), inference(etableau_closure_rule, [i_0_523, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (10082) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------