↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU123+2 : 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 : 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:50:37 AM UTC 2026

% Result   : Theorem 0.38s 0.57s
% Output   : Proof 0.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU123+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.34  % Computer : n014.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:30:58 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.29/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.38/0.57  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.38/0.57  % SZS status Theorem
% 0.38/0.57  % SZS output start Proof
% 0.38/0.57  (
% 0.38/0.57  (declare-sort $$unsorted 0)
% 0.38/0.57  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.38/0.57  (declare-const tptp.empty_set $$unsorted)
% 0.38/0.57  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.38/0.57  (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool))
% 0.38/0.57  (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted))
% 0.38/0.57  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.38/0.57  (define @t1 () (@var "A" $$unsorted))
% 0.38/0.57  (define @t2 () (@var "B" $$unsorted))
% 0.38/0.57  (define @t3 () (not (tptp.in @t2 @t1)))
% 0.38/0.57  (define @t4 () (tptp.in @t1 @t2))
% 0.38/0.57  (define @t5 () (@list @t1 @t2))
% 0.38/0.57  (define @t6 () (tptp.set_intersection2 @t1 @t2))
% 0.38/0.57  (define @t7 () (tptp.subset @t1 @t2))
% 0.38/0.57  (define @t8 () (= @t1 @t2))
% 0.38/0.57  (define @t9 () (forall @t5 (= @t8 (and @t7 (tptp.subset @t2 @t1)))))
% 0.38/0.57  (define @t10 () (= @t1 tptp.empty_set))
% 0.38/0.57  (define @t11 () (@list @t1))
% 0.38/0.57  (define @t12 () (@var "C" $$unsorted))
% 0.38/0.57  (define @t13 () (tptp.in @t12 @t2))
% 0.38/0.57  (define @t14 () (tptp.in @t12 @t1))
% 0.38/0.57  (define @t15 () (@list @t12))
% 0.38/0.57  (define @t16 () (@var "D" $$unsorted))
% 0.38/0.57  (define @t17 () (@list @t1 @t2 @t12))
% 0.38/0.57  (define @t18 () (tptp.disjoint @t1 @t2))
% 0.38/0.57  (define @t19 () (tptp.empty @t1))
% 0.38/0.57  (define @t20 () (forall @t11 (tptp.subset tptp.empty_set @t1)))
% 0.38/0.57  (define @t21 () (and @t14 @t13))
% 0.38/0.57  (define @t22 () (not @t18))
% 0.38/0.57  (define @t23 () (tptp.subset @t1 tptp.empty_set))
% 0.38/0.57  (define @t24 () (forall @t11 (=> @t23 @t10)))
% 0.38/0.57  (define @t25 () (not @t24))
% 0.38/0.57  (define @t26 () (tptp.in @t12 @t6))
% 0.38/0.57  (define @t27 () (tptp.empty @t2))
% 0.38/0.57  (define @t28 () (forall @t11 (or (not @t23) @t10)))
% 0.38/0.57  (define @t29 () (@quantifiers_skolemize @t28 0))
% 0.38/0.57  (define @t30 () (tptp.subset tptp.empty_set @t29))
% 0.38/0.57  (define @t31 () (tptp.subset @t29 tptp.empty_set))
% 0.38/0.57  (define @t32 () (and @t31 @t30))
% 0.38/0.57  (define @t33 () (= @t29 tptp.empty_set))
% 0.38/0.57  (define @t34 () (= @t33 @t32))
% 0.38/0.57  (define @t35 () (= tptp.empty_set @t29))
% 0.38/0.57  (define @t36 () (= @t35 @t32))
% 0.38/0.57  (define @t37 () (not @t31))
% 0.38/0.57  (define @t38 () (or @t37 @t35))
% 0.38/0.57  (define @t39 () (not @t38))
% 0.38/0.57  (define @t40 () (not @t28))
% 0.38/0.57  (define @t41 () (or @t37 @t33))
% 0.38/0.57  (define @t42 () (not @t41))
% 0.38/0.57  (define @t43 () (@list true))
% 0.38/0.57  (define @t44 () (@list @t38))
% 0.38/0.57  (define @t45 () (not @t32))
% 0.38/0.57  (define @t46 () (@list true false))
% 0.38/0.57  (define @t47 () (not @t30))
% 0.38/0.57  (assume @p1 (forall @t5 (=> @t4 @t3)))
% 0.38/0.57  (assume @p2 (forall @t5 (= @t6 (tptp.set_intersection2 @t2 @t1))))
% 0.38/0.57  (assume @p3 @t9)
% 0.38/0.57  (assume @p4 (forall @t11 (= @t10 (forall (@list @t2) @t3))))
% 0.38/0.57  (assume @p5 (forall @t5 (= @t7 (forall @t15 (=> @t14 @t13)))))
% 0.38/0.57  (assume @p6 (forall @t17 (= (= @t12 @t6) (forall (@list @t16) (= (tptp.in @t16 @t12) (and (tptp.in @t16 @t1) (tptp.in @t16 @t2)))))))
% 0.38/0.57  (assume @p7 (forall @t5 (= @t18 (= @t6 tptp.empty_set))))
% 0.38/0.57  (assume @p8 true)
% 0.38/0.57  (assume @p9 (tptp.empty tptp.empty_set))
% 0.38/0.57  (assume @p10 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1)))
% 0.38/0.57  (assume @p11 (exists @t11 @t19))
% 0.38/0.57  (assume @p12 (exists @t11 (not @t19)))
% 0.38/0.57  (assume @p13 (forall @t5 (tptp.subset @t1 @t1)))
% 0.38/0.57  (assume @p14 (forall @t5 (=> @t18 (tptp.disjoint @t2 @t1))))
% 0.38/0.57  (assume @p15 (forall @t17 (=> (and @t7 (tptp.subset @t2 @t12)) (tptp.subset @t1 @t12))))
% 0.38/0.57  (assume @p16 @t20)
% 0.38/0.57  (assume @p17 (forall @t5 (and (not (and @t22 (forall @t15 (not @t21)))) (not (and (exists @t15 @t21) @t18)))))
% 0.38/0.57  (assume @p18 @t25)
% 0.38/0.57  (assume @p19 (forall @t5 (and (not (and @t22 (forall @t15 (not @t26)))) (not (and (exists @t15 @t26) @t18)))))
% 0.38/0.57  (assume @p20 (forall @t11 (=> @t19 @t10)))
% 0.38/0.57  (assume @p21 (forall @t5 (not (and @t4 @t27))))
% 0.38/0.57  (assume @p22 (forall @t5 (not (and @t19 (not @t8) @t27))))
% 0.38/0.57  (step @p23 :rule refl :args (@t32))
% 0.38/0.57  (step @p24 :rule eq-symm :args (@t29 tptp.empty_set))
% 0.38/0.57  (step @p25 :rule cong :premises (@p24 @p23) :args (@t34))
% 0.38/0.57  (step @p26 :rule refl :args (@t9))
% 0.38/0.57  (step @p27 :rule cong :premises (@p26 @p25) :args ((=> @t9 @t34)))
% 0.38/0.57  (assume-push @p76 @t9)
% 0.38/0.57  (step @p29 :rule instantiate :premises (@p3) :args ((@list @t29 tptp.empty_set)))
% 0.38/0.57  (step-pop @p77 :rule scope :premises (@p29))
% 0.38/0.57  (step @p30 :rule process_scope :premises (@p77) :args (@t34))
% 0.38/0.57  (step @p32 :rule eq_resolve :premises (@p30 @p27))
% 0.38/0.57  (step @p33 :rule implies_elim :premises (@p32))
% 0.38/0.57  (step @p34 :rule chain_m_resolution :premises (@p33 @p3) :args (@t36 (@list false) (@list @t9)))
% 0.38/0.57  (step @p35 :rule bool-impl-elim :args (@t23 @t10))
% 0.38/0.57  (step @p36 :rule cong :premises (@p35) :args (@t24))
% 0.38/0.57  (step @p37 :rule cong :premises (@p36) :args (@t25))
% 0.38/0.57  (step @p38 :rule eq_resolve :premises (@p18 @p37))
% 0.38/0.57  (step @p39 :rule refl :args (@t39))
% 0.38/0.57  (step @p40 :rule bool-double-not-elim :args (@t28))
% 0.38/0.57  (step @p41 :rule nary_cong :premises (@p40 @p39) :args ((or (not @t40) @t39)))
% 0.38/0.57  (step @p42 :rule refl :args (@t37))
% 0.38/0.57  (step @p43 :rule nary_cong :premises (@p42 @p24) :args (@t41))
% 0.38/0.57  (step @p44 :rule cong :premises (@p43) :args (@t42))
% 0.38/0.57  (step @p45 :rule refl :args (@t40))
% 0.38/0.57  (step @p46 :rule cong :premises (@p45 @p44) :args ((=> @t40 @t42)))
% 0.38/0.57  (assume-push @p78 @t40)
% 0.38/0.57  (step @p48 :rule skolemize :premises (@p38))
% 0.38/0.57  (step-pop @p79 :rule scope :premises (@p48))
% 0.38/0.57  (step @p49 :rule process_scope :premises (@p79) :args (@t42))
% 0.38/0.57  (step @p51 :rule eq_resolve :premises (@p49 @p46))
% 0.38/0.57  (step @p52 :rule implies_elim :premises (@p51))
% 0.38/0.57  (step @p53 :rule eq_resolve :premises (@p52 @p41))
% 0.38/0.57  (step @p54 :rule chain_m_resolution :premises (@p53 @p38) :args (@t39 @t43 (@list @t28)))
% 0.38/0.57  (step @p55 :rule cnf_or_neg :args (@t38 1))
% 0.38/0.57  (step @p56 :rule chain_m_resolution :premises (@p55 @p54) :args ((not @t35) @t43 @t44))
% 0.38/0.57  (step @p57 :rule cnf_equiv_pos2 :args (@t36))
% 0.38/0.57  (step @p58 :rule reordering :premises (@p57) :args ((or @t35 @t45 (not @t36))))
% 0.38/0.57  (step @p59 :rule chain_m_resolution :premises (@p58 @p56 @p34) :args (@t45 @t46 (@list @t35 @t36)))
% 0.38/0.57  (step @p60 :rule bool-double-not-elim :args (@t31))
% 0.38/0.57  (step @p61 :rule refl :args (@t38))
% 0.38/0.57  (step @p62 :rule nary_cong :premises (@p61 @p60) :args ((or @t38 (not @t37))))
% 0.38/0.57  (step @p63 :rule cnf_or_neg :args (@t38 0))
% 0.38/0.57  (step @p64 :rule eq_resolve :premises (@p63 @p62))
% 0.38/0.57  (step @p65 :rule reordering :premises (@p64) :args ((or @t31 @t38)))
% 0.38/0.57  (step @p66 :rule chain_m_resolution :premises (@p65 @p54) :args (@t31 @t43 @t44))
% 0.38/0.57  (step @p67 :rule cnf_and_neg :args (@t32))
% 0.38/0.57  (step @p68 :rule reordering :premises (@p67) :args ((or @t37 @t32 @t47)))
% 0.38/0.57  (step @p69 :rule chain_m_resolution :premises (@p68 @p66 @p59) :args (@t47 (@list false true) (@list @t31 @t32)))
% 0.38/0.57  (assume-push @p80 @t20)
% 0.38/0.57  (step @p71 :rule instantiate :premises (@p16) :args ((@list @t29)))
% 0.38/0.57  (step-pop @p81 :rule scope :premises (@p71))
% 0.38/0.57  (step @p72 :rule process_scope :premises (@p81) :args (@t30))
% 0.38/0.57  (step @p74 :rule implies_elim :premises (@p72))
% 0.38/0.57  (step @p75 false :rule chain_m_resolution :premises (@p74 @p69 @p16) :args (false @t46 (@list @t30 @t20)))
% 0.38/0.57  )
% 0.38/0.57  % SZS output end Proof
% 0.38/0.57  % cvc5 exiting
%------------------------------------------------------------------------------