TSTP Solution File: MGT016-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : MGT016-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% 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 : 300s
% DateTime : Wed May 29 17:29:18 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : Proof 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : MGT016-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 10:21:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.KRcFgW48YH/cvc5---1.0.5_2056.smt2
% 0.21/0.53 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.KRcFgW48YH/cvc5---1.0.5_2056.smt2
% 0.36/0.53 (assume a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))))
% 0.36/0.53 (assume a1 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))))
% 0.36/0.53 (assume a2 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))))
% 0.36/0.53 (assume a3 (tptp.organization tptp.sk2 tptp.sk8))
% 0.36/0.53 (assume a4 (tptp.organization tptp.sk3 tptp.sk8))
% 0.36/0.53 (assume a5 (not (tptp.organization tptp.sk3 tptp.sk10)))
% 0.36/0.53 (assume a6 (tptp.class tptp.sk2 tptp.sk5 tptp.sk8))
% 0.36/0.53 (assume a7 (tptp.class tptp.sk3 tptp.sk5 tptp.sk8))
% 0.36/0.53 (assume a8 (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9))
% 0.36/0.53 (assume a9 (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10))
% 0.36/0.53 (assume a10 (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8))
% 0.36/0.53 (assume a11 (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8))
% 0.36/0.53 (assume a12 (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8))
% 0.36/0.53 (assume a13 (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8))
% 0.36/0.53 (assume a14 (tptp.greater tptp.sk7 tptp.sk6))
% 0.36/0.53 (assume a15 (not (tptp.greater tptp.sk9 tptp.sk10)))
% 0.36/0.53 (step t1 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H)))) :rule implies_neg1)
% 0.36/0.53 (anchor :step t2)
% 0.36/0.53 (assume t2.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))))
% 0.36/0.53 (step t2.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk2) (:= B tptp.sk8) (:= C tptp.sk3) (:= D tptp.sk8) (:= E tptp.sk5) (:= F tptp.sk6) (:= G tptp.sk7) (:= H (tptp.sk1 tptp.sk8 tptp.sk2)) (:= I (tptp.sk1 tptp.sk8 tptp.sk3))))
% 0.36/0.53 (step t2.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) :rule or :premises (t2.t1))
% 0.36/0.53 (step t2.t3 (cl (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.36/0.53 (step t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) :rule subproof :discharge (t2.a0))
% 0.36/0.53 (step t3 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) :rule resolution :premises (t1 t2))
% 0.36/0.53 (step t4 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))))) :rule implies_neg2)
% 0.36/0.53 (step t5 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))))) :rule resolution :premises (t3 t4))
% 0.36/0.53 (step t6 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))))) :rule contraction :premises (t5))
% 0.36/0.53 (step t7 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E D)) (not (tptp.complexity A F B)) (not (tptp.complexity C G D)) (not (tptp.inertia A H B)) (not (tptp.inertia C I D)) (not (tptp.greater G F)) (tptp.greater I H)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) :rule implies :premises (t6))
% 0.36/0.53 (step t8 (cl (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) :rule or_pos)
% 0.36/0.53 (step t9 (cl (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)) (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))))) :rule reordering :premises (t8))
% 0.36/0.53 (step t10 (cl (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) :rule or_pos)
% 0.36/0.53 (step t11 (cl (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8) (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)))) :rule reordering :premises (t10))
% 0.36/0.53 (step t12 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) :rule implies_neg1)
% 0.36/0.53 (anchor :step t13)
% 0.36/0.53 (assume t13.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))))
% 0.36/0.53 (step t13.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)))) :rule forall_inst :args ((:= A tptp.sk2) (:= B tptp.sk8)))
% 0.36/0.53 (step t13.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) :rule or :premises (t13.t1))
% 0.36/0.53 (step t13.t3 (cl (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) :rule resolution :premises (t13.t2 t13.a0))
% 0.36/0.53 (step t13 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) :rule subproof :discharge (t13.a0))
% 0.36/0.53 (step t14 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) :rule resolution :premises (t12 t13))
% 0.36/0.53 (step t15 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)))) :rule implies_neg2)
% 0.36/0.53 (step t16 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)))) :rule resolution :premises (t14 t15))
% 0.36/0.53 (step t17 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)))) :rule contraction :premises (t16))
% 0.36/0.53 (step t18 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) :rule implies :premises (t17))
% 0.36/0.53 (step t19 (cl (or (not (tptp.organization tptp.sk2 tptp.sk8)) (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8))) :rule resolution :premises (t18 a0))
% 0.36/0.53 (step t20 (cl (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) :rule resolution :premises (t11 a3 t19))
% 0.36/0.53 (step t21 (cl (not (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) :rule or_pos)
% 0.36/0.53 (step t22 (cl (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8) (not (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)))) :rule reordering :premises (t21))
% 0.36/0.53 (step t23 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) :rule implies_neg1)
% 0.36/0.53 (anchor :step t24)
% 0.36/0.53 (assume t24.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))))
% 0.36/0.53 (step t24.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)))) :rule forall_inst :args ((:= A tptp.sk3) (:= B tptp.sk8)))
% 0.36/0.53 (step t24.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) :rule or :premises (t24.t1))
% 0.36/0.53 (step t24.t3 (cl (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) :rule resolution :premises (t24.t2 t24.a0))
% 0.36/0.53 (step t24 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) :rule subproof :discharge (t24.a0))
% 0.36/0.53 (step t25 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) :rule resolution :premises (t23 t24))
% 0.36/0.53 (step t26 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) (not (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)))) :rule implies_neg2)
% 0.36/0.53 (step t27 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)))) :rule resolution :premises (t25 t26))
% 0.36/0.53 (step t28 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)))) :rule contraction :premises (t27))
% 0.36/0.53 (step t29 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.inertia A (tptp.sk1 B A) B)))) (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) :rule implies :premises (t28))
% 0.36/0.53 (step t30 (cl (or (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8))) :rule resolution :premises (t29 a0))
% 0.36/0.53 (step t31 (cl (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) :rule resolution :premises (t22 a4 t30))
% 0.36/0.53 (step t32 (cl (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10)) :rule or_pos)
% 0.36/0.53 (step t33 (cl (tptp.organization tptp.sk3 tptp.sk10) (tptp.greater tptp.sk9 tptp.sk10) (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10)))) :rule reordering :premises (t32))
% 0.36/0.53 (step t34 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D)))) :rule implies_neg1)
% 0.36/0.53 (anchor :step t35)
% 0.36/0.53 (assume t35.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))))
% 0.36/0.53 (step t35.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10)))) :rule forall_inst :args ((:= A tptp.sk2) (:= B tptp.sk8) (:= C tptp.sk3) (:= D tptp.sk10) (:= E tptp.sk5) (:= F tptp.sk9) (:= G tptp.sk4) (:= H (tptp.sk1 tptp.sk8 tptp.sk2)) (:= I (tptp.sk1 tptp.sk8 tptp.sk3))))
% 0.36/0.53 (step t35.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) :rule or :premises (t35.t1))
% 0.36/0.53 (step t35.t3 (cl (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) :rule resolution :premises (t35.t2 t35.a0))
% 0.36/0.53 (step t35 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) :rule subproof :discharge (t35.a0))
% 0.36/0.53 (step t36 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) :rule resolution :premises (t34 t35))
% 0.36/0.53 (step t37 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10)))) :rule implies_neg2)
% 0.36/0.53 (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10)))) :rule resolution :premises (t36 t37))
% 0.36/0.53 (step t39 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10)))) :rule contraction :premises (t38))
% 0.36/0.53 (step t40 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (tptp.organization C D) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.inertia A H B)) (not (tptp.inertia C I B)) (not (tptp.greater I H)) (tptp.greater F D)))) (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) :rule implies :premises (t39))
% 0.36/0.53 (step t41 (cl (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (tptp.organization tptp.sk3 tptp.sk10) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.reorganization tptp.sk2 tptp.sk8 tptp.sk9)) (not (tptp.reorganization tptp.sk3 tptp.sk8 tptp.sk10)) (not (tptp.reorganization_type tptp.sk2 tptp.sk4 tptp.sk8)) (not (tptp.reorganization_type tptp.sk3 tptp.sk4 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))) (tptp.greater tptp.sk9 tptp.sk10))) :rule resolution :premises (t40 a2))
% 0.36/0.53 (step t42 (cl (not (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2)))) :rule resolution :premises (t33 a5 a15 a3 a4 a6 a7 a8 a9 a10 a11 t20 t31 t41))
% 0.36/0.53 (step t43 (cl (not (or (not (tptp.organization tptp.sk2 tptp.sk8)) (not (tptp.organization tptp.sk3 tptp.sk8)) (not (tptp.class tptp.sk2 tptp.sk5 tptp.sk8)) (not (tptp.class tptp.sk3 tptp.sk5 tptp.sk8)) (not (tptp.complexity tptp.sk2 tptp.sk6 tptp.sk8)) (not (tptp.complexity tptp.sk3 tptp.sk7 tptp.sk8)) (not (tptp.inertia tptp.sk2 (tptp.sk1 tptp.sk8 tptp.sk2) tptp.sk8)) (not (tptp.inertia tptp.sk3 (tptp.sk1 tptp.sk8 tptp.sk3) tptp.sk8)) (not (tptp.greater tptp.sk7 tptp.sk6)) (tptp.greater (tptp.sk1 tptp.sk8 tptp.sk3) (tptp.sk1 tptp.sk8 tptp.sk2))))) :rule resolution :premises (t9 a3 a4 a6 a7 a12 a13 a14 t20 t31 t42))
% 0.36/0.53 (step t44 (cl) :rule resolution :premises (t7 t43 a1))
% 0.36/0.53
% 0.36/0.53 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.KRcFgW48YH/cvc5---1.0.5_2056.smt2
% 0.36/0.54 % cvc5---1.0.5 exiting
% 0.36/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------