↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU560^2 : TPTP v9.2.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n015.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:52:12 AM UTC 2026

% Result   : Theorem 0.30s 0.54s
% Output   : Proof 0.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU560^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n015.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 17:41:49 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.30/0.48  %----Proving TH0
% 0.30/0.54  --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s...
% 0.30/0.54  % SZS status Theorem
% 0.30/0.54  % SZS output start Proof
% 0.30/0.54  (
% 0.30/0.54  (declare-sort $$unsorted 0)
% 0.30/0.54  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.subsetI1 Bool)
% 0.30/0.54  (define tptp.subset () (let ((_let_1 (@var "B" $$unsorted))) (let ((_let_2 (@var "Xx" $$unsorted))) (let ((_let_3 (_ tptp.in _let_2))) (let ((_let_4 (@var "A" $$unsorted))) (lambda (@list _let_4 _let_1) (forall (@list _let_2) (=> (_ _let_3 _let_4) (_ _let_3 _let_1)))))))))
% 0.30/0.54  (define @t1 () (@var "B" $$unsorted))
% 0.30/0.54  (define @t2 () (@var "A" $$unsorted))
% 0.30/0.54  (define @t3 () (@var "Xx" $$unsorted))
% 0.30/0.54  (define @t4 () (_ tptp.in @t3))
% 0.30/0.54  (define @t5 () (_ @t4 @t1))
% 0.30/0.54  (define @t6 () (_ @t4 @t2))
% 0.30/0.54  (define @t7 () (@list @t3))
% 0.30/0.54  (define @t8 () (forall @t7 (=> @t6 @t5)))
% 0.30/0.54  (define @t9 () (@list @t2 @t1))
% 0.30/0.54  (define @t10 () (= @t2 @t1))
% 0.30/0.54  (define @t11 () (=> @t10 (_ (_ tptp.subset @t1) @t2)))
% 0.30/0.54  (define @t12 () (forall @t9 @t11))
% 0.30/0.54  (define @t13 () (=> tptp.subsetI1 @t12))
% 0.30/0.54  (define @t14 () (not @t13))
% 0.30/0.54  (define @t15 () (lambda @t9 @t8))
% 0.30/0.54  (define @t16 () (@var "BOUND_VARIABLE_7495" $$unsorted))
% 0.30/0.54  (define @t17 () (@list @t1 @t16))
% 0.30/0.54  (define @t18 () (tptp.in @t16 @t1))
% 0.30/0.54  (define @t19 () (not @t18))
% 0.30/0.54  (define @t20 () (or @t19 @t18))
% 0.30/0.54  (define @t21 () (not (= @t1 @t1)))
% 0.30/0.54  (define @t22 () (or @t21 @t19 @t18))
% 0.30/0.54  (define @t23 () (tptp.in @t16 @t2))
% 0.30/0.54  (define @t24 () (not @t10))
% 0.30/0.54  (define @t25 () (or @t24 @t24 @t19 @t23))
% 0.30/0.54  (define @t26 () (@list @t2))
% 0.30/0.54  (define @t27 () (or @t24 @t19 @t23))
% 0.30/0.54  (define @t28 () (forall @t26 @t27))
% 0.30/0.54  (define @t29 () (forall @t17 @t28))
% 0.30/0.54  (define @t30 () (forall (@list @t1 @t16 @t2) @t27))
% 0.30/0.54  (define @t31 () (@list @t2 @t1 @t16))
% 0.30/0.54  (define @t32 () (or @t19 @t23))
% 0.30/0.54  (define @t33 () (or @t24 @t32))
% 0.30/0.54  (define @t34 () (forall @t31 @t33))
% 0.30/0.54  (define @t35 () (@list @t16))
% 0.30/0.54  (define @t36 () (forall @t35 @t33))
% 0.30/0.54  (define @t37 () (forall @t35 @t32))
% 0.30/0.54  (define @t38 () (or @t24 @t37))
% 0.30/0.54  (define @t39 () (tptp.in @t3 @t2))
% 0.30/0.54  (define @t40 () (tptp.in @t3 @t1))
% 0.30/0.54  (define @t41 () (not @t40))
% 0.30/0.54  (define @t42 () (forall @t7 (or @t41 @t39)))
% 0.30/0.54  (define @t43 () (@var "BOUND_VARIABLE_7473" $$unsorted))
% 0.30/0.54  (define @t44 () (tptp.in @t3 @t43))
% 0.30/0.54  (define @t45 () (lambda (@list @t43) (forall @t7 (or @t41 @t44))))
% 0.30/0.54  (define @t46 () (not @t39))
% 0.30/0.54  (define @t47 () (lambda @t9 (forall @t7 (or @t46 @t40))))
% 0.30/0.54  (define @t48 () (=> @t10 (_ (_ @t47 @t1) @t2)))
% 0.30/0.54  (define @t49 () (forall @t9 @t48))
% 0.30/0.54  (define @t50 () (=> tptp.subsetI1 @t49))
% 0.30/0.54  (define @t51 () (not @t6))
% 0.30/0.54  (define @t52 () (or @t51 @t5))
% 0.30/0.54  (assume @p1 (= tptp.subsetI1 (forall @t9 (=> @t8 (_ (_ tptp.subset @t2) @t1)))))
% 0.30/0.54  (assume @p2 @t14)
% 0.30/0.54  (assume @p3 true)
% 0.30/0.54  (step @p4 (= tptp.subset @t15) :rule refl :args (@t15))
% 0.30/0.54  (step @p5 :rule evaluate :args ((not true)))
% 0.30/0.54  (step @p6 :rule bool-impl-true1 :args (tptp.subsetI1))
% 0.30/0.54  (step @p7 :rule quant-unused-vars :args ((= (forall @t17 true) true)))
% 0.30/0.54  (step @p8 :rule bool-or-taut2 :args (false @t18 false false))
% 0.30/0.54  (step @p9 :rule cong :premises (@p8) :args ((forall @t17 @t20)))
% 0.30/0.54  (step @p10 :rule trans :premises (@p9 @p7))
% 0.30/0.54  (step @p11 :rule aci_norm :args ((= (or false @t19 @t18) @t20)))
% 0.30/0.54  (step @p12 :rule refl :args (@t18))
% 0.30/0.54  (step @p13 :rule refl :args (@t19))
% 0.30/0.54  (step @p14 :rule eq-refl :args (@t1))
% 0.30/0.54  (step @p15 :rule cong :premises (@p14) :args (@t21))
% 0.30/0.54  (step @p16 :rule trans :premises (@p15 @p5))
% 0.30/0.54  (step @p17 :rule nary_cong :premises (@p16 @p13 @p12) :args (@t22))
% 0.30/0.54  (step @p18 :rule trans :premises (@p17 @p11))
% 0.30/0.54  (step @p19 :rule cong :premises (@p18) :args ((forall @t17 @t22)))
% 0.30/0.54  (step @p20 :rule trans :premises (@p19 @p10))
% 0.30/0.54  (step @p21 :rule quant-var-elim-eq :args ((= (forall @t26 @t25) @t22)))
% 0.30/0.54  (step @p22 :rule aci_norm :args ((= @t27 @t25)))
% 0.30/0.54  (step @p23 :rule cong :premises (@p22) :args (@t28))
% 0.30/0.54  (step @p24 :rule trans :premises (@p23 @p21))
% 0.30/0.54  (step @p25 :rule cong :premises (@p24) :args (@t29))
% 0.30/0.54  (step @p26 :rule quant-merge-prenex :args ((= @t29 @t30)))
% 0.30/0.54  (step @p27 :rule symm :premises (@p26))
% 0.30/0.54  (step @p28 :rule quant_var_reordering :args ((= (forall @t31 @t27) @t30)))
% 0.30/0.54  (step @p29 :rule trans :premises (@p28 @p27 @p25))
% 0.30/0.54  (step @p30 :rule trans :premises (@p29 @p20))
% 0.30/0.54  (step @p31 :rule aci_norm :args ((= @t33 @t27)))
% 0.30/0.55  (step @p32 :rule cong :premises (@p31) :args (@t34))
% 0.30/0.55  (step @p33 :rule trans :premises (@p32 @p30))
% 0.30/0.55  (step @p34 :rule quant-merge-prenex :args ((= (forall @t9 @t36) @t34)))
% 0.30/0.55  (step @p35 :rule alpha_equiv :args (@t37 (@list @t16) (@list @t3)))
% 0.30/0.55  (step @p36 :rule refl :args (@t24))
% 0.30/0.55  (step @p37 :rule nary_cong :premises (@p36 @p35) :args (@t38))
% 0.30/0.55  (step @p38 :rule quant-miniscope-or :args ((= @t36 @t38)))
% 0.30/0.55  (step @p39 :rule trans :premises (@p38 @p37))
% 0.30/0.55  (step @p40 :rule symm :premises (@p39))
% 0.30/0.55  (step @p41 :rule cong :premises (@p40) :args ((forall @t9 (or @t24 @t42))))
% 0.30/0.55  (step @p42 :rule trans :premises (@p41 @p34))
% 0.30/0.55  (step @p43 :rule trans :premises (@p42 @p33))
% 0.30/0.55  (step @p44 :rule bool-impl-elim :args (@t10 @t42))
% 0.30/0.55  (step @p45 :rule cong :premises (@p44) :args ((forall @t9 (=> @t10 @t42))))
% 0.30/0.55  (step @p46 :rule trans :premises (@p45 @p43))
% 0.30/0.55  (step @p47 :rule beta-reduce :args ((= (_ @t45 @t2) @t42)))
% 0.30/0.55  (step @p48 :rule refl :args (@t2))
% 0.30/0.55  (step @p49 :rule beta-reduce :args ((= (_ (lambda (@list @t2 @t43) (forall @t7 (or @t46 @t44))) @t1) @t45)))
% 0.30/0.55  (step @p50 :rule refl :args (@t1))
% 0.30/0.55  (step @p51 :rule alpha_equiv :args (@t47 (@list @t1) (@list @t43)))
% 0.30/0.55  (step @p52 :rule ho_cong :premises (@p51 @p50))
% 0.30/0.55  (step @p53 :rule trans :premises (@p52 @p49))
% 0.30/0.55  (step @p54 :rule ho_cong :premises (@p53 @p48))
% 0.30/0.55  (step @p55 :rule trans :premises (@p54 @p47))
% 0.30/0.55  (step @p56 :rule refl :args (@t10))
% 0.30/0.55  (step @p57 :rule cong :premises (@p56 @p55) :args (@t48))
% 0.30/0.55  (step @p58 :rule cong :premises (@p57) :args (@t49))
% 0.30/0.55  (step @p59 :rule trans :premises (@p58 @p46))
% 0.30/0.55  (step @p60 :rule refl :args (tptp.subsetI1))
% 0.30/0.55  (step @p61 :rule cong :premises (@p60 @p59) :args (@t50))
% 0.30/0.55  (step @p62 :rule trans :premises (@p61 @p6))
% 0.30/0.55  (step @p63 :rule cong :premises (@p62) :args ((not @t50)))
% 0.30/0.55  (step @p64 :rule trans :premises (@p63 @p5))
% 0.30/0.55  (step @p65 :rule refl :args (@t1))
% 0.30/0.55  (step @p66 :rule refl :args (@t40))
% 0.30/0.55  (step @p67 :rule refl :args (@t5))
% 0.30/0.55  (step @p68 :rule cong :premises (@p67 @p66) :args ((= @t5 @t40)))
% 0.30/0.55  (step @p69 :rule symm :premises (@p68))
% 0.30/0.55  (step @p70 :rule eq_resolve :premises (@p67 @p69))
% 0.30/0.55  (step @p71 :rule refl :args (@t39))
% 0.30/0.55  (step @p72 :rule refl :args (@t6))
% 0.30/0.55  (step @p73 :rule cong :premises (@p72 @p71) :args ((= @t6 @t39)))
% 0.30/0.55  (step @p74 :rule symm :premises (@p73))
% 0.30/0.55  (step @p75 :rule eq_resolve :premises (@p72 @p74))
% 0.30/0.55  (step @p76 :rule cong :premises (@p75) :args (@t51))
% 0.30/0.55  (step @p77 :rule nary_cong :premises (@p76 @p70) :args (@t52))
% 0.30/0.55  (step @p78 :rule cong :premises (@p77) :args ((forall @t7 @t52)))
% 0.30/0.55  (step @p79 :rule bool-impl-elim :args (@t6 @t5))
% 0.30/0.55  (step @p80 :rule cong :premises (@p79) :args (@t8))
% 0.30/0.55  (step @p81 :rule trans :premises (@p80 @p78))
% 0.30/0.55  (step @p82 :rule cong :premises (@p81) :args (@t15))
% 0.30/0.55  (step @p83 :rule trans :premises (@p4 @p82))
% 0.30/0.55  (step @p84 :rule ho_cong :premises (@p83 @p65))
% 0.30/0.55  (step @p85 :rule ho_cong :premises (@p84 @p48))
% 0.30/0.55  (step @p86 :rule cong :premises (@p56 @p85) :args (@t11))
% 0.30/0.55  (step @p87 :rule cong :premises (@p86) :args (@t12))
% 0.30/0.55  (step @p88 :rule cong :premises (@p60 @p87) :args (@t13))
% 0.30/0.55  (step @p89 :rule cong :premises (@p88) :args (@t14))
% 0.30/0.55  (step @p90 :rule trans :premises (@p89 @p64))
% 0.30/0.55  (step @p91 false :rule eq_resolve :premises (@p2 @p90))
% 0.30/0.55  )
% 0.30/0.55  % SZS output end Proof
% 0.30/0.55  % cvc5 exiting
%------------------------------------------------------------------------------