%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : PLA022-1 : TPTP v9.2.1. Released v1.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n005.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:43:25 AM UTC 2026 % Result : Unsatisfiable 203.15s 203.46s % Output : Proof 203.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PLA022-1 : TPTP v9.2.1. Released v1.1.0. % 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n005.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 12:57:03 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 15.32/15.59 --- Run --no-e-matching --full-saturate-quant at 6... % 21.43/21.63 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 6... % 27.43/27.66 --- Run --finite-model-find --uf-ss=no-minimal at 6... % 33.53/33.73 --- Run --multi-trigger-when-single --full-saturate-quant at 30... % 63.60/63.86 --- Run --trigger-sel=max --full-saturate-quant at 15... % 78.61/78.89 --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 33... % 111.69/112.02 --- Run --multi-trigger-cache --full-saturate-quant at 15... % 127.10/127.39 --- Run --prenex-quant=none --full-saturate-quant at 30... % 157.28/157.52 --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 15... % 172.26/172.59 --- Run --relevant-triggers --full-saturate-quant at 30... % 202.47/202.71 --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 15... % 203.15/203.46 % SZS status Unsatisfiable % 203.15/203.46 % SZS output start Proof % 203.15/203.47 ( % 203.15/203.47 (declare-sort $$unsorted 0) % 203.15/203.47 (declare-const tptp.s0 $$unsorted) % 203.15/203.47 (declare-const tptp.d $$unsorted) % 203.15/203.47 (declare-const tptp.c $$unsorted) % 203.15/203.47 (declare-const tptp.clear (-> $$unsorted $$unsorted)) % 203.15/203.47 (declare-const tptp.putdown (-> $$unsorted $$unsorted $$unsorted)) % 203.15/203.47 (declare-const tptp.b $$unsorted) % 203.15/203.47 (declare-const tptp.and (-> $$unsorted $$unsorted $$unsorted)) % 203.15/203.47 (declare-const tptp.do (-> $$unsorted $$unsorted $$unsorted)) % 203.15/203.47 (declare-const tptp.table $$unsorted) % 203.15/203.47 (declare-const tptp.differ (-> $$unsorted $$unsorted Bool)) % 203.15/203.47 (declare-const tptp.empty $$unsorted) % 203.15/203.47 (declare-const tptp.a $$unsorted) % 203.15/203.47 (declare-const tptp.pickup (-> $$unsorted $$unsorted)) % 203.15/203.47 (declare-const tptp.holding (-> $$unsorted $$unsorted)) % 203.15/203.47 (declare-const tptp.holds (-> $$unsorted $$unsorted Bool)) % 203.15/203.47 (declare-const tptp.on (-> $$unsorted $$unsorted $$unsorted)) % 203.15/203.47 (define @t1 () (@var "State" $$unsorted)) % 203.15/203.47 (define @t2 () (@var "Y" $$unsorted)) % 203.15/203.47 (define @t3 () (@var "X" $$unsorted)) % 203.15/203.47 (define @t4 () (tptp.and @t3 @t2)) % 203.15/203.47 (define @t5 () (@list @t3 @t2 @t1)) % 203.15/203.47 (define @t6 () (forall @t5 (or (tptp.holds @t4 @t1) (not (tptp.holds @t3 @t1)) (not (tptp.holds @t2 @t1))))) % 203.15/203.47 (define @t7 () (tptp.clear @t3)) % 203.15/203.47 (define @t8 () (not (tptp.holds @t7 @t1))) % 203.15/203.47 (define @t9 () (not (tptp.holds tptp.empty @t1))) % 203.15/203.47 (define @t10 () (tptp.do (tptp.pickup @t3) @t1)) % 203.15/203.47 (define @t11 () (tptp.holding @t3)) % 203.15/203.47 (define @t12 () (forall (@list @t3 @t1) (or (tptp.holds @t11 @t10) @t9 @t8 (not (tptp.differ @t3 tptp.table))))) % 203.15/203.47 (define @t13 () (tptp.on @t3 @t2)) % 203.15/203.47 (define @t14 () (not (tptp.holds @t13 @t1))) % 203.15/203.47 (define @t15 () (tptp.clear @t2)) % 203.15/203.47 (define @t16 () (@var "Z" $$unsorted)) % 203.15/203.47 (define @t17 () (not (tptp.differ @t3 @t16))) % 203.15/203.47 (define @t18 () (tptp.do (tptp.pickup @t16) @t1)) % 203.15/203.47 (define @t19 () (forall (@list @t3 @t2 @t16 @t1) (or (tptp.holds @t13 @t18) @t14 @t17))) % 203.15/203.47 (define @t20 () (forall (@list @t3 @t16 @t1) (or (tptp.holds @t7 @t18) @t8 @t17))) % 203.15/203.47 (define @t21 () (not (tptp.holds @t15 @t1))) % 203.15/203.47 (define @t22 () (not (tptp.holds @t11 @t1))) % 203.15/203.47 (define @t23 () (tptp.do (tptp.putdown @t3 @t2) @t1)) % 203.15/203.47 (define @t24 () (forall @t5 (or (tptp.holds @t13 @t23) @t22 @t21))) % 203.15/203.47 (define @t25 () (@var "W" $$unsorted)) % 203.15/203.47 (define @t26 () (forall (@list @t3 @t2 @t16 @t25 @t1) (or (tptp.holds @t13 (tptp.do (tptp.putdown @t16 @t25) @t1)) @t14))) % 203.15/203.47 (define @t27 () (tptp.clear @t16)) % 203.15/203.47 (define @t28 () (forall (@list @t3 @t2) (or (tptp.differ @t3 @t2) (not (tptp.differ @t2 @t3))))) % 203.15/203.47 (define @t29 () (tptp.differ tptp.a tptp.c)) % 203.15/203.47 (define @t30 () (tptp.differ tptp.a tptp.table)) % 203.15/203.47 (define @t31 () (tptp.on tptp.c tptp.d)) % 203.15/203.47 (define @t32 () (tptp.holds @t31 tptp.s0)) % 203.15/203.47 (define @t33 () (tptp.holds (tptp.clear tptp.a) tptp.s0)) % 203.15/203.47 (define @t34 () (tptp.holds (tptp.clear tptp.c) tptp.s0)) % 203.15/203.47 (define @t35 () (tptp.holds tptp.empty tptp.s0)) % 203.15/203.47 (define @t36 () (@list @t1)) % 203.15/203.47 (define @t37 () (forall @t36 (not (tptp.holds (tptp.and @t31 (tptp.on tptp.a tptp.c)) @t1)))) % 203.15/203.47 (define @t38 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t39 () (@var "b_Y" it_10_$$unsorted)) % 203.15/203.47 (define @t40 () (@var "b_X" it_10_$$unsorted)) % 203.15/203.47 (define @t41 () (@const 0 (-> it_10_$$unsorted it_10_$$unsorted $$unsorted))) % 203.15/203.47 (define @t42 () (_ @t41 @t40 @t39)) % 203.15/203.47 (define @t43 () (@const 1 (-> $$unsorted it_4_$$unsorted Bool))) % 203.15/203.47 (define @t44 () (@var "b_W" it_10_$$unsorted)) % 203.15/203.47 (define @t45 () (@var "b_Z" it_10_$$unsorted)) % 203.15/203.47 (define @t46 () (@const 2 (-> it_10_$$unsorted it_10_$$unsorted it_17_$$unsorted))) % 203.15/203.47 (define @t47 () (@const 3 (-> it_17_$$unsorted it_4_$$unsorted it_4_$$unsorted))) % 203.15/203.47 (define @t48 () (forall (@list @t40 @t39 @t45 @t44 @t38) (or (_ @t43 @t42 (_ @t47 (_ @t46 @t45 @t44) @t38)) (not (_ @t43 @t42 @t38))))) % 203.15/203.47 (define @t49 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t50 () (@const 4 it_4_$$unsorted)) % 203.15/203.47 (define @t51 () (@const 5 it_10_$$unsorted)) % 203.15/203.47 (define @t52 () (@const 6 (-> it_10_$$unsorted it_17_$$unsorted))) % 203.15/203.47 (define @t53 () (_ @t47 (_ @t52 @t51) @t50)) % 203.15/203.47 (define @t54 () (@const 7 it_10_$$unsorted)) % 203.15/203.47 (define @t55 () (_ @t47 (_ @t46 @t51 @t54) @t53)) % 203.15/203.47 (define @t56 () (_ @t41 @t51 @t54)) % 203.15/203.47 (define @t57 () (@const 8 it_10_$$unsorted)) % 203.15/203.47 (define @t58 () (_ @t41 @t54 @t57)) % 203.15/203.47 (define @t59 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t60 () (tptp.and @t58 @t56)) % 203.15/203.47 (define @t61 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t62 () (@var "b_Y" it_10_$$unsorted)) % 203.15/203.47 (define @t63 () (@const 9 (-> it_10_$$unsorted $$unsorted))) % 203.15/203.47 (define @t64 () (@var "b_X" it_10_$$unsorted)) % 203.15/203.47 (define @t65 () (@const 10 (-> it_10_$$unsorted $$unsorted))) % 203.15/203.47 (define @t66 () (@var "b_Z" it_10_$$unsorted)) % 203.15/203.47 (define @t67 () (@var "b_X" it_10_$$unsorted)) % 203.15/203.47 (define @t68 () (@const 11 (-> it_10_$$unsorted it_10_$$unsorted Bool))) % 203.15/203.47 (define @t69 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t70 () (_ @t63 @t67)) % 203.15/203.47 (define @t71 () (@var "b_X" it_10_$$unsorted)) % 203.15/203.47 (define @t72 () (@var "b_Y" it_10_$$unsorted)) % 203.15/203.47 (define @t73 () (_ @t68 @t51 @t54)) % 203.15/203.47 (define @t74 () (not @t73)) % 203.15/203.47 (define @t75 () (_ @t68 @t54 @t51)) % 203.15/203.47 (define @t76 () (or @t75 @t74)) % 203.15/203.47 (define @t77 () (_ @t63 @t54)) % 203.15/203.47 (define @t78 () (_ @t43 @t77 @t50)) % 203.15/203.47 (define @t79 () (not @t75)) % 203.15/203.47 (define @t80 () (not @t78)) % 203.15/203.47 (define @t81 () (_ @t43 @t77 @t53)) % 203.15/203.47 (define @t82 () (or @t81 @t80 @t79)) % 203.15/203.47 (define @t83 () (@list false false false)) % 203.15/203.47 (define @t84 () (@const 12 it_10_$$unsorted)) % 203.15/203.47 (define @t85 () (@var "b_X" it_10_$$unsorted)) % 203.15/203.47 (define @t86 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t87 () (_ @t43 tptp.empty @t50)) % 203.15/203.47 (define @t88 () (_ @t43 (_ @t63 @t51) @t50)) % 203.15/203.47 (define @t89 () (_ @t68 @t51 @t84)) % 203.15/203.47 (define @t90 () (not @t89)) % 203.15/203.47 (define @t91 () (not @t88)) % 203.15/203.47 (define @t92 () (not @t87)) % 203.15/203.47 (define @t93 () (_ @t43 (_ @t65 @t51) @t53)) % 203.15/203.47 (define @t94 () (or @t93 @t92 @t91 @t90)) % 203.15/203.47 (define @t95 () (not @t81)) % 203.15/203.47 (define @t96 () (not @t93)) % 203.15/203.47 (define @t97 () (_ @t43 @t56 @t55)) % 203.15/203.47 (define @t98 () (or @t97 @t96 @t95)) % 203.15/203.47 (define @t99 () (not @t97)) % 203.15/203.47 (define @t100 () (_ @t43 @t58 @t55)) % 203.15/203.47 (define @t101 () (not @t100)) % 203.15/203.47 (define @t102 () (_ @t43 @t60 @t55)) % 203.15/203.47 (define @t103 () (or @t102 @t101 @t99)) % 203.15/203.47 (define @t104 () (@var "b_Z" it_10_$$unsorted)) % 203.15/203.47 (define @t105 () (@var "b_X" it_10_$$unsorted)) % 203.15/203.47 (define @t106 () (@var "b_State" it_4_$$unsorted)) % 203.15/203.47 (define @t107 () (@var "b_Y" it_10_$$unsorted)) % 203.15/203.47 (define @t108 () (_ @t41 @t105 @t107)) % 203.15/203.47 (define @t109 () (_ @t43 @t58 @t50)) % 203.15/203.47 (define @t110 () (not @t109)) % 203.15/203.47 (define @t111 () (_ @t43 @t58 @t53)) % 203.15/203.47 (define @t112 () (or @t111 @t110 @t79)) % 203.15/203.47 (define @t113 () (not @t111)) % 203.15/203.47 (define @t114 () (or @t100 @t113)) % 203.15/203.47 (define @t115 () (not @t114)) % 203.15/203.47 (assume @p1 @t6) % 203.15/203.47 (assume @p2 @t12) % 203.15/203.47 (assume @p3 (forall (@list @t2 @t3 @t1) (or (tptp.holds @t15 @t10) @t14 @t8 @t9))) % 203.15/203.47 (assume @p4 @t19) % 203.15/203.47 (assume @p5 @t20) % 203.15/203.47 (assume @p6 (forall @t5 (or (tptp.holds tptp.empty @t23) @t22 @t21))) % 203.15/203.47 (assume @p7 @t24) % 203.15/203.47 (assume @p8 (forall @t5 (or (tptp.holds @t7 @t23) @t22 @t21))) % 203.15/203.47 (assume @p9 @t26) % 203.15/203.47 (assume @p10 (forall (@list @t16 @t3 @t2 @t1) (or (tptp.holds @t27 @t23) (not (tptp.holds @t27 @t1)) (not (tptp.differ @t16 @t2))))) % 203.15/203.47 (assume @p11 @t28) % 203.15/203.47 (assume @p12 (tptp.differ tptp.a tptp.b)) % 203.15/203.47 (assume @p13 @t29) % 203.15/203.47 (assume @p14 (tptp.differ tptp.a tptp.d)) % 203.15/203.47 (assume @p15 @t30) % 203.15/203.47 (assume @p16 (tptp.differ tptp.b tptp.c)) % 203.15/203.47 (assume @p17 (tptp.differ tptp.b tptp.d)) % 203.15/203.47 (assume @p18 (tptp.differ tptp.b tptp.table)) % 203.15/203.47 (assume @p19 (tptp.differ tptp.c tptp.d)) % 203.15/203.47 (assume @p20 (tptp.differ tptp.c tptp.table)) % 203.15/203.47 (assume @p21 (tptp.differ tptp.d tptp.table)) % 203.15/203.47 (assume @p22 (tptp.holds (tptp.on tptp.a tptp.table) tptp.s0)) % 203.15/203.47 (assume @p23 (tptp.holds (tptp.on tptp.b tptp.table) tptp.s0)) % 203.15/203.47 (assume @p24 @t32) % 203.15/203.47 (assume @p25 (tptp.holds (tptp.on tptp.d tptp.table) tptp.s0)) % 203.15/203.47 (assume @p26 @t33) % 203.15/203.47 (assume @p27 (tptp.holds (tptp.clear tptp.b) tptp.s0)) % 203.15/203.47 (assume @p28 @t34) % 203.15/203.47 (assume @p29 @t35) % 203.15/203.47 (assume @p30 (forall @t36 (tptp.holds (tptp.clear tptp.table) @t1))) % 203.15/203.47 (assume @p31 @t37) % 203.15/203.47 ; WARNING: add trust step for TRUST % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p32 :rule trust :premises () :args ((= @t26 @t48))) % 203.15/203.47 (step @p33 :rule eq_resolve :premises (@p9 @p32)) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p34 :rule trust :premises () :args ((= @t6 (forall (@list @t3 @t2 @t49) (or (_ @t43 @t4 @t49) (not (_ @t43 @t3 @t49)) (not (_ @t43 @t2 @t49))))))) % 203.15/203.47 (step @p35 :rule eq_resolve :premises (@p1 @p34)) % 203.15/203.47 (step @p36 :rule instantiate :premises (@p35) :args ((@list @t58 @t56 @t55))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p37 :rule trust :premises () :args ((= @t37 (forall (@list @t59) (not (_ @t43 @t60 @t59)))))) % 203.15/203.47 (step @p38 :rule eq_resolve :premises (@p31 @p37)) % 203.15/203.47 (step @p39 :rule instantiate :premises (@p38) :args ((@list @t55))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p40 :rule trust :premises () :args ((= @t24 (forall (@list @t64 @t62 @t61) (or (_ @t43 (_ @t41 @t64 @t62) (_ @t47 (_ @t46 @t64 @t62) @t61)) (not (_ @t43 (_ @t65 @t64) @t61)) (not (_ @t43 (_ @t63 @t62) @t61))))))) % 203.15/203.47 (step @p41 :rule eq_resolve :premises (@p7 @p40)) % 203.15/203.47 (step @p42 :rule instantiate :premises (@p41) :args ((@list @t51 @t54 @t53))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p43 :rule trust :premises () :args ((= @t20 (forall (@list @t67 @t66 @t69) (or (_ @t43 @t70 (_ @t47 (_ @t52 @t66) @t69)) (not (_ @t43 @t70 @t69)) (not (_ @t68 @t67 @t66))))))) % 203.15/203.47 (step @p44 :rule eq_resolve :premises (@p5 @p43)) % 203.15/203.47 (step @p45 :rule instantiate :premises (@p44) :args ((@list @t54 @t51 @t50))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p46 :rule trust :premises () :args ((= @t28 (forall (@list @t71 @t72) (or (_ @t68 @t71 @t72) (not (_ @t68 @t72 @t71))))))) % 203.15/203.47 (step @p47 :rule eq_resolve :premises (@p11 @p46)) % 203.15/203.47 (step @p48 :rule instantiate :premises (@p47) :args ((@list @t54 @t51))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p49 :rule trust :premises () :args ((= @t29 @t73))) % 203.15/203.47 (step @p50 :rule eq_resolve :premises (@p13 @p49)) % 203.15/203.47 (step @p51 :rule cnf_or_pos :args (@t76)) % 203.15/203.47 (step @p52 :rule reordering :premises (@p51) :args ((or @t74 @t75 (not @t76)))) % 203.15/203.47 (step @p53 :rule chain_m_resolution :premises (@p52 @p50 @p48) :args (@t75 (@list false false) (@list @t73 @t76))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p54 :rule trust :premises () :args ((= @t34 @t78))) % 203.15/203.47 (step @p55 :rule eq_resolve :premises (@p28 @p54)) % 203.15/203.47 (step @p56 :rule cnf_or_pos :args (@t82)) % 203.15/203.47 (step @p57 :rule reordering :premises (@p56) :args ((or @t80 @t81 @t79 (not @t82)))) % 203.15/203.47 (step @p58 :rule chain_m_resolution :premises (@p57 @p55 @p53 @p45) :args (@t81 @t83 (@list @t78 @t75 @t82))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p59 :rule trust :premises () :args ((= @t12 (forall (@list @t85 @t86) (or (_ @t43 (_ @t65 @t85) (_ @t47 (_ @t52 @t85) @t86)) (not (_ @t43 tptp.empty @t86)) (not (_ @t43 (_ @t63 @t85) @t86)) (not (_ @t68 @t85 @t84))))))) % 203.15/203.47 (step @p60 :rule eq_resolve :premises (@p2 @p59)) % 203.15/203.47 (step @p61 :rule instantiate :premises (@p60) :args ((@list @t51 @t50))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p62 :rule trust :premises () :args ((= @t35 @t87))) % 203.15/203.47 (step @p63 :rule eq_resolve :premises (@p29 @p62)) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p64 :rule trust :premises () :args ((= @t33 @t88))) % 203.15/203.47 (step @p65 :rule eq_resolve :premises (@p26 @p64)) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p66 :rule trust :premises () :args ((= @t30 @t89))) % 203.15/203.47 (step @p67 :rule eq_resolve :premises (@p15 @p66)) % 203.15/203.47 (step @p68 :rule cnf_or_pos :args (@t94)) % 203.15/203.47 (step @p69 :rule reordering :premises (@p68) :args ((or @t90 @t91 @t92 @t93 (not @t94)))) % 203.15/203.47 (step @p70 :rule chain_m_resolution :premises (@p69 @p67 @p65 @p63 @p61) :args (@t93 (@list false false false false) (@list @t89 @t88 @t87 @t94))) % 203.15/203.47 (step @p71 :rule cnf_or_pos :args (@t98)) % 203.15/203.47 (step @p72 :rule reordering :premises (@p71) :args ((or @t96 @t97 @t95 (not @t98)))) % 203.15/203.47 (step @p73 :rule chain_m_resolution :premises (@p72 @p70 @p58 @p42) :args (@t97 @t83 (@list @t93 @t81 @t98))) % 203.15/203.47 (step @p74 :rule cnf_or_pos :args (@t103)) % 203.15/203.47 (step @p75 :rule reordering :premises (@p74) :args ((or @t99 @t102 @t101 (not @t103)))) % 203.15/203.47 (step @p76 :rule chain_m_resolution :premises (@p75 @p73 @p39 @p36) :args (@t101 (@list false true false) (@list @t97 @t102 @t103))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p77 :rule trust :premises () :args ((= @t19 (forall (@list @t105 @t107 @t104 @t106) (or (_ @t43 @t108 (_ @t47 (_ @t52 @t104) @t106)) (not (_ @t43 @t108 @t106)) (not (_ @t68 @t105 @t104))))))) % 203.15/203.47 (step @p78 :rule eq_resolve :premises (@p4 @p77)) % 203.15/203.47 (step @p79 :rule instantiate :premises (@p78) :args ((@list @t54 @t57 @t51 @t50))) % 203.15/203.47 ; trust TRUST PREPROCESS_SORT_INFER % 203.15/203.47 (step @p80 :rule trust :premises () :args ((= @t32 @t109))) % 203.15/203.47 (step @p81 :rule eq_resolve :premises (@p24 @p80)) % 203.15/203.47 (step @p82 :rule cnf_or_pos :args (@t112)) % 203.15/203.47 (step @p83 :rule reordering :premises (@p82) :args ((or @t110 @t111 @t79 (not @t112)))) % 203.15/203.47 (step @p84 :rule chain_m_resolution :premises (@p83 @p81 @p53 @p79) :args (@t111 @t83 (@list @t109 @t75 @t112))) % 203.15/203.47 (step @p85 :rule cnf_or_pos :args (@t114)) % 203.15/203.47 (step @p86 :rule reordering :premises (@p85) :args ((or @t113 @t100 @t115))) % 203.15/203.47 (step @p87 :rule chain_m_resolution :premises (@p86 @p84 @p76) :args (@t115 (@list false true) (@list @t111 @t100))) % 203.15/203.47 (assume-push @p94 @t48) % 203.15/203.47 (step @p89 :rule instantiate :premises (@p33) :args ((@list @t54 @t57 @t51 @t54 @t53))) % 203.15/203.47 (step-pop @p95 :rule scope :premises (@p89)) % 203.15/203.47 (step @p90 :rule process_scope :premises (@p95) :args (@t114)) % 203.15/203.47 (step @p92 :rule implies_elim :premises (@p90)) % 203.15/203.47 (step @p93 false :rule chain_m_resolution :premises (@p92 @p87 @p33) :args (false (@list true false) (@list @t114 @t48))) % 203.15/203.47 ) % 203.15/203.47 % SZS output end Proof % 203.15/203.47 % cvc5 exiting %------------------------------------------------------------------------------