↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU245+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n027.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:51:06 AM UTC 2026

% Result   : Theorem 28.14s 28.32s
% Output   : Proof 28.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU245+1 : TPTP v9.2.1. Released v3.3.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.34  % Computer : n027.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Tue Jun  2 16:47:36 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.29/0.50  %----Proving TF0_NAR, FOF, or CNF
% 28.14/28.32  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 28.14/28.32  --- Run --no-e-matching --full-saturate-quant at 6...
% 28.14/28.32  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 6...
% 28.14/28.32  --- Run --finite-model-find --uf-ss=no-minimal at 6...
% 28.14/28.32  % SZS status Theorem
% 28.14/28.32  % SZS output start Proof
% 28.14/28.32  (
% 28.14/28.32  (declare-sort $$unsorted 0)
% 28.14/28.32  (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted))
% 28.14/28.32  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 28.14/28.32  (declare-const tptp.element (-> $$unsorted $$unsorted Bool))
% 28.14/28.32  (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted))
% 28.14/28.32  (declare-const tptp.relation_restriction (-> $$unsorted $$unsorted $$unsorted))
% 28.14/28.32  (declare-const tptp.empty (-> $$unsorted Bool))
% 28.14/28.32  (declare-const tptp.empty_set $$unsorted)
% 28.14/28.32  (declare-const tptp.relation (-> $$unsorted Bool))
% 28.14/28.32  (declare-const tptp.function (-> $$unsorted Bool))
% 28.14/28.32  (declare-const tptp.one_to_one (-> $$unsorted Bool))
% 28.14/28.32  (define @t1 () (@var "A" $$unsorted))
% 28.14/28.32  (define @t2 () (tptp.function @t1))
% 28.14/28.32  (define @t3 () (tptp.relation @t1))
% 28.14/28.32  (define @t4 () (and @t3 @t2 (tptp.one_to_one @t1)))
% 28.14/28.32  (define @t5 () (@list @t1))
% 28.14/28.32  (define @t6 () (tptp.empty @t1))
% 28.14/28.32  (define @t7 () (and @t3 @t6 @t2))
% 28.14/28.32  (define @t8 () (@var "B" $$unsorted))
% 28.14/28.32  (define @t9 () (@list @t8))
% 28.14/28.32  (define @t10 () (tptp.in @t1 @t8))
% 28.14/28.32  (define @t11 () (tptp.empty @t8))
% 28.14/28.32  (define @t12 () (tptp.element @t1 @t8))
% 28.14/28.32  (define @t13 () (@list @t1 @t8))
% 28.14/28.32  (define @t14 () (tptp.set_intersection2 @t1 @t8))
% 28.14/28.32  (define @t15 () (tptp.relation_restriction @t1 @t8))
% 28.14/28.32  (define @t16 () (tptp.cartesian_product2 @t8 @t8))
% 28.14/28.32  (define @t17 () (forall @t9 (= @t15 (tptp.set_intersection2 @t1 @t16))))
% 28.14/28.32  (define @t18 () (forall @t5 (=> @t3 @t17)))
% 28.14/28.32  (define @t19 () (@var "C" $$unsorted))
% 28.14/28.32  (define @t20 () (= (tptp.in @t1 (tptp.relation_restriction @t19 @t8)) (and (tptp.in @t1 @t19) (tptp.in @t1 @t16))))
% 28.14/28.32  (define @t21 () (tptp.relation @t19))
% 28.14/28.32  (define @t22 () (@list @t1 @t8 @t19))
% 28.14/28.32  (define @t23 () (forall @t22 (=> @t21 @t20)))
% 28.14/28.32  (define @t24 () (not @t23))
% 28.14/28.32  (define @t25 () (@var "D" $$unsorted))
% 28.14/28.32  (define @t26 () (@list @t25))
% 28.14/28.32  (define @t27 () (forall @t26 (= (tptp.in @t25 @t19) (and (tptp.in @t25 @t1) (tptp.in @t25 @t8)))))
% 28.14/28.32  (define @t28 () (= (= @t19 @t14) @t27))
% 28.14/28.32  (define @t29 () (forall @t22 @t28))
% 28.14/28.32  (define @t30 () (forall @t22 (or (not @t21) @t20)))
% 28.14/28.32  (define @t31 () (@quantifiers_skolemize @t30 1))
% 28.14/28.32  (define @t32 () (tptp.cartesian_product2 @t31 @t31))
% 28.14/28.32  (define @t33 () (@quantifiers_skolemize @t30 0))
% 28.14/28.32  (define @t34 () (@quantifiers_skolemize @t30 2))
% 28.14/28.32  (define @t35 () (and (tptp.in @t33 @t34) (tptp.in @t33 @t32)))
% 28.14/28.32  (define @t36 () (tptp.relation_restriction @t34 @t31))
% 28.14/28.32  (define @t37 () (tptp.in @t33 @t36))
% 28.14/28.32  (define @t38 () (= @t37 @t35))
% 28.14/28.32  (define @t39 () (tptp.relation @t34))
% 28.14/28.32  (define @t40 () (not @t39))
% 28.14/28.32  (define @t41 () (or @t40 @t38))
% 28.14/28.32  (define @t42 () (@list true))
% 28.14/28.32  (define @t43 () (@list @t41))
% 28.14/28.32  (define @t44 () (= @t14 @t19))
% 28.14/28.32  (define @t45 () (tptp.in @t25 @t36))
% 28.14/28.32  (define @t46 () (and (tptp.in @t25 @t34) (tptp.in @t25 @t32)))
% 28.14/28.32  (define @t47 () (forall @t26 (= @t45 @t46)))
% 28.14/28.32  (define @t48 () (tptp.set_intersection2 @t34 @t32))
% 28.14/28.32  (define @t49 () (= @t48 @t36))
% 28.14/28.32  (define @t50 () (forall @t22 (= @t27 @t44)))
% 28.14/28.32  (define @t51 () (= @t47 @t49))
% 28.14/28.32  (define @t52 () (forall @t26 (= @t46 @t45)))
% 28.14/28.32  (define @t53 () (= @t36 @t48))
% 28.14/28.32  (define @t54 () (= @t53 @t52))
% 28.14/28.32  (define @t55 () (@var "BOUND_VARIABLE_7589" $$unsorted))
% 28.14/28.32  (define @t56 () (= (tptp.relation_restriction @t1 @t55) (tptp.set_intersection2 @t1 (tptp.cartesian_product2 @t55 @t55))))
% 28.14/28.32  (define @t57 () (not @t3))
% 28.14/28.32  (define @t58 () (or @t57 @t56))
% 28.14/28.32  (define @t59 () (@list @t55))
% 28.14/28.32  (define @t60 () (forall @t59 @t58))
% 28.14/28.32  (define @t61 () (forall @t59 @t56))
% 28.14/28.32  (define @t62 () (or @t57 @t61))
% 28.14/28.32  (define @t63 () (or @t40 @t53))
% 28.14/28.32  (define @t64 () (@list false false))
% 28.14/28.32  (define @t65 () (= @t35 @t37))
% 28.14/28.32  (assume @p1 (exists @t5 @t4))
% 28.14/28.32  (assume @p2 true)
% 28.14/28.32  (assume @p3 (exists @t5 (and @t3 @t2)))
% 28.14/28.32  (assume @p4 (exists @t5 @t7))
% 28.14/28.32  (assume @p5 (forall @t5 (=> @t7 @t4)))
% 28.14/28.32  (assume @p6 (tptp.empty tptp.empty_set))
% 28.14/28.32  (assume @p7 (forall @t5 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set)))
% 28.14/28.32  (assume @p8 (forall @t5 (exists @t9 (tptp.element @t8 @t1))))
% 28.14/28.32  (assume @p9 (forall @t5 (=> @t6 @t2)))
% 28.14/28.32  (assume @p10 (exists @t5 @t6))
% 28.14/28.32  (assume @p11 (exists @t5 (not @t6)))
% 28.14/28.32  (assume @p12 (forall @t13 (=> @t12 (or @t11 @t10))))
% 28.14/28.32  (assume @p13 (forall @t5 (=> @t6 (= @t1 tptp.empty_set))))
% 28.14/28.32  (assume @p14 (forall @t13 (not (and @t6 (not (= @t1 @t8)) @t11))))
% 28.14/28.32  (assume @p15 (forall @t13 (= @t14 (tptp.set_intersection2 @t8 @t1))))
% 28.14/28.32  (assume @p16 (forall @t13 (= (tptp.set_intersection2 @t1 @t1) @t1)))
% 28.14/28.32  (assume @p17 (forall @t13 (=> @t10 (not (tptp.in @t8 @t1)))))
% 28.14/28.32  (assume @p18 (forall @t13 (=> @t3 (tptp.relation @t15))))
% 28.14/28.32  (assume @p19 (forall @t13 (=> @t10 @t12)))
% 28.14/28.32  (assume @p20 (forall @t13 (not (and @t10 @t11))))
% 28.14/28.32  (assume @p21 @t18)
% 28.14/28.32  (assume @p22 @t24)
% 28.14/28.32  (assume @p23 @t29)
% 28.14/28.32  (step @p24 :rule bool-impl-elim :args (@t21 @t20))
% 28.14/28.32  (step @p25 :rule cong :premises (@p24) :args (@t23))
% 28.14/28.32  (step @p26 :rule cong :premises (@p25) :args (@t24))
% 28.14/28.32  (step @p27 :rule eq_resolve :premises (@p22 @p26))
% 28.14/28.32  (step @p28 :rule skolemize :premises (@p27))
% 28.14/28.32  (step @p29 :rule cnf_or_neg :args (@t41 1))
% 28.14/28.32  (step @p30 :rule chain_m_resolution :premises (@p29 @p28) :args ((not @t38) @t42 @t43))
% 28.14/28.32  (step @p31 :rule eq-symm :args (@t44 @t27))
% 28.14/28.32  (step @p32 :rule refl :args (@t27))
% 28.14/28.32  (step @p33 :rule eq-symm :args (@t19 @t14))
% 28.14/28.32  (step @p34 :rule cong :premises (@p33 @p32) :args (@t28))
% 28.14/28.32  (step @p35 :rule trans :premises (@p34 @p31))
% 28.14/28.32  (step @p36 :rule cong :premises (@p35) :args (@t29))
% 28.14/28.32  (step @p37 :rule eq_resolve :premises (@p23 @p36))
% 28.14/28.32  (step @p38 :rule eq-symm :args (@t45 @t46))
% 28.14/28.32  (step @p39 :rule cong :premises (@p38) :args (@t47))
% 28.14/28.32  (step @p40 :rule eq-symm :args (@t48 @t36))
% 28.14/28.32  (step @p41 :rule cong :premises (@p40 @p39) :args ((= @t49 @t47)))
% 28.14/28.32  (step @p42 :rule eq-symm :args (@t47 @t49))
% 28.14/28.32  (step @p43 :rule trans :premises (@p42 @p41))
% 28.14/28.32  (step @p44 :rule refl :args (@t50))
% 28.14/28.32  (step @p45 :rule cong :premises (@p44 @p43) :args ((=> @t50 @t51)))
% 28.14/28.32  (assume-push @p91 @t50)
% 28.14/28.32  (step @p47 :rule instantiate :premises (@p37) :args ((@list @t34 @t32 @t36)))
% 28.14/28.32  (step-pop @p92 :rule scope :premises (@p47))
% 28.14/28.32  (step @p48 :rule process_scope :premises (@p92) :args (@t51))
% 28.14/28.32  (step @p50 :rule eq_resolve :premises (@p48 @p45))
% 28.14/28.32  (step @p51 :rule implies_elim :premises (@p50))
% 28.14/28.32  (step @p52 :rule chain_m_resolution :premises (@p51 @p37) :args (@t54 (@list false) (@list @t50)))
% 28.14/28.32  (step @p53 :rule quant-merge-prenex :args ((= (forall @t5 @t60) (forall (@list @t1 @t55) @t58))))
% 28.14/28.32  (step @p54 :rule alpha_equiv :args (@t61 (@list @t55) (@list @t8)))
% 28.14/28.32  (step @p55 :rule refl :args (@t57))
% 28.14/28.32  (step @p56 :rule nary_cong :premises (@p55 @p54) :args (@t62))
% 28.14/28.32  (step @p57 :rule quant-miniscope-or :args ((= @t60 @t62)))
% 28.14/28.32  (step @p58 :rule trans :premises (@p57 @p56))
% 28.14/28.32  (step @p59 :rule symm :premises (@p58))
% 28.14/28.32  (step @p60 :rule cong :premises (@p59) :args ((forall @t5 (or @t57 @t17))))
% 28.14/28.32  (step @p61 :rule trans :premises (@p60 @p53))
% 28.14/28.32  (step @p62 :rule bool-impl-elim :args (@t3 @t17))
% 28.14/28.32  (step @p63 :rule cong :premises (@p62) :args (@t18))
% 28.14/28.32  (step @p64 :rule trans :premises (@p63 @p61))
% 28.14/28.32  (step @p65 :rule eq_resolve :premises (@p21 @p64))
% 28.14/28.32  (step @p66 :rule instantiate :premises (@p65) :args ((@list @t34 @t31)))
% 28.14/28.32  (step @p67 :rule bool-double-not-elim :args (@t39))
% 28.14/28.32  (step @p68 :rule refl :args (@t41))
% 28.14/28.32  (step @p69 :rule nary_cong :premises (@p68 @p67) :args ((or @t41 (not @t40))))
% 28.14/28.32  (step @p70 :rule cnf_or_neg :args (@t41 0))
% 28.14/28.32  (step @p71 :rule eq_resolve :premises (@p70 @p69))
% 28.14/28.32  (step @p72 :rule reordering :premises (@p71) :args ((or @t39 @t41)))
% 28.14/28.32  (step @p73 :rule chain_m_resolution :premises (@p72 @p28) :args (@t39 @t42 @t43))
% 28.14/28.32  (step @p74 :rule cnf_or_pos :args (@t63))
% 28.14/28.32  (step @p75 :rule reordering :premises (@p74) :args ((or @t40 @t53 (not @t63))))
% 28.14/28.32  (step @p76 :rule chain_m_resolution :premises (@p75 @p73 @p66) :args (@t53 @t64 (@list @t39 @t63)))
% 28.14/28.32  (step @p77 :rule cnf_equiv_pos1 :args (@t54))
% 28.14/28.32  (step @p78 :rule reordering :premises (@p77) :args ((or (not @t53) @t52 (not @t54))))
% 28.14/28.32  (step @p79 :rule chain_m_resolution :premises (@p78 @p76 @p52) :args (@t52 @t64 (@list @t53 @t54)))
% 28.14/28.32  (step @p80 :rule eq-symm :args (@t35 @t37))
% 28.14/28.32  (step @p81 :rule refl :args (@t52))
% 28.14/28.32  (step @p82 :rule cong :premises (@p81 @p80) :args ((=> @t52 @t65)))
% 28.14/28.32  (assume-push @p93 @t52)
% 28.14/28.32  (step @p84 :rule instantiate :premises (@p79) :args ((@list @t33)))
% 28.14/28.33  (step-pop @p94 :rule scope :premises (@p84))
% 28.14/28.33  (step @p85 :rule process_scope :premises (@p94) :args (@t65))
% 28.14/28.33  (step @p87 :rule eq_resolve :premises (@p85 @p82))
% 28.14/28.33  (step @p88 :rule implies_elim :premises (@p87))
% 28.14/28.33  (step @p89 :rule reordering :premises (@p88) :args ((or @t38 (not @t52))))
% 28.14/28.33  (step @p90 false :rule chain_m_resolution :premises (@p89 @p79 @p30) :args (false (@list false true) (@list @t52 @t38)))
% 28.14/28.33  )
% 28.14/28.33  % SZS output end Proof
% 28.14/28.33  % cvc5 exiting
%------------------------------------------------------------------------------