%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWV237+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n020.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 09:00:47 AM UTC 2026 % Result : Theorem 2.12s 2.34s % Output : Proof 2.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SWV237+1 : TPTP v9.2.1. Released v3.2.0. % 0.12/0.14 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n020.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 19:59:56 EDT 2026 % 0.17/0.35 % CPUTime : % 0.28/0.51 %----Proving TF0_NAR, FOF, or CNF % 2.12/2.34 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 2.12/2.34 % SZS status Theorem % 2.12/2.34 % SZS output start Proof % 2.12/2.34 ( % 2.12/2.34 (declare-sort $$unsorted 0) % 2.12/2.34 (declare-const tptp.kk $$unsorted) % 2.12/2.34 (declare-const tptp.enc (-> $$unsorted $$unsorted $$unsorted)) % 2.12/2.34 (declare-const tptp.i (-> $$unsorted $$unsorted)) % 2.12/2.34 (declare-const tptp.a $$unsorted) % 2.12/2.34 (declare-const tptp.lp $$unsorted) % 2.12/2.34 (declare-const tptp.wk $$unsorted) % 2.12/2.34 (declare-const tptp.w $$unsorted) % 2.12/2.34 (declare-const tptp.tmk $$unsorted) % 2.12/2.34 (declare-const tptp.tc $$unsorted) % 2.12/2.34 (declare-const tptp.pp $$unsorted) % 2.12/2.34 (declare-const tptp.p (-> $$unsorted Bool)) % 2.12/2.34 (declare-const tptp.t1 $$unsorted) % 2.12/2.34 (declare-const tptp.t2 $$unsorted) % 2.12/2.34 (declare-const tptp.zcmk $$unsorted) % 2.12/2.34 (declare-const tptp.k $$unsorted) % 2.12/2.34 (define @t1 () (@var "V" $$unsorted)) % 2.12/2.34 (define @t2 () (@var "U" $$unsorted)) % 2.12/2.34 (define @t3 () (tptp.enc @t2 @t1)) % 2.12/2.34 (define @t4 () (tptp.i @t2)) % 2.12/2.34 (define @t5 () (@list @t2 @t1)) % 2.12/2.34 (define @t6 () (tptp.enc @t2 (tptp.enc @t4 @t1))) % 2.12/2.34 (define @t7 () (forall @t5 (= @t6 @t1))) % 2.12/2.34 (define @t8 () (tptp.i @t4)) % 2.12/2.34 (define @t9 () (@list @t2)) % 2.12/2.34 (define @t10 () (forall @t9 (= @t8 @t2))) % 2.12/2.34 (define @t11 () (tptp.p @t2)) % 2.12/2.34 (define @t12 () (tptp.i (tptp.enc (tptp.i tptp.zcmk) @t1))) % 2.12/2.34 (define @t13 () (@var "W" $$unsorted)) % 2.12/2.34 (define @t14 () (tptp.p @t13)) % 2.12/2.34 (define @t15 () (tptp.p @t1)) % 2.12/2.34 (define @t16 () (and @t11 @t15 @t14)) % 2.12/2.34 (define @t17 () (@list @t2 @t1 @t13)) % 2.12/2.34 (define @t18 () (tptp.i tptp.tmk)) % 2.12/2.34 (define @t19 () (tptp.enc @t18 @t2)) % 2.12/2.34 (define @t20 () (tptp.enc @t18 @t1)) % 2.12/2.34 (define @t21 () (tptp.i tptp.tc)) % 2.12/2.34 (define @t22 () (tptp.enc @t21 @t2)) % 2.12/2.34 (define @t23 () (tptp.p (tptp.enc @t20 @t22))) % 2.12/2.34 (define @t24 () (forall @t17 (=> @t16 @t23))) % 2.12/2.34 (define @t25 () (tptp.p (tptp.enc tptp.tc @t2))) % 2.12/2.34 (define @t26 () (forall @t17 (=> @t16 @t25))) % 2.12/2.34 (define @t27 () (tptp.i tptp.wk)) % 2.12/2.34 (define @t28 () (tptp.enc @t27 @t13)) % 2.12/2.34 (define @t29 () (tptp.enc @t27 @t1)) % 2.12/2.34 (define @t30 () (tptp.enc tptp.tmk tptp.pp)) % 2.12/2.34 (define @t31 () (tptp.p @t30)) % 2.12/2.34 (define @t32 () (tptp.p tptp.a)) % 2.12/2.34 (define @t33 () (tptp.enc (tptp.i @t18) tptp.pp)) % 2.12/2.34 (define @t34 () (tptp.p @t33)) % 2.12/2.34 (define @t35 () (not @t14)) % 2.12/2.34 (define @t36 () (forall (@list @t13) @t35)) % 2.12/2.34 (define @t37 () (@list false)) % 2.12/2.34 (define @t38 () (not @t15)) % 2.12/2.34 (define @t39 () (not @t11)) % 2.12/2.34 (define @t40 () (or @t39 @t38 @t23)) % 2.12/2.34 (define @t41 () (forall @t5 @t40)) % 2.12/2.34 (define @t42 () (or @t40 @t35)) % 2.12/2.34 (define @t43 () (or @t39 @t38 @t35 @t23)) % 2.12/2.34 (define @t44 () (or @t39 @t38 @t35)) % 2.12/2.34 (define @t45 () (not @t16)) % 2.12/2.34 (define @t46 () (@list true)) % 2.12/2.34 (define @t47 () (@list @t36)) % 2.12/2.34 (define @t48 () (tptp.i @t21)) % 2.12/2.34 (define @t49 () (tptp.enc @t48 tptp.a)) % 2.12/2.34 (define @t50 () (tptp.enc (tptp.enc @t18 @t33) (tptp.enc @t21 @t49))) % 2.12/2.34 (define @t51 () (tptp.p @t50)) % 2.12/2.34 (define @t52 () (not @t34)) % 2.12/2.34 (define @t53 () (tptp.p @t49)) % 2.12/2.34 (define @t54 () (not @t53)) % 2.12/2.34 (define @t55 () (or @t54 @t52 @t51)) % 2.12/2.34 (define @t56 () (forall (@list @t1) @t38)) % 2.12/2.34 (define @t57 () (or @t39 @t25)) % 2.12/2.34 (define @t58 () (forall @t9 @t57)) % 2.12/2.34 (define @t59 () (or @t57 @t38 @t35)) % 2.12/2.34 (define @t60 () (or @t39 @t38 @t35 @t25)) % 2.12/2.34 (define @t61 () (tptp.p (tptp.enc tptp.tc tptp.a))) % 2.12/2.34 (define @t62 () (not @t32)) % 2.12/2.34 (define @t63 () (or @t62 @t61)) % 2.12/2.34 (define @t64 () (@list false false)) % 2.12/2.34 (define @t65 () (= tptp.tc @t48)) % 2.12/2.34 (define @t66 () (and @t65 @t61)) % 2.12/2.34 (assume @p1 (forall @t5 (= (tptp.enc @t4 @t3) @t1))) % 2.12/2.34 (assume @p2 @t7) % 2.12/2.34 (assume @p3 @t10) % 2.12/2.34 (assume @p4 (forall @t9 (=> @t11 (tptp.p @t4)))) % 2.12/2.34 (assume @p5 (forall @t17 (=> @t16 (tptp.p (tptp.enc tptp.tmk (tptp.enc @t12 @t2)))))) % 2.12/2.34 (assume @p6 (forall @t17 (=> @t16 (tptp.p (tptp.enc @t12 @t19))))) % 2.12/2.34 (assume @p7 (forall @t17 (=> @t16 (tptp.p (tptp.enc tptp.wk @t19))))) % 2.12/2.34 (assume @p8 (forall @t17 (=> @t16 (tptp.p (tptp.enc @t20 @t19))))) % 2.12/2.34 (assume @p9 @t24) % 2.12/2.34 (assume @p10 @t26) % 2.12/2.34 (assume @p11 (forall @t17 (=> @t16 (tptp.p (tptp.enc @t22 @t1))))) % 2.12/2.34 (assume @p12 (forall @t17 (=> @t16 (tptp.p (tptp.enc (tptp.i @t22) @t1))))) % 2.12/2.34 (assume @p13 (forall @t17 (=> @t16 (tptp.p (tptp.enc @t28 (tptp.enc (tptp.i @t20) @t2)))))) % 2.12/2.34 (assume @p14 (forall @t17 (=> @t16 (tptp.p (tptp.enc @t28 (tptp.enc (tptp.i @t29) @t2)))))) % 2.12/2.34 (assume @p15 (forall @t17 (=> @t16 (tptp.p (tptp.enc @t29 (tptp.enc (tptp.i tptp.lp) @t2)))))) % 2.12/2.34 (assume @p16 (forall @t17 (=> @t16 (tptp.p @t3)))) % 2.12/2.34 (assume @p17 @t31) % 2.12/2.34 (assume @p18 (tptp.p (tptp.enc tptp.wk tptp.w))) % 2.12/2.34 (assume @p19 (tptp.p (tptp.enc tptp.w tptp.t1))) % 2.12/2.34 (assume @p20 (tptp.p (tptp.enc tptp.lp tptp.t2))) % 2.12/2.34 (assume @p21 (tptp.p (tptp.enc tptp.tc tptp.k))) % 2.12/2.34 (assume @p22 (tptp.p tptp.kk)) % 2.12/2.34 (assume @p23 (tptp.p (tptp.i tptp.kk))) % 2.12/2.34 (assume @p24 @t32) % 2.12/2.34 (assume @p25 (not (tptp.p (tptp.enc tptp.pp tptp.a)))) % 2.12/2.34 (assume @p26 true) % 2.12/2.34 (step @p27 :rule true_intro :premises (@p17)) % 2.12/2.34 (step @p28 :rule refl :args (tptp.pp)) % 2.12/2.34 (step @p29 :rule eq-symm :args (@t8 @t2)) % 2.12/2.34 (step @p30 :rule cong :premises (@p29) :args (@t10)) % 2.12/2.34 (step @p31 :rule eq_resolve :premises (@p3 @p30)) % 2.12/2.34 (step @p32 :rule instantiate :premises (@p31) :args ((@list tptp.tmk))) % 2.12/2.34 (step @p33 :rule symm :premises (@p32)) % 2.12/2.34 (step @p34 :rule cong :premises (@p33 @p28) :args (@t33)) % 2.12/2.34 (step @p35 :rule cong :premises (@p34) :args (@t34)) % 2.12/2.34 (step @p36 :rule trans :premises (@p35 @p27)) % 2.12/2.34 (step @p37 :rule true_elim :premises (@p36)) % 2.12/2.34 (assume-push @p138 @t36) % 2.12/2.34 (step @p39 :rule instantiate :premises (@p138) :args ((@list @t30))) % 2.12/2.34 (step-pop @p139 :rule scope :premises (@p39)) % 2.12/2.34 (step @p40 :rule process_scope :premises (@p139) :args ((not @t31))) % 2.12/2.34 (step @p42 :rule implies_elim :premises (@p40)) % 2.12/2.34 (step @p43 :rule chain_m_resolution :premises (@p42 @p17) :args ((not @t36) @t37 (@list @t31))) % 2.12/2.34 (step @p44 :rule quant-miniscope-or :args ((= (forall @t17 @t42) (or @t41 @t36)))) % 2.12/2.34 (step @p45 :rule aci_norm :args ((= @t43 @t42))) % 2.12/2.34 (step @p46 :rule cong :premises (@p45) :args ((forall @t17 @t43))) % 2.12/2.34 (step @p47 :rule trans :premises (@p46 @p44)) % 2.12/2.34 (step @p48 :rule aci_norm :args ((= (or @t44 @t23) @t43))) % 2.12/2.34 (step @p49 :rule refl :args (@t23)) % 2.12/2.34 (step @p50 :rule aci_norm :args ((= (or @t39 (or @t38 @t35)) @t44))) % 2.12/2.34 (step @p51 :rule bool-and-de-morgan :args (@t15 @t14 true)) % 2.12/2.34 (step @p52 :rule refl :args (@t39)) % 2.12/2.34 (step @p53 :rule nary_cong :premises (@p52 @p51) :args ((or @t39 (not (and @t15 @t14))))) % 2.12/2.34 (step @p54 :rule bool-and-de-morgan :args (@t11 @t15 (and @t14))) % 2.12/2.34 (step @p55 :rule trans :premises (@p54 @p53)) % 2.12/2.34 (step @p56 :rule trans :premises (@p55 @p50)) % 2.12/2.34 (step @p57 :rule nary_cong :premises (@p56 @p49) :args ((or @t45 @t23))) % 2.12/2.34 (step @p58 :rule trans :premises (@p57 @p48)) % 2.12/2.34 (step @p59 :rule bool-impl-elim :args (@t16 @t23)) % 2.12/2.34 (step @p60 :rule trans :premises (@p59 @p58)) % 2.12/2.34 (step @p61 :rule cong :premises (@p60) :args (@t24)) % 2.12/2.34 (step @p62 :rule trans :premises (@p61 @p47)) % 2.12/2.34 (step @p63 :rule eq_resolve :premises (@p9 @p62)) % 2.12/2.34 (step @p64 :rule reordering :premises (@p63) :args ((or @t36 @t41))) % 2.12/2.34 (step @p65 :rule chain_m_resolution :premises (@p64 @p43) :args (@t41 @t46 @t47)) % 2.12/2.34 (assume-push @p140 @t41) % 2.12/2.34 (step @p67 :rule instantiate :premises (@p140) :args ((@list @t49 @t33))) % 2.12/2.34 (step-pop @p141 :rule scope :premises (@p67)) % 2.12/2.34 (step @p68 :rule process_scope :premises (@p141) :args (@t55)) % 2.12/2.34 (step @p70 :rule implies_elim :premises (@p68)) % 2.12/2.34 (step @p71 :rule chain_m_resolution :premises (@p70 @p65) :args (@t55 @t37 (@list @t41))) % 2.12/2.34 (step @p72 :rule false_intro :premises (@p25)) % 2.12/2.34 (step @p73 :rule eq-symm :args (@t6 @t1)) % 2.12/2.34 (step @p74 :rule cong :premises (@p73) :args (@t7)) % 2.12/2.34 (step @p75 :rule eq_resolve :premises (@p2 @p74)) % 2.12/2.34 (step @p76 :rule instantiate :premises (@p75) :args ((@list @t21 tptp.a))) % 2.12/2.34 (step @p77 :rule symm :premises (@p76)) % 2.12/2.34 (step @p78 :rule instantiate :premises (@p75) :args ((@list @t18 tptp.pp))) % 2.12/2.34 (step @p79 :rule symm :premises (@p78)) % 2.12/2.34 (step @p80 :rule cong :premises (@p79 @p77) :args (@t50)) % 2.12/2.34 (step @p81 :rule cong :premises (@p80) :args (@t51)) % 2.12/2.34 (step @p82 :rule trans :premises (@p81 @p72)) % 2.12/2.34 (step @p83 :rule false_elim :premises (@p82)) % 2.12/2.34 (step @p84 :rule alpha_equiv :args (@t36 (@list @t13) (@list @t1))) % 2.12/2.34 (step @p85 :rule equiv_elim2 :premises (@p84)) % 2.12/2.34 (step @p86 :rule chain_m_resolution :premises (@p85 @p43) :args ((not @t56) @t46 @t47)) % 2.12/2.34 (step @p87 :rule quant-miniscope-or :args ((= (forall @t17 @t59) (or @t58 @t56 @t36)))) % 2.12/2.34 (step @p88 :rule aci_norm :args ((= @t60 @t59))) % 2.12/2.34 (step @p89 :rule cong :premises (@p88) :args ((forall @t17 @t60))) % 2.12/2.34 (step @p90 :rule trans :premises (@p89 @p87)) % 2.12/2.34 (step @p91 :rule aci_norm :args ((= (or @t44 @t25) @t60))) % 2.12/2.34 (step @p92 :rule refl :args (@t25)) % 2.12/2.35 (step @p93 :rule nary_cong :premises (@p56 @p92) :args ((or @t45 @t25))) % 2.12/2.35 (step @p94 :rule trans :premises (@p93 @p91)) % 2.12/2.35 (step @p95 :rule bool-impl-elim :args (@t16 @t25)) % 2.12/2.35 (step @p96 :rule trans :premises (@p95 @p94)) % 2.12/2.35 (step @p97 :rule cong :premises (@p96) :args (@t26)) % 2.12/2.35 (step @p98 :rule trans :premises (@p97 @p90)) % 2.12/2.35 (step @p99 :rule eq_resolve :premises (@p10 @p98)) % 2.12/2.35 (step @p100 :rule reordering :premises (@p99) :args ((or @t36 @t56 @t58))) % 2.12/2.35 (step @p101 :rule chain_m_resolution :premises (@p100 @p43 @p86) :args (@t58 (@list true true) (@list @t36 @t56))) % 2.12/2.35 (assume-push @p142 @t58) % 2.12/2.35 (step @p103 :rule instantiate :premises (@p142) :args ((@list tptp.a))) % 2.12/2.35 (step-pop @p143 :rule scope :premises (@p103)) % 2.12/2.35 (step @p104 :rule process_scope :premises (@p143) :args (@t63)) % 2.12/2.35 (step @p106 :rule implies_elim :premises (@p104)) % 2.12/2.35 (step @p107 :rule chain_m_resolution :premises (@p106 @p101) :args (@t63 @t37 (@list @t58))) % 2.12/2.35 (step @p108 :rule cnf_or_pos :args (@t63)) % 2.12/2.35 (step @p109 :rule reordering :premises (@p108) :args ((or @t62 @t61 (not @t63)))) % 2.12/2.35 (step @p110 :rule chain_m_resolution :premises (@p109 @p24 @p107) :args (@t61 @t64 (@list @t32 @t63))) % 2.12/2.35 (step @p111 :rule instantiate :premises (@p31) :args ((@list tptp.tc))) % 2.12/2.35 (assume-push @p144 @t65) % 2.12/2.35 (assume-push @p145 @t61) % 2.12/2.35 (assume-push @p146 @t61) % 2.12/2.35 (assume-push @p147 @t65) % 2.12/2.35 (step @p116 :rule true_intro :premises (@p145)) % 2.12/2.35 (step @p117 :rule refl :args (tptp.a)) % 2.12/2.35 (step @p118 :rule symm :premises (@p111)) % 2.12/2.35 (step @p119 :rule cong :premises (@p118 @p117) :args (@t49)) % 2.12/2.35 (step @p120 :rule cong :premises (@p119) :args (@t53)) % 2.12/2.35 (step @p121 :rule trans :premises (@p120 @p116)) % 2.12/2.35 (step @p122 :rule true_elim :premises (@p121)) % 2.12/2.35 (step-pop @p148 :rule scope :premises (@p122)) % 2.12/2.35 (step-pop @p149 :rule scope :premises (@p148)) % 2.12/2.35 (step @p123 :rule process_scope :premises (@p149) :args (@t53)) % 2.12/2.35 (step @p126 :rule and_intro :premises (@p145 @p111)) % 2.12/2.35 (step @p127 :rule modus_ponens :premises (@p126 @p123)) % 2.12/2.35 (step-pop @p150 :rule scope :premises (@p127)) % 2.12/2.35 (step-pop @p151 :rule scope :premises (@p150)) % 2.12/2.35 (step @p128 :rule process_scope :premises (@p151) :args (@t53)) % 2.12/2.35 (step @p131 :rule implies_elim :premises (@p128)) % 2.12/2.35 (step @p132 :rule cnf_and_neg :args (@t66)) % 2.12/2.35 (step @p133 :rule resolution :premises (@p132 @p131) :args (true @t66)) % 2.12/2.35 (step @p134 :rule chain_m_resolution :premises (@p133 @p111 @p110) :args (@t53 @t64 (@list @t65 @t61))) % 2.12/2.35 (step @p135 :rule cnf_or_pos :args (@t55)) % 2.12/2.35 (step @p136 :rule reordering :premises (@p135) :args ((or @t52 @t54 @t51 (not @t55)))) % 2.12/2.35 (step @p137 false :rule chain_m_resolution :premises (@p136 @p134 @p83 @p71 @p37) :args (false (@list false true false false) (@list @t53 @t51 @t55 @t34))) % 2.12/2.35 ) % 2.12/2.35 % SZS output end Proof % 2.12/2.35 % cvc5 exiting %------------------------------------------------------------------------------