%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWW951+1 : TPTP v9.2.1. Released v7.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n007.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:05:52 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 : SWW951+1 : TPTP v9.2.1. Released v7.4.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n007.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 22:49:11 EDT 2026 % 0.16/0.34 % CPUTime : % 0.28/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.pred_equal (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.pred_mess (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.tuple_T_out_4 (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.tuple_false $$unsorted) % 0.44/0.64 (declare-const tptp.name_k $$unsorted) % 0.44/0.64 (declare-const tptp.tuple_T_in_1 (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.constr_CONST_0x30 $$unsorted) % 0.44/0.64 (declare-const tptp.tuple_T_out_2 (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.constr_CONST_1 $$unsorted) % 0.44/0.64 (declare-const tptp.tuple_true $$unsorted) % 0.44/0.64 (declare-const tptp.constr_CONST_3 $$unsorted) % 0.44/0.64 (declare-const tptp.constr_CONST_2 $$unsorted) % 0.44/0.64 (declare-const tptp.constr_xor (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.constr_ZERO $$unsorted) % 0.44/0.64 (declare-const tptp.name_c $$unsorted) % 0.44/0.64 (declare-const tptp.tuple_T_in_3 (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.name_objective $$unsorted) % 0.44/0.64 (declare-const tptp.constr_CONST_4 $$unsorted) % 0.44/0.64 (declare-const tptp.constr_h (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.name_new0x2Dname (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.pred_attacker (-> $$unsorted Bool)) % 0.44/0.64 (define @t1 () (@var "VAR_X_10X30" $$unsorted)) % 0.44/0.64 (define @t2 () (@var "VAR_X_9" $$unsorted)) % 0.44/0.64 (define @t3 () (@var "VAR_X_7" $$unsorted)) % 0.44/0.64 (define @t4 () (@var "VAR_Y_8" $$unsorted)) % 0.44/0.64 (define @t5 () (@var "VAR_Z_0X30" $$unsorted)) % 0.44/0.64 (define @t6 () (@var "VAR_Y_0X30" $$unsorted)) % 0.44/0.64 (define @t7 () (@var "VAR_X_0X30" $$unsorted)) % 0.44/0.64 (define @t8 () (@var "VAR_V_27" $$unsorted)) % 0.44/0.64 (define @t9 () (@var "VAR_V_26" $$unsorted)) % 0.44/0.64 (define @t10 () (@var "VAR_V_30X30" $$unsorted)) % 0.44/0.64 (define @t11 () (@var "VAR_V_32" $$unsorted)) % 0.44/0.64 (define @t12 () (@var "VAR_V_35" $$unsorted)) % 0.44/0.64 (define @t13 () (tptp.pred_attacker @t12)) % 0.44/0.64 (define @t14 () (tptp.pred_attacker (tptp.tuple_T_out_4 @t12))) % 0.44/0.64 (define @t15 () (@list @t12)) % 0.44/0.64 (define @t16 () (forall @t15 (=> @t14 @t13))) % 0.44/0.64 (define @t17 () (@var "VAR_V_38" $$unsorted)) % 0.44/0.64 (define @t18 () (@var "VAR_V_41" $$unsorted)) % 0.44/0.64 (define @t19 () (@var "VAR_V_44" $$unsorted)) % 0.44/0.64 (define @t20 () (tptp.pred_attacker (tptp.tuple_T_in_3 @t19))) % 0.44/0.64 (define @t21 () (tptp.pred_attacker @t19)) % 0.44/0.64 (define @t22 () (forall (@list @t19) (=> @t21 @t20))) % 0.44/0.64 (define @t23 () (@var "VAR_V_47" $$unsorted)) % 0.44/0.64 (define @t24 () (@var "VAR_V_50X30" $$unsorted)) % 0.44/0.64 (define @t25 () (tptp.pred_attacker (tptp.tuple_T_in_1 @t24))) % 0.44/0.64 (define @t26 () (tptp.pred_attacker @t24)) % 0.44/0.64 (define @t27 () (forall (@list @t24) (=> @t26 @t25))) % 0.44/0.64 (define @t28 () (@var "VAR_V_53" $$unsorted)) % 0.44/0.64 (define @t29 () (tptp.pred_attacker tptp.constr_CONST_1)) % 0.44/0.64 (define @t30 () (@var "VAR_V_59" $$unsorted)) % 0.44/0.64 (define @t31 () (@var "VAR_V_60X30" $$unsorted)) % 0.44/0.64 (define @t32 () (@var "VAR_V_61" $$unsorted)) % 0.44/0.64 (define @t33 () (@var "VAR_V_62" $$unsorted)) % 0.44/0.64 (define @t34 () (@var "VAR_V_64" $$unsorted)) % 0.44/0.64 (define @t35 () (@var "VAR_V_65" $$unsorted)) % 0.44/0.64 (define @t36 () (@var "VAR_R1_85" $$unsorted)) % 0.44/0.64 (define @t37 () (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) % 0.44/0.64 (define @t38 () (@var "VAR_R1_10X306" $$unsorted)) % 0.44/0.64 (define @t39 () (tptp.pred_attacker (tptp.tuple_T_in_1 @t38))) % 0.44/0.64 (define @t40 () (@var "VAR_K_XOR_K1_10X305" $$unsorted)) % 0.44/0.64 (define @t41 () (tptp.pred_attacker (tptp.tuple_T_in_3 @t40))) % 0.44/0.64 (define @t42 () (and @t41 @t39)) % 0.44/0.64 (define @t43 () (@list @t40 @t38)) % 0.44/0.64 (define @t44 () (forall @t43 (=> @t42 @t37))) % 0.44/0.64 (define @t45 () (tptp.pred_attacker tptp.name_objective)) % 0.44/0.64 (define @t46 () (@list tptp.constr_CONST_1)) % 0.44/0.64 (define @t47 () (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) % 0.44/0.64 (define @t48 () (not @t29)) % 0.44/0.64 (define @t49 () (or @t48 @t47)) % 0.44/0.64 (define @t50 () (@list false false)) % 0.44/0.64 (define @t51 () (not @t39)) % 0.44/0.64 (define @t52 () (forall (@list @t38) @t51)) % 0.44/0.64 (define @t53 () (@list false)) % 0.44/0.64 (define @t54 () (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1))) % 0.44/0.64 (define @t55 () (or @t48 @t54)) % 0.44/0.64 (define @t56 () (not @t41)) % 0.44/0.64 (define @t57 () (forall (@list @t40) @t56)) % 0.44/0.64 (define @t58 () (or @t37 @t56 @t51)) % 0.44/0.64 (define @t59 () (or @t56 @t51 @t37)) % 0.44/0.64 (define @t60 () (not @t37)) % 0.44/0.64 (define @t61 () (or @t60 @t45)) % 0.44/0.64 (define @t62 () (not @t61)) % 0.44/0.64 (define @t63 () (@list true false)) % 0.44/0.64 (define @t64 () (forall @t15 (or (not @t14) @t13))) % 0.44/0.64 (assume @p1 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_1))) % 0.44/0.64 (assume @p2 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_2))) % 0.44/0.64 (assume @p3 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_3))) % 0.44/0.64 (assume @p4 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_4))) % 0.44/0.64 (assume @p5 (not (= tptp.constr_CONST_0x30 tptp.constr_ZERO))) % 0.44/0.64 (assume @p6 (not (= tptp.constr_CONST_0x30 tptp.name_c))) % 0.44/0.64 (assume @p7 (not (= tptp.constr_CONST_0x30 tptp.name_k))) % 0.44/0.64 (assume @p8 (not (= tptp.constr_CONST_0x30 tptp.name_objective))) % 0.44/0.64 (assume @p9 (not (= tptp.constr_CONST_1 tptp.constr_CONST_2))) % 0.44/0.64 (assume @p10 (not (= tptp.constr_CONST_1 tptp.constr_CONST_3))) % 0.44/0.64 (assume @p11 (not (= tptp.constr_CONST_1 tptp.constr_CONST_4))) % 0.44/0.64 (assume @p12 (not (= tptp.constr_CONST_1 tptp.constr_ZERO))) % 0.44/0.64 (assume @p13 (not (= tptp.constr_CONST_1 tptp.name_c))) % 0.44/0.64 (assume @p14 (not (= tptp.constr_CONST_1 tptp.name_k))) % 0.44/0.64 (assume @p15 (not (= tptp.constr_CONST_1 tptp.name_objective))) % 0.44/0.64 (assume @p16 (not (= tptp.constr_CONST_2 tptp.constr_CONST_3))) % 0.44/0.64 (assume @p17 (not (= tptp.constr_CONST_2 tptp.constr_CONST_4))) % 0.44/0.64 (assume @p18 (not (= tptp.constr_CONST_2 tptp.constr_ZERO))) % 0.44/0.64 (assume @p19 (not (= tptp.constr_CONST_2 tptp.name_c))) % 0.44/0.64 (assume @p20 (not (= tptp.constr_CONST_2 tptp.name_k))) % 0.44/0.64 (assume @p21 (not (= tptp.constr_CONST_2 tptp.name_objective))) % 0.44/0.64 (assume @p22 (not (= tptp.constr_CONST_3 tptp.constr_CONST_4))) % 0.44/0.64 (assume @p23 (not (= tptp.constr_CONST_3 tptp.constr_ZERO))) % 0.44/0.64 (assume @p24 (not (= tptp.constr_CONST_3 tptp.name_c))) % 0.44/0.64 (assume @p25 (not (= tptp.constr_CONST_3 tptp.name_k))) % 0.44/0.64 (assume @p26 (not (= tptp.constr_CONST_3 tptp.name_objective))) % 0.44/0.64 (assume @p27 (not (= tptp.constr_CONST_4 tptp.constr_ZERO))) % 0.44/0.64 (assume @p28 (not (= tptp.constr_CONST_4 tptp.name_c))) % 0.44/0.64 (assume @p29 (not (= tptp.constr_CONST_4 tptp.name_k))) % 0.44/0.64 (assume @p30 (not (= tptp.constr_CONST_4 tptp.name_objective))) % 0.44/0.64 (assume @p31 (not (= tptp.constr_ZERO tptp.name_c))) % 0.44/0.64 (assume @p32 (not (= tptp.constr_ZERO tptp.name_k))) % 0.44/0.64 (assume @p33 (not (= tptp.constr_ZERO tptp.name_objective))) % 0.44/0.64 (assume @p34 (not (= tptp.name_c tptp.name_k))) % 0.44/0.64 (assume @p35 (not (= tptp.name_c tptp.name_objective))) % 0.44/0.64 (assume @p36 (not (= tptp.name_k tptp.name_objective))) % 0.44/0.64 (assume @p37 (forall (@list @t1) (= (tptp.constr_xor @t1 @t1) tptp.constr_ZERO))) % 0.44/0.64 (assume @p38 (forall (@list @t2) (= (tptp.constr_xor @t2 tptp.constr_ZERO) @t2))) % 0.44/0.64 (assume @p39 (forall (@list @t3 @t4) (= (tptp.constr_xor @t3 @t4) (tptp.constr_xor @t4 @t3)))) % 0.44/0.64 (assume @p40 (forall (@list @t7 @t6 @t5) (= (tptp.constr_xor @t7 (tptp.constr_xor @t6 @t5)) (tptp.constr_xor (tptp.constr_xor @t7 @t6) @t5)))) % 0.44/0.64 (assume @p41 (forall (@list @t9 @t8) (=> (and (tptp.pred_attacker @t9) (tptp.pred_attacker @t8)) (tptp.pred_attacker (tptp.constr_xor @t9 @t8))))) % 0.44/0.64 (assume @p42 (tptp.pred_attacker tptp.tuple_true)) % 0.44/0.64 (assume @p43 (forall (@list @t10) (=> (tptp.pred_attacker @t10) (tptp.pred_attacker (tptp.constr_h @t10))))) % 0.44/0.64 (assume @p44 (tptp.pred_attacker tptp.tuple_false)) % 0.44/0.64 (assume @p45 (tptp.pred_attacker tptp.constr_ZERO)) % 0.44/0.64 (assume @p46 (forall (@list @t11) (=> (tptp.pred_attacker @t11) (tptp.pred_attacker (tptp.tuple_T_out_4 @t11))))) % 0.44/0.64 (assume @p47 @t16) % 0.44/0.64 (assume @p48 (forall (@list @t17) (=> (tptp.pred_attacker @t17) (tptp.pred_attacker (tptp.tuple_T_out_2 @t17))))) % 0.44/0.64 (assume @p49 (forall (@list @t18) (=> (tptp.pred_attacker (tptp.tuple_T_out_2 @t18)) (tptp.pred_attacker @t18)))) % 0.44/0.64 (assume @p50 @t22) % 0.44/0.64 (assume @p51 (forall (@list @t23) (=> (tptp.pred_attacker (tptp.tuple_T_in_3 @t23)) (tptp.pred_attacker @t23)))) % 0.44/0.64 (assume @p52 @t27) % 0.44/0.64 (assume @p53 (forall (@list @t28) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 @t28)) (tptp.pred_attacker @t28)))) % 0.44/0.64 (assume @p54 (tptp.pred_attacker tptp.constr_CONST_4)) % 0.44/0.64 (assume @p55 (tptp.pred_attacker tptp.constr_CONST_3)) % 0.44/0.64 (assume @p56 (tptp.pred_attacker tptp.constr_CONST_2)) % 0.44/0.64 (assume @p57 @t29) % 0.44/0.64 (assume @p58 (tptp.pred_attacker tptp.constr_CONST_0x30)) % 0.44/0.64 (assume @p59 (forall (@list @t30 @t31) (=> (and (tptp.pred_mess @t31 @t30) (tptp.pred_attacker @t31)) (tptp.pred_attacker @t30)))) % 0.44/0.65 (assume @p60 (forall (@list @t32 @t33) (=> (and (tptp.pred_attacker @t33) (tptp.pred_attacker @t32)) (tptp.pred_mess @t33 @t32)))) % 0.44/0.65 (assume @p61 (tptp.pred_attacker tptp.name_c)) % 0.44/0.65 (assume @p62 (forall (@list @t34) (tptp.pred_equal @t34 @t34))) % 0.44/0.65 (assume @p63 (forall (@list @t35) (tptp.pred_attacker (tptp.name_new0x2Dname @t35)))) % 0.44/0.65 (assume @p64 (forall (@list @t36) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 @t36)) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.name_k @t36))))))) % 0.44/0.65 (assume @p65 @t44) % 0.44/0.65 (assume @p66 (not @t45)) % 0.44/0.65 (assume @p67 true) % 0.44/0.65 (step @p68 :rule bool-impl-elim :args (@t14 @t13)) % 0.44/0.65 (step @p69 :rule cong :premises (@p68) :args (@t16)) % 0.44/0.65 (step @p70 :rule eq_resolve :premises (@p47 @p69)) % 0.44/0.65 (step @p71 :rule bool-impl-elim :args (@t26 @t25)) % 0.44/0.65 (step @p72 :rule cong :premises (@p71) :args (@t27)) % 0.44/0.65 (step @p73 :rule eq_resolve :premises (@p52 @p72)) % 0.44/0.65 (step @p74 :rule instantiate :premises (@p73) :args (@t46)) % 0.44/0.65 (step @p75 :rule cnf_or_pos :args (@t49)) % 0.44/0.65 (step @p76 :rule reordering :premises (@p75) :args ((or @t48 @t47 (not @t49)))) % 0.44/0.65 (step @p77 :rule chain_m_resolution :premises (@p76 @p57 @p74) :args (@t47 @t50 (@list @t29 @t49))) % 0.44/0.65 (assume-push @p121 @t52) % 0.44/0.65 (step @p79 :rule instantiate :premises (@p121) :args (@t46)) % 0.44/0.65 (step-pop @p122 :rule scope :premises (@p79)) % 0.44/0.65 (step @p80 :rule process_scope :premises (@p122) :args ((not @t47))) % 0.44/0.65 (step @p82 :rule implies_elim :premises (@p80)) % 0.44/0.65 (step @p83 :rule chain_m_resolution :premises (@p82 @p77) :args ((not @t52) @t53 (@list @t47))) % 0.44/0.65 (step @p84 :rule bool-impl-elim :args (@t21 @t20)) % 0.44/0.65 (step @p85 :rule cong :premises (@p84) :args (@t22)) % 0.44/0.65 (step @p86 :rule eq_resolve :premises (@p50 @p85)) % 0.44/0.65 (step @p87 :rule instantiate :premises (@p86) :args (@t46)) % 0.44/0.65 (step @p88 :rule cnf_or_pos :args (@t55)) % 0.44/0.65 (step @p89 :rule reordering :premises (@p88) :args ((or @t48 @t54 (not @t55)))) % 0.44/0.65 (step @p90 :rule chain_m_resolution :premises (@p89 @p57 @p87) :args (@t54 @t50 (@list @t29 @t55))) % 0.44/0.65 (assume-push @p123 @t57) % 0.44/0.65 (step @p92 :rule instantiate :premises (@p123) :args (@t46)) % 0.44/0.65 (step-pop @p124 :rule scope :premises (@p92)) % 0.44/0.65 (step @p93 :rule process_scope :premises (@p124) :args ((not @t54))) % 0.44/0.65 (step @p95 :rule implies_elim :premises (@p93)) % 0.44/0.65 (step @p96 :rule chain_m_resolution :premises (@p95 @p90) :args ((not @t57) @t53 (@list @t54))) % 0.44/0.65 (step @p97 :rule quant-miniscope-or :args ((= (forall @t43 @t58) (or @t37 @t57 @t52)))) % 0.44/0.65 (step @p98 :rule aci_norm :args ((= @t59 @t58))) % 0.44/0.65 (step @p99 :rule cong :premises (@p98) :args ((forall @t43 @t59))) % 0.44/0.65 (step @p100 :rule trans :premises (@p99 @p97)) % 0.44/0.65 (step @p101 :rule aci_norm :args ((= (or (or @t56 @t51) @t37) @t59))) % 0.44/0.65 (step @p102 :rule refl :args (@t37)) % 0.44/0.65 (step @p103 :rule bool-and-de-morgan :args (@t41 @t39 true)) % 0.44/0.65 (step @p104 :rule nary_cong :premises (@p103 @p102) :args ((or (not @t42) @t37))) % 0.44/0.65 (step @p105 :rule trans :premises (@p104 @p101)) % 0.44/0.65 (step @p106 :rule bool-impl-elim :args (@t42 @t37)) % 0.44/0.65 (step @p107 :rule trans :premises (@p106 @p105)) % 0.44/0.65 (step @p108 :rule cong :premises (@p107) :args (@t44)) % 0.44/0.65 (step @p109 :rule trans :premises (@p108 @p100)) % 0.44/0.65 (step @p110 :rule eq_resolve :premises (@p65 @p109)) % 0.44/0.65 (step @p111 :rule chain_m_resolution :premises (@p110 @p96 @p83) :args (@t37 (@list true true) (@list @t57 @t52))) % 0.44/0.65 (step @p112 :rule cnf_or_pos :args (@t61)) % 0.44/0.65 (step @p113 :rule reordering :premises (@p112) :args ((or @t45 @t60 @t62))) % 0.44/0.65 (step @p114 :rule chain_m_resolution :premises (@p113 @p66 @p111) :args (@t62 @t63 (@list @t45 @t37))) % 0.44/0.65 (assume-push @p125 @t64) % 0.44/0.65 (step @p116 :rule instantiate :premises (@p70) :args ((@list tptp.name_objective))) % 0.44/0.65 (step-pop @p126 :rule scope :premises (@p116)) % 0.44/0.65 (step @p117 :rule process_scope :premises (@p126) :args (@t61)) % 0.44/0.65 (step @p119 :rule implies_elim :premises (@p117)) % 0.44/0.65 (step @p120 false :rule chain_m_resolution :premises (@p119 @p114 @p70) :args (false @t63 (@list @t61 @t64))) % 0.44/0.65 ) % 0.44/0.65 % SZS output end Proof % 0.44/0.65 % cvc5 exiting %------------------------------------------------------------------------------