%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWC128+1 : TPTP v9.2.1. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n014.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 Jun 3 08:58:10 AM UTC 2026 % Result : Theorem 0.44s 0.64s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWC128+1 : TPTP v9.2.1. Released v2.4.0. % 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n014.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 19:16:43 EDT 2026 % 0.17/0.34 % CPUTime : % 0.29/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.44/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.44/0.64 % SZS status Theorem % 0.44/0.64 % SZS output start Proof % 0.44/0.64 ( % 0.44/0.64 (declare-sort $$unsorted 0) % 0.44/0.64 (declare-const tptp.tl (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.hd (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.duplicatefreeP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.strictorderedP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.geq (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.strictorderP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.equalelemsP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.totalorderP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.neq (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.totalorderedP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.singletonP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.cons (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.app (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.nil $$unsorted) % 0.44/0.64 (declare-const tptp.memberP (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.lt (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.frontsegP (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.rearsegP (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.gt (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.ssList (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.segmentP (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.cyclefreeP (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.ssItem (-> $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (define @t1 () (@var "V" $$unsorted)) % 0.44/0.64 (define @t2 () (@var "U" $$unsorted)) % 0.44/0.64 (define @t3 () (= @t2 @t1)) % 0.44/0.64 (define @t4 () (not @t3)) % 0.44/0.64 (define @t5 () (= (tptp.neq @t2 @t1) @t4)) % 0.44/0.64 (define @t6 () (tptp.ssItem @t1)) % 0.44/0.64 (define @t7 () (@list @t1)) % 0.44/0.64 (define @t8 () (tptp.ssItem @t2)) % 0.44/0.64 (define @t9 () (@list @t2)) % 0.44/0.64 (define @t10 () (@var "X" $$unsorted)) % 0.44/0.64 (define @t11 () (tptp.cons @t1 @t10)) % 0.44/0.64 (define @t12 () (@var "W" $$unsorted)) % 0.44/0.64 (define @t13 () (tptp.ssList @t10)) % 0.44/0.64 (define @t14 () (@list @t10)) % 0.44/0.64 (define @t15 () (tptp.ssList @t12)) % 0.44/0.64 (define @t16 () (@list @t12)) % 0.44/0.64 (define @t17 () (tptp.ssList @t2)) % 0.44/0.64 (define @t18 () (tptp.cons @t1 tptp.nil)) % 0.44/0.64 (define @t19 () (tptp.app @t1 @t12)) % 0.44/0.64 (define @t20 () (tptp.frontsegP @t2 @t1)) % 0.44/0.64 (define @t21 () (tptp.ssList @t1)) % 0.44/0.64 (define @t22 () (tptp.app @t12 @t1)) % 0.44/0.64 (define @t23 () (tptp.rearsegP @t2 @t1)) % 0.44/0.64 (define @t24 () (tptp.segmentP @t2 @t1)) % 0.44/0.64 (define @t25 () (tptp.leq @t12 @t1)) % 0.44/0.64 (define @t26 () (tptp.leq @t1 @t12)) % 0.44/0.64 (define @t27 () (@var "Z" $$unsorted)) % 0.44/0.64 (define @t28 () (@var "Y" $$unsorted)) % 0.44/0.64 (define @t29 () (= (tptp.app (tptp.app @t10 (tptp.cons @t1 @t28)) (tptp.cons @t12 @t27)) @t2)) % 0.44/0.64 (define @t30 () (tptp.ssList @t27)) % 0.44/0.64 (define @t31 () (@list @t27)) % 0.44/0.64 (define @t32 () (tptp.ssList @t28)) % 0.44/0.64 (define @t33 () (@list @t28)) % 0.44/0.64 (define @t34 () (tptp.ssItem @t12)) % 0.44/0.64 (define @t35 () (tptp.lt @t1 @t12)) % 0.44/0.64 (define @t36 () (= @t1 @t12)) % 0.44/0.64 (define @t37 () (tptp.cons @t1 @t2)) % 0.44/0.64 (define @t38 () (= @t1 @t2)) % 0.44/0.64 (define @t39 () (tptp.cons @t12 @t1)) % 0.44/0.64 (define @t40 () (= tptp.nil @t2)) % 0.44/0.64 (define @t41 () (tptp.hd @t2)) % 0.44/0.64 (define @t42 () (not @t40)) % 0.44/0.64 (define @t43 () (tptp.tl @t2)) % 0.44/0.64 (define @t44 () (tptp.app @t2 @t1)) % 0.44/0.64 (define @t45 () (tptp.app @t1 @t2)) % 0.44/0.64 (define @t46 () (tptp.leq @t1 @t2)) % 0.44/0.64 (define @t47 () (tptp.leq @t2 @t1)) % 0.44/0.64 (define @t48 () (tptp.geq @t2 @t1)) % 0.44/0.64 (define @t49 () (tptp.lt @t1 @t2)) % 0.44/0.64 (define @t50 () (tptp.lt @t2 @t1)) % 0.44/0.64 (define @t51 () (tptp.lt @t2 @t12)) % 0.44/0.64 (define @t52 () (tptp.gt @t2 @t1)) % 0.44/0.64 (define @t53 () (tptp.memberP @t12 @t2)) % 0.44/0.64 (define @t54 () (tptp.app @t12 @t2)) % 0.44/0.64 (define @t55 () (tptp.cons @t2 tptp.nil)) % 0.44/0.64 (define @t56 () (tptp.hd @t1)) % 0.44/0.64 (define @t57 () (= tptp.nil @t1)) % 0.44/0.64 (define @t58 () (not @t57)) % 0.44/0.64 (define @t59 () (tptp.cons @t2 @t1)) % 0.44/0.64 (define @t60 () (= @t12 @t2)) % 0.44/0.64 (define @t61 () (not true)) % 0.44/0.64 (assume @p1 (forall @t9 (=> @t8 (forall @t7 (=> @t6 @t5))))) % 0.44/0.64 (assume @p2 (exists @t9 (and @t8 (exists @t7 (and @t6 @t4))))) % 0.44/0.64 (assume @p3 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (= (tptp.memberP @t2 @t1) (exists @t16 (and @t15 (exists @t14 (and @t13 (= (tptp.app @t12 @t11) @t2))))))))))) % 0.44/0.64 (assume @p4 (forall @t9 (=> @t17 (= (tptp.singletonP @t2) (exists @t7 (and @t6 (= @t18 @t2))))))) % 0.44/0.64 (assume @p5 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (= @t20 (exists @t16 (and @t15 (= @t19 @t2))))))))) % 0.44/0.64 (assume @p6 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (= @t23 (exists @t16 (and @t15 (= @t22 @t2))))))))) % 0.44/0.64 (assume @p7 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (= @t24 (exists @t16 (and @t15 (exists @t14 (and @t13 (= (tptp.app @t22 @t10) @t2))))))))))) % 0.44/0.64 (assume @p8 (forall @t9 (=> @t17 (= (tptp.cyclefreeP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (forall @t31 (=> @t30 (=> @t29 (not (and @t26 @t25))))))))))))))))) % 0.44/0.64 (assume @p9 (forall @t9 (=> @t17 (= (tptp.totalorderP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (forall @t31 (=> @t30 (=> @t29 (or @t26 @t25)))))))))))))))) % 0.44/0.64 (assume @p10 (forall @t9 (=> @t17 (= (tptp.strictorderP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (forall @t31 (=> @t30 (=> @t29 (or @t35 (tptp.lt @t12 @t1))))))))))))))))) % 0.44/0.64 (assume @p11 (forall @t9 (=> @t17 (= (tptp.totalorderedP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (forall @t31 (=> @t30 (=> @t29 @t26))))))))))))))) % 0.44/0.64 (assume @p12 (forall @t9 (=> @t17 (= (tptp.strictorderedP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (forall @t31 (=> @t30 (=> @t29 @t35))))))))))))))) % 0.44/0.64 (assume @p13 (forall @t9 (=> @t17 (= (tptp.duplicatefreeP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (forall @t31 (=> @t30 (=> @t29 (not @t36)))))))))))))))) % 0.44/0.64 (assume @p14 (forall @t9 (=> @t17 (= (tptp.equalelemsP @t2) (forall @t7 (=> @t6 (forall @t16 (=> @t34 (forall @t14 (=> @t13 (forall @t33 (=> @t32 (=> (= (tptp.app @t10 (tptp.cons @t1 (tptp.cons @t12 @t28))) @t2) @t36))))))))))))) % 0.44/0.64 (assume @p15 (forall @t9 (=> @t17 (forall @t7 (=> @t21 @t5))))) % 0.44/0.64 (assume @p16 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (tptp.ssList @t37)))))) % 0.44/0.64 (assume @p17 (tptp.ssList tptp.nil)) % 0.44/0.64 (assume @p18 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (not (= @t37 @t2))))))) % 0.44/0.64 (assume @p19 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t34 (forall @t14 (=> (tptp.ssItem @t10) (=> (= (tptp.cons @t12 @t2) (tptp.cons @t10 @t1)) (and (= @t12 @t10) @t38))))))))))) % 0.44/0.64 (assume @p20 (forall @t9 (=> @t17 (or @t40 (exists @t7 (and @t21 (exists @t16 (and @t34 (= @t39 @t2))))))))) % 0.44/0.64 (assume @p21 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (not (= tptp.nil @t37))))))) % 0.44/0.64 (assume @p22 (forall @t9 (=> @t17 (=> @t42 (tptp.ssItem @t41))))) % 0.44/0.64 (assume @p23 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (= (tptp.hd @t37) @t1)))))) % 0.44/0.64 (assume @p24 (forall @t9 (=> @t17 (=> @t42 (tptp.ssList @t43))))) % 0.44/0.64 (assume @p25 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (= (tptp.tl @t37) @t2)))))) % 0.44/0.64 (assume @p26 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (tptp.ssList @t44)))))) % 0.44/0.64 (assume @p27 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t34 (= (tptp.cons @t12 @t45) (tptp.app @t39 @t2))))))))) % 0.44/0.64 (assume @p28 (forall @t9 (=> @t17 (= (tptp.app tptp.nil @t2) @t2)))) % 0.44/0.64 (assume @p29 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (=> (and @t47 @t46) @t3)))))) % 0.44/0.64 (assume @p30 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t34 (=> (and @t47 @t26) (tptp.leq @t2 @t12))))))))) % 0.44/0.64 (assume @p31 (forall @t9 (=> @t8 (tptp.leq @t2 @t2)))) % 0.44/0.64 (assume @p32 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (= @t48 @t46)))))) % 0.44/0.64 (assume @p33 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (=> @t50 (not @t49))))))) % 0.44/0.64 (assume @p34 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t34 (=> (and @t50 @t35) @t51)))))))) % 0.44/0.64 (assume @p35 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (= @t52 @t49)))))) % 0.44/0.64 (assume @p36 (forall @t9 (=> @t8 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (= (tptp.memberP @t19 @t2) (or (tptp.memberP @t1 @t2) @t53))))))))) % 0.44/0.64 (assume @p37 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t15 (= (tptp.memberP (tptp.cons @t1 @t12) @t2) (or @t3 @t53))))))))) % 0.44/0.64 (assume @p38 (forall @t9 (=> @t8 (not (tptp.memberP tptp.nil @t2))))) % 0.44/0.64 (assume @p39 (not (tptp.singletonP tptp.nil))) % 0.44/0.64 (assume @p40 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> (and @t20 (tptp.frontsegP @t1 @t12)) (tptp.frontsegP @t2 @t12))))))))) % 0.44/0.64 (assume @p41 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (=> (and @t20 (tptp.frontsegP @t1 @t2)) @t3)))))) % 0.44/0.64 (assume @p42 (forall @t9 (=> @t17 (tptp.frontsegP @t2 @t2)))) % 0.44/0.64 (assume @p43 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> @t20 (tptp.frontsegP (tptp.app @t2 @t12) @t1))))))))) % 0.44/0.64 (assume @p44 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t15 (forall @t14 (=> @t13 (= (tptp.frontsegP (tptp.cons @t2 @t12) @t11) (and @t3 (tptp.frontsegP @t12 @t10)))))))))))) % 0.44/0.64 (assume @p45 (forall @t9 (=> @t17 (tptp.frontsegP @t2 tptp.nil)))) % 0.44/0.64 (assume @p46 (forall @t9 (=> @t17 (= (tptp.frontsegP tptp.nil @t2) @t40)))) % 0.44/0.64 (assume @p47 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> (and @t23 (tptp.rearsegP @t1 @t12)) (tptp.rearsegP @t2 @t12))))))))) % 0.44/0.64 (assume @p48 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (=> (and @t23 (tptp.rearsegP @t1 @t2)) @t3)))))) % 0.44/0.64 (assume @p49 (forall @t9 (=> @t17 (tptp.rearsegP @t2 @t2)))) % 0.44/0.64 (assume @p50 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> @t23 (tptp.rearsegP @t54 @t1))))))))) % 0.44/0.64 (assume @p51 (forall @t9 (=> @t17 (tptp.rearsegP @t2 tptp.nil)))) % 0.44/0.64 (assume @p52 (forall @t9 (=> @t17 (= (tptp.rearsegP tptp.nil @t2) @t40)))) % 0.44/0.64 (assume @p53 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> (and @t24 (tptp.segmentP @t1 @t12)) (tptp.segmentP @t2 @t12))))))))) % 0.44/0.64 (assume @p54 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (=> (and @t24 (tptp.segmentP @t1 @t2)) @t3)))))) % 0.44/0.64 (assume @p55 (forall @t9 (=> @t17 (tptp.segmentP @t2 @t2)))) % 0.44/0.64 (assume @p56 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (forall @t14 (=> @t13 (=> @t24 (tptp.segmentP (tptp.app @t54 @t10) @t1))))))))))) % 0.44/0.64 (assume @p57 (forall @t9 (=> @t17 (tptp.segmentP @t2 tptp.nil)))) % 0.44/0.64 (assume @p58 (forall @t9 (=> @t17 (= (tptp.segmentP tptp.nil @t2) @t40)))) % 0.44/0.64 (assume @p59 (forall @t9 (=> @t8 (tptp.cyclefreeP @t55)))) % 0.44/0.64 (assume @p60 (tptp.cyclefreeP tptp.nil)) % 0.44/0.64 (assume @p61 (forall @t9 (=> @t8 (tptp.totalorderP @t55)))) % 0.44/0.64 (assume @p62 (tptp.totalorderP tptp.nil)) % 0.44/0.64 (assume @p63 (forall @t9 (=> @t8 (tptp.strictorderP @t55)))) % 0.44/0.64 (assume @p64 (tptp.strictorderP tptp.nil)) % 0.44/0.64 (assume @p65 (forall @t9 (=> @t8 (tptp.totalorderedP @t55)))) % 0.44/0.64 (assume @p66 (tptp.totalorderedP tptp.nil)) % 0.44/0.64 (assume @p67 (forall @t9 (=> @t8 (forall @t7 (=> @t21 (= (tptp.totalorderedP @t59) (or @t57 (and @t58 (tptp.totalorderedP @t1) (tptp.leq @t2 @t56))))))))) % 0.44/0.64 (assume @p68 (forall @t9 (=> @t8 (tptp.strictorderedP @t55)))) % 0.44/0.64 (assume @p69 (tptp.strictorderedP tptp.nil)) % 0.44/0.64 (assume @p70 (forall @t9 (=> @t8 (forall @t7 (=> @t21 (= (tptp.strictorderedP @t59) (or @t57 (and @t58 (tptp.strictorderedP @t1) (tptp.lt @t2 @t56))))))))) % 0.44/0.64 (assume @p71 (forall @t9 (=> @t8 (tptp.duplicatefreeP @t55)))) % 0.44/0.64 (assume @p72 (tptp.duplicatefreeP tptp.nil)) % 0.44/0.64 (assume @p73 (forall @t9 (=> @t8 (tptp.equalelemsP @t55)))) % 0.44/0.64 (assume @p74 (tptp.equalelemsP tptp.nil)) % 0.44/0.64 (assume @p75 (forall @t9 (=> @t17 (=> @t42 (exists @t7 (and @t6 (= @t41 @t1))))))) % 0.44/0.64 (assume @p76 (forall @t9 (=> @t17 (=> @t42 (exists @t7 (and @t21 (= @t43 @t1))))))) % 0.44/0.64 (assume @p77 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (=> (and @t58 @t42 (= @t56 @t41) (= (tptp.tl @t1) @t43)) @t38)))))) % 0.44/0.64 (assume @p78 (forall @t9 (=> @t17 (=> @t42 (= (tptp.cons @t41 @t43) @t2))))) % 0.44/0.64 (assume @p79 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> (= @t22 @t44) @t60)))))))) % 0.44/0.64 (assume @p80 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (=> (= @t19 @t45) @t60)))))))) % 0.44/0.64 (assume @p81 (forall @t9 (=> @t17 (forall @t7 (=> @t6 (= @t37 (tptp.app @t18 @t2))))))) % 0.44/0.64 (assume @p82 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (forall @t16 (=> @t15 (= (tptp.app @t44 @t12) (tptp.app @t2 @t19))))))))) % 0.44/0.64 (assume @p83 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (= (= tptp.nil @t44) (and @t57 @t40))))))) % 0.44/0.64 (assume @p84 (forall @t9 (=> @t17 (= (tptp.app @t2 tptp.nil) @t2)))) % 0.44/0.64 (assume @p85 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (=> @t42 (= (tptp.hd @t44) @t41))))))) % 0.44/0.64 (assume @p86 (forall @t9 (=> @t17 (forall @t7 (=> @t21 (=> @t42 (= (tptp.tl @t44) (tptp.app @t43 @t1)))))))) % 0.44/0.64 (assume @p87 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (=> (and @t48 (tptp.geq @t1 @t2)) @t3)))))) % 0.44/0.64 (assume @p88 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t34 (=> (and @t48 (tptp.geq @t1 @t12)) (tptp.geq @t2 @t12))))))))) % 0.44/0.64 (assume @p89 (forall @t9 (=> @t8 (tptp.geq @t2 @t2)))) % 0.44/0.64 (assume @p90 (forall @t9 (=> @t8 (not (tptp.lt @t2 @t2))))) % 0.44/0.64 (assume @p91 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t34 (=> (and @t47 @t35) @t51)))))))) % 0.44/0.64 (assume @p92 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (=> @t47 (or @t3 @t50))))))) % 0.44/0.64 (assume @p93 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (= @t50 (and @t4 @t47))))))) % 0.44/0.64 (assume @p94 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (=> @t52 (not (tptp.gt @t1 @t2)))))))) % 0.44/0.64 (assume @p95 (forall @t9 (=> @t8 (forall @t7 (=> @t6 (forall @t16 (=> @t34 (=> (and @t52 (tptp.gt @t1 @t12)) (tptp.gt @t2 @t12))))))))) % 0.44/0.64 (assume @p96 @t61) % 0.44/0.64 (assume @p97 true) % 0.44/0.64 (step @p98 :rule evaluate :args (@t61)) % 0.44/0.64 (step @p99 false :rule eq_resolve :premises (@p96 @p98)) % 0.44/0.64 ) % 0.44/0.64 % SZS output end Proof % 0.44/0.64 % cvc5 exiting %------------------------------------------------------------------------------