TSTP Solution File: MGT032-2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : MGT032-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n012.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 : 300s
% DateTime : Wed May 29 17:29:24 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MGT032-2 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 26 10:26:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.5Y68Pgo6cw/cvc5---1.0.5_30968.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.5Y68Pgo6cw/cvc5---1.0.5_30968.smt2
% 0.20/0.52 (assume a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))))
% 0.20/0.52 (assume a1 (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))))
% 0.20/0.52 (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))))
% 0.20/0.52 (assume a3 (tptp.environment tptp.sk2))
% 0.20/0.52 (assume a4 (tptp.stable tptp.sk2))
% 0.20/0.52 (assume a5 (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))))
% 0.20/0.52 (assume a6 (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))))
% 0.20/0.52 (assume a7 (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))))
% 0.20/0.52 (step t1 (cl (not (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule or_pos)
% 0.20/0.52 (step t2 (cl (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule reordering :premises (t1))
% 0.20/0.52 (step t3 (cl (not (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))) :rule or_pos)
% 0.20/0.52 (step t4 (cl (not (tptp.environment tptp.sk2)) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (not (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule reordering :premises (t3))
% 0.20/0.52 (step t5 (cl (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule or_pos)
% 0.20/0.52 (step t6 (cl (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule reordering :premises (t5))
% 0.20/0.52 (step t7 (cl (not (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.20/0.52 (step t8 (cl (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)) (not (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))))) :rule reordering :premises (t7))
% 0.20/0.52 (step t9 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t10)
% 0.20/0.52 (assume t10.a0 (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))))
% 0.20/0.52 (step t10.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk2)))
% 0.20/0.52 (step t10.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) :rule or :premises (t10.t1))
% 0.20/0.52 (step t10.t3 (cl (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t10.t2 t10.a0))
% 0.20/0.52 (step t10 (cl (not (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t10.a0))
% 0.20/0.52 (step t11 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t9 t10))
% 0.20/0.52 (step t12 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) (not (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.20/0.52 (step t13 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t11 t12))
% 0.20/0.52 (step t14 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))))) :rule contraction :premises (t13))
% 0.20/0.52 (step t15 (cl (not (forall ((A $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (tptp.in_environment A (tptp.sk1 A))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) :rule implies :premises (t14))
% 0.20/0.52 (step t16 (cl (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t15 a1))
% 0.20/0.52 (step t17 (cl (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) :rule resolution :premises (t8 a3 a4 t16))
% 0.20/0.52 (step t18 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A)))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t19)
% 0.20/0.52 (assume t19.a0 (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))))
% 0.20/0.52 (step t19.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A)))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule forall_inst :args ((:= A (tptp.sk1 tptp.sk2))))
% 0.20/0.52 (step t19.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A)))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule or :premises (t19.t1))
% 0.20/0.52 (step t19.t3 (cl (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t19.t2 t19.a0))
% 0.20/0.52 (step t19 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A)))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule subproof :discharge (t19.a0))
% 0.20/0.52 (step t20 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t18 t19))
% 0.20/0.52 (step t21 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule implies_neg2)
% 0.20/0.52 (step t22 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule resolution :premises (t20 t21))
% 0.20/0.52 (step t23 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule contraction :premises (t22))
% 0.20/0.52 (step t24 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 A)))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule implies :premises (t23))
% 0.20/0.52 (step t25 (cl (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t24 a7))
% 0.20/0.52 (step t26 (cl (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t6 t17 t25))
% 0.20/0.52 (step t27 (cl (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) :rule or_pos)
% 0.20/0.52 (step t28 (cl (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))) (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule reordering :premises (t27))
% 0.20/0.52 (step t29 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t30)
% 0.20/0.52 (assume t30.a0 (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))))
% 0.20/0.52 (step t30.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule forall_inst :args ((:= A (tptp.sk1 tptp.sk2))))
% 0.20/0.52 (step t30.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule or :premises (t30.t1))
% 0.20/0.52 (step t30.t3 (cl (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t30.t2 t30.a0))
% 0.20/0.52 (step t30 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule subproof :discharge (t30.a0))
% 0.20/0.52 (step t31 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t29 t30))
% 0.20/0.52 (step t32 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule implies_neg2)
% 0.20/0.52 (step t33 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t31 t32))
% 0.20/0.52 (step t34 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule contraction :premises (t33))
% 0.20/0.52 (step t35 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 A))))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule implies :premises (t34))
% 0.20/0.52 (step t36 (cl (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t35 a5))
% 0.20/0.52 (step t37 (cl (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t28 t17 t36))
% 0.20/0.52 (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t39)
% 0.20/0.52 (assume t39.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))))
% 0.20/0.52 (step t39.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule forall_inst :args ((:= A tptp.sk2) (:= B tptp.first_movers) (:= C tptp.efficient_producers) (:= D (tptp.sk3 (tptp.sk1 tptp.sk2)))))
% 0.20/0.52 (step t39.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule or :premises (t39.t1))
% 0.20/0.52 (step t39.t3 (cl (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t39.t2 t39.a0))
% 0.20/0.52 (step t39 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule subproof :discharge (t39.a0))
% 0.20/0.52 (step t40 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t38 t39))
% 0.20/0.52 (step t41 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (not (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule implies_neg2)
% 0.20/0.52 (step t42 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t40 t41))
% 0.20/0.52 (step t43 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule contraction :premises (t42))
% 0.20/0.52 (step t44 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.environment A)) (not (tptp.subpopulations B C A D)) (not (tptp.greater (tptp.growth_rate C D) (tptp.growth_rate B D))) (tptp.selection_favors C B D)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule implies :premises (t43))
% 0.20/0.52 (step t45 (cl (or (not (tptp.environment tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) (tptp.selection_favors tptp.efficient_producers tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t44 a0))
% 0.20/0.52 (step t46 (cl (not (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t4 a3 t26 t37 t45))
% 0.20/0.52 (step t47 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t48)
% 0.20/0.52 (assume t48.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))))
% 0.20/0.52 (step t48.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule forall_inst :args ((:= A tptp.sk2) (:= B (tptp.sk3 (tptp.sk1 tptp.sk2)))))
% 0.20/0.52 (step t48.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule or :premises (t48.t1))
% 0.20/0.52 (step t48.t3 (cl (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t48.t2 t48.a0))
% 0.20/0.52 (step t48 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule subproof :discharge (t48.a0))
% 0.20/0.52 (step t49 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t47 t48))
% 0.20/0.52 (step t50 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (not (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule implies_neg2)
% 0.20/0.52 (step t51 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule resolution :premises (t49 t50))
% 0.20/0.52 (step t52 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B)))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2))))))) :rule contraction :premises (t51))
% 0.20/0.52 (step t53 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.environment A)) (not (tptp.stable A)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers A B)) (not (tptp.greater_or_equal B (tptp.sk1 A))) (tptp.greater (tptp.growth_rate tptp.efficient_producers B) (tptp.growth_rate tptp.first_movers B))))) (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule implies :premises (t52))
% 0.20/0.52 (step t54 (cl (or (not (tptp.environment tptp.sk2)) (not (tptp.stable tptp.sk2)) (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 (tptp.sk3 (tptp.sk1 tptp.sk2)))) (not (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) (tptp.greater (tptp.growth_rate tptp.efficient_producers (tptp.sk3 (tptp.sk1 tptp.sk2))) (tptp.growth_rate tptp.first_movers (tptp.sk3 (tptp.sk1 tptp.sk2)))))) :rule resolution :premises (t53 a2))
% 0.20/0.52 (step t55 (cl (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.20/0.52 (step t56 (cl (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)) (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))))) :rule reordering :premises (t55))
% 0.20/0.52 (step t57 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t58)
% 0.20/0.52 (assume t58.a0 (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))))
% 0.20/0.52 (step t58.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A (tptp.sk1 tptp.sk2))))
% 0.20/0.52 (step t58.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) :rule or :premises (t58.t1))
% 0.20/0.52 (step t58.t3 (cl (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t58.t2 t58.a0))
% 0.20/0.52 (step t58 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t58.a0))
% 0.20/0.52 (step t59 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t57 t58))
% 0.20/0.52 (step t60 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) (not (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.20/0.52 (step t61 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))))) :rule resolution :premises (t59 t60))
% 0.20/0.52 (step t62 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))))) :rule contraction :premises (t61))
% 0.20/0.52 (step t63 (cl (not (forall ((A $$unsorted)) (or (not (tptp.in_environment tptp.sk2 A)) (tptp.greater_or_equal (tptp.sk3 A) A)))) (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) :rule implies :premises (t62))
% 0.20/0.52 (step t64 (cl (or (not (tptp.in_environment tptp.sk2 (tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2)))) :rule resolution :premises (t63 a6))
% 0.20/0.52 (step t65 (cl (tptp.greater_or_equal (tptp.sk3 (tptp.sk1 tptp.sk2)) (tptp.sk1 tptp.sk2))) :rule resolution :premises (t56 t17 t64))
% 0.20/0.52 (step t66 (cl) :rule resolution :premises (t2 t46 t54 t65 t37 a4 a3))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.5Y68Pgo6cw/cvc5---1.0.5_30968.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------