↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n019.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:44 AM UTC 2026

% Result   : Theorem 0.37s 0.58s
% Output   : Proof 0.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU152+2 : TPTP v9.2.1. Released v3.3.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 : n019.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 16:32:49 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.37/0.58  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.37/0.58  % SZS status Theorem
% 0.37/0.58  % SZS output start Proof
% 0.37/0.58  (
% 0.37/0.58  (declare-sort $$unsorted 0)
% 0.37/0.58  (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool))
% 0.37/0.58  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.37/0.58  (declare-const tptp.empty_set $$unsorted)
% 0.37/0.58  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 0.37/0.58  (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted))
% 0.37/0.58  (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted))
% 0.37/0.58  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 0.37/0.58  (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool))
% 0.37/0.58  (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted))
% 0.37/0.58  (declare-const tptp.powerset (-> $$unsorted $$unsorted))
% 0.37/0.58  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.37/0.58  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.37/0.58  (define @t1 () (@var "A" $$unsorted))
% 0.37/0.58  (define @t2 () (@var "B" $$unsorted))
% 0.37/0.58  (define @t3 () (not (tptp.in @t2 @t1)))
% 0.37/0.58  (define @t4 () (tptp.in @t1 @t2))
% 0.37/0.58  (define @t5 () (@list @t1 @t2))
% 0.37/0.58  (define @t6 () (tptp.proper_subset @t2 @t1))
% 0.37/0.58  (define @t7 () (tptp.proper_subset @t1 @t2))
% 0.37/0.58  (define @t8 () (tptp.unordered_pair @t1 @t2))
% 0.37/0.58  (define @t9 () (tptp.set_union2 @t2 @t1))
% 0.37/0.58  (define @t10 () (tptp.set_union2 @t1 @t2))
% 0.37/0.58  (define @t11 () (tptp.set_intersection2 @t1 @t2))
% 0.37/0.58  (define @t12 () (tptp.subset @t1 @t2))
% 0.37/0.58  (define @t13 () (= @t1 @t2))
% 0.37/0.58  (define @t14 () (@var "C" $$unsorted))
% 0.37/0.58  (define @t15 () (tptp.in @t14 @t2))
% 0.37/0.58  (define @t16 () (@list @t14))
% 0.37/0.58  (define @t17 () (tptp.singleton @t1))
% 0.37/0.58  (define @t18 () (= @t1 tptp.empty_set))
% 0.37/0.58  (define @t19 () (@list @t1))
% 0.37/0.58  (define @t20 () (@var "D" $$unsorted))
% 0.37/0.58  (define @t21 () (tptp.in @t20 @t14))
% 0.37/0.58  (define @t22 () (@list @t20))
% 0.37/0.58  (define @t23 () (@list @t1 @t2 @t14))
% 0.37/0.58  (define @t24 () (tptp.in @t20 @t2))
% 0.37/0.58  (define @t25 () (tptp.in @t20 @t1))
% 0.37/0.58  (define @t26 () (tptp.in @t14 @t1))
% 0.37/0.58  (define @t27 () (tptp.set_difference @t1 @t2))
% 0.37/0.58  (define @t28 () (tptp.disjoint @t1 @t2))
% 0.37/0.58  (define @t29 () (not @t13))
% 0.37/0.58  (define @t30 () (tptp.empty @t1))
% 0.37/0.58  (define @t31 () (not @t30))
% 0.37/0.58  (define @t32 () (tptp.set_union2 @t17 @t2))
% 0.37/0.58  (define @t33 () (=> @t4 (= @t32 @t2)))
% 0.37/0.58  (define @t34 () (forall @t5 @t33))
% 0.37/0.58  (define @t35 () (not @t34))
% 0.37/0.58  (define @t36 () (tptp.subset @t17 @t2))
% 0.37/0.58  (define @t37 () (forall @t5 (= @t36 @t4)))
% 0.37/0.58  (define @t38 () (tptp.singleton @t2))
% 0.37/0.58  (define @t39 () (=> @t12 (= @t10 @t2)))
% 0.37/0.58  (define @t40 () (forall @t5 @t39))
% 0.37/0.58  (define @t41 () (tptp.set_intersection2 @t2 @t14))
% 0.37/0.58  (define @t42 () (tptp.subset @t1 @t14))
% 0.37/0.58  (define @t43 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1)))
% 0.37/0.58  (define @t44 () (and @t26 @t15))
% 0.37/0.58  (define @t45 () (not @t28))
% 0.37/0.58  (define @t46 () (tptp.in @t14 @t11))
% 0.37/0.58  (define @t47 () (tptp.empty @t2))
% 0.37/0.58  (define @t48 () (= @t17 (tptp.unordered_pair @t2 @t14)))
% 0.37/0.58  (define @t49 () (= @t2 @t32))
% 0.37/0.58  (define @t50 () (forall @t5 (or (not @t4) @t49)))
% 0.37/0.58  (define @t51 () (@quantifiers_skolemize @t50 1))
% 0.37/0.58  (define @t52 () (@quantifiers_skolemize @t50 0))
% 0.37/0.58  (define @t53 () (tptp.singleton @t52))
% 0.37/0.58  (define @t54 () (= @t51 (tptp.set_union2 @t53 @t51)))
% 0.37/0.58  (define @t55 () (tptp.in @t52 @t51))
% 0.37/0.58  (define @t56 () (not @t55))
% 0.37/0.58  (define @t57 () (or @t56 @t54))
% 0.37/0.58  (define @t58 () (@list true))
% 0.37/0.58  (define @t59 () (@list @t57))
% 0.37/0.58  (define @t60 () (= @t2 @t10))
% 0.37/0.58  (define @t61 () (tptp.subset @t53 @t51))
% 0.37/0.58  (define @t62 () (= @t55 @t61))
% 0.37/0.58  (define @t63 () (not @t61))
% 0.37/0.58  (define @t64 () (or @t63 @t54))
% 0.37/0.58  (assume @p1 (forall @t5 (=> @t4 @t3)))
% 0.37/0.58  (assume @p2 (forall @t5 (=> @t7 (not @t6))))
% 0.37/0.58  (assume @p3 (forall @t5 (= @t8 (tptp.unordered_pair @t2 @t1))))
% 0.37/0.58  (assume @p4 (forall @t5 (= @t10 @t9)))
% 0.37/0.58  (assume @p5 (forall @t5 (= @t11 (tptp.set_intersection2 @t2 @t1))))
% 0.37/0.58  (assume @p6 (forall @t5 (= @t13 (and @t12 (tptp.subset @t2 @t1)))))
% 0.37/0.58  (assume @p7 (forall @t5 (= (= @t2 @t17) (forall @t16 (= @t15 (= @t14 @t1))))))
% 0.37/0.58  (assume @p8 (forall @t19 (= @t18 (forall (@list @t2) @t3))))
% 0.37/0.58  (assume @p9 (forall @t5 (= (= @t2 (tptp.powerset @t1)) (forall @t16 (= @t15 (tptp.subset @t14 @t1))))))
% 0.37/0.58  (assume @p10 (forall @t23 (= (= @t14 @t8) (forall @t22 (= @t21 (or (= @t20 @t1) (= @t20 @t2)))))))
% 0.37/0.58  (assume @p11 (forall @t23 (= (= @t14 @t10) (forall @t22 (= @t21 (or @t25 @t24))))))
% 0.37/0.58  (assume @p12 (forall @t5 (= @t12 (forall @t16 (=> @t26 @t15)))))
% 0.37/0.58  (assume @p13 (forall @t23 (= (= @t14 @t11) (forall @t22 (= @t21 (and @t25 @t24))))))
% 0.37/0.58  (assume @p14 (forall @t23 (= (= @t14 @t27) (forall @t22 (= @t21 (and @t25 (not @t24)))))))
% 0.37/0.58  (assume @p15 (forall @t5 (= @t28 (= @t11 tptp.empty_set))))
% 0.37/0.58  (assume @p16 (forall @t5 (= @t7 (and @t12 @t29))))
% 0.37/0.58  (assume @p17 true)
% 0.37/0.58  (assume @p18 (tptp.empty tptp.empty_set))
% 0.37/0.58  (assume @p19 (forall @t5 (=> @t31 (not (tptp.empty @t10)))))
% 0.37/0.58  (assume @p20 (forall @t5 (=> @t31 (not (tptp.empty @t9)))))
% 0.37/0.58  (assume @p21 (forall @t5 (= (tptp.set_union2 @t1 @t1) @t1)))
% 0.37/0.58  (assume @p22 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1)))
% 0.37/0.58  (assume @p23 (forall @t5 (not (tptp.proper_subset @t1 @t1))))
% 0.37/0.58  (assume @p24 (forall @t19 (not (= @t17 tptp.empty_set))))
% 0.37/0.58  (assume @p25 @t35)
% 0.37/0.58  (assume @p26 @t37)
% 0.37/0.58  (assume @p27 (forall @t5 (= (= @t27 tptp.empty_set) @t12)))
% 0.37/0.58  (assume @p28 (forall @t23 (=> @t12 (or @t26 (tptp.subset @t1 (tptp.set_difference @t2 (tptp.singleton @t14)))))))
% 0.37/0.58  (assume @p29 (forall @t5 (= (tptp.subset @t1 @t38) (or @t18 (= @t1 @t38)))))
% 0.37/0.58  (assume @p30 (exists @t19 @t30))
% 0.37/0.58  (assume @p31 (exists @t19 @t31))
% 0.37/0.58  (assume @p32 (forall @t5 (tptp.subset @t1 @t1)))
% 0.37/0.58  (assume @p33 (forall @t5 (=> @t28 (tptp.disjoint @t2 @t1))))
% 0.37/0.58  (assume @p34 (forall (@list @t1 @t2 @t14 @t20) (not (and (= @t8 (tptp.unordered_pair @t14 @t20)) (not (= @t1 @t14)) (not (= @t1 @t20))))))
% 0.37/0.58  (assume @p35 @t40)
% 0.37/0.58  (assume @p36 (forall @t5 (tptp.subset @t11 @t1)))
% 0.37/0.58  (assume @p37 (forall @t23 (=> (and @t12 @t42) (tptp.subset @t1 @t41))))
% 0.37/0.58  (assume @p38 (forall @t19 (= (tptp.set_union2 @t1 tptp.empty_set) @t1)))
% 0.37/0.58  (assume @p39 (forall @t23 (=> (and @t12 (tptp.subset @t2 @t14)) @t42)))
% 0.37/0.58  (assume @p40 (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set)))
% 0.37/0.58  (assume @p41 (forall @t23 (=> @t12 (tptp.subset (tptp.set_intersection2 @t1 @t14) @t41))))
% 0.37/0.58  (assume @p42 (forall @t5 (=> @t12 (= @t11 @t1))))
% 0.37/0.58  (assume @p43 (forall @t19 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set)))
% 0.37/0.58  (assume @p44 (forall @t5 (=> (forall @t16 (= @t26 @t15)) @t13)))
% 0.37/0.58  (assume @p45 (forall @t19 (tptp.subset tptp.empty_set @t1)))
% 0.37/0.58  (assume @p46 (forall @t23 (=> @t12 (tptp.subset (tptp.set_difference @t1 @t14) (tptp.set_difference @t2 @t14)))))
% 0.37/0.58  (assume @p47 (forall @t5 (tptp.subset @t27 @t1)))
% 0.37/0.58  (assume @p48 (forall @t5 (= @t43 @t10)))
% 0.37/0.58  (assume @p49 (forall @t19 (= (tptp.set_difference @t1 tptp.empty_set) @t1)))
% 0.37/0.58  (assume @p50 (forall @t5 (and (not (and @t45 (forall @t16 (not @t44)))) (not (and (exists @t16 @t44) @t28)))))
% 0.37/0.58  (assume @p51 (forall @t19 (=> (tptp.subset @t1 tptp.empty_set) @t18)))
% 0.37/0.58  (assume @p52 (forall @t5 (= (tptp.set_difference @t10 @t2) @t27)))
% 0.37/0.58  (assume @p53 (forall @t5 (=> @t12 (= @t2 @t43))))
% 0.37/0.58  (assume @p54 (forall @t5 (= (tptp.set_difference @t1 @t27) @t11)))
% 0.37/0.58  (assume @p55 (forall @t19 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set)))
% 0.37/0.58  (assume @p56 (forall @t5 (and (not (and @t45 (forall @t16 (not @t46)))) (not (and (exists @t16 @t46) @t28)))))
% 0.37/0.58  (assume @p57 (forall @t5 (not (and @t12 @t6))))
% 0.37/0.58  (assume @p58 (forall @t23 (=> (and @t12 (tptp.disjoint @t2 @t14)) (tptp.disjoint @t1 @t14))))
% 0.37/0.58  (assume @p59 (forall @t19 (= (tptp.unordered_pair @t1 @t1) @t17)))
% 0.37/0.58  (assume @p60 (forall @t19 (=> @t30 @t18)))
% 0.37/0.58  (assume @p61 (forall @t5 (=> (tptp.subset @t17 @t38) @t13)))
% 0.37/0.58  (assume @p62 (forall @t5 (not (and @t4 @t47))))
% 0.37/0.58  (assume @p63 (forall @t5 (tptp.subset @t1 @t10)))
% 0.37/0.58  (assume @p64 (forall @t5 (= @t28 (= @t27 @t1))))
% 0.37/0.58  (assume @p65 (forall @t5 (not (and @t30 @t29 @t47))))
% 0.37/0.58  (assume @p66 (forall @t23 (=> (and @t12 (tptp.subset @t14 @t2)) (tptp.subset (tptp.set_union2 @t1 @t14) @t2))))
% 0.37/0.58  (assume @p67 (forall @t23 (=> @t48 @t13)))
% 0.37/0.58  (assume @p68 (forall @t23 (=> @t48 (= @t2 @t14))))
% 0.37/0.58  (step @p69 :rule bool-impl-elim :args (@t4 @t49))
% 0.37/0.58  (step @p70 :rule cong :premises (@p69) :args ((forall @t5 (=> @t4 @t49))))
% 0.37/0.58  (step @p71 :rule eq-symm :args (@t32 @t2))
% 0.37/0.58  (step @p72 :rule refl :args (@t4))
% 0.37/0.58  (step @p73 :rule cong :premises (@p72 @p71) :args (@t33))
% 0.37/0.58  (step @p74 :rule cong :premises (@p73) :args (@t34))
% 0.37/0.58  (step @p75 :rule trans :premises (@p74 @p70))
% 0.37/0.58  (step @p76 :rule cong :premises (@p75) :args (@t35))
% 0.37/0.58  (step @p77 :rule eq_resolve :premises (@p25 @p76))
% 0.37/0.58  (step @p78 :rule skolemize :premises (@p77))
% 0.37/0.58  (step @p79 :rule cnf_or_neg :args (@t57 1))
% 0.37/0.58  (step @p80 :rule chain_m_resolution :premises (@p79 @p78) :args ((not @t54) @t58 @t59))
% 0.37/0.58  (step @p81 :rule bool-impl-elim :args (@t12 @t60))
% 0.37/0.58  (step @p82 :rule cong :premises (@p81) :args ((forall @t5 (=> @t12 @t60))))
% 0.37/0.58  (step @p83 :rule eq-symm :args (@t10 @t2))
% 0.37/0.58  (step @p84 :rule refl :args (@t12))
% 0.37/0.58  (step @p85 :rule cong :premises (@p84 @p83) :args (@t39))
% 0.37/0.58  (step @p86 :rule cong :premises (@p85) :args (@t40))
% 0.37/0.58  (step @p87 :rule trans :premises (@p86 @p82))
% 0.37/0.58  (step @p88 :rule eq_resolve :premises (@p35 @p87))
% 0.37/0.58  (step @p89 :rule instantiate :premises (@p88) :args ((@list @t53 @t51)))
% 0.37/0.58  (step @p90 :rule eq-symm :args (@t36 @t4))
% 0.37/0.58  (step @p91 :rule cong :premises (@p90) :args (@t37))
% 0.37/0.58  (step @p92 :rule eq_resolve :premises (@p26 @p91))
% 0.37/0.58  (step @p93 :rule instantiate :premises (@p92) :args ((@list @t52 @t51)))
% 0.37/0.58  (step @p94 :rule bool-double-not-elim :args (@t55))
% 0.37/0.58  (step @p95 :rule refl :args (@t57))
% 0.37/0.58  (step @p96 :rule nary_cong :premises (@p95 @p94) :args ((or @t57 (not @t56))))
% 0.37/0.58  (step @p97 :rule cnf_or_neg :args (@t57 0))
% 0.37/0.58  (step @p98 :rule eq_resolve :premises (@p97 @p96))
% 0.37/0.58  (step @p99 :rule reordering :premises (@p98) :args ((or @t55 @t57)))
% 0.37/0.58  (step @p100 :rule chain_m_resolution :premises (@p99 @p78) :args (@t55 @t58 @t59))
% 0.37/0.58  (step @p101 :rule cnf_equiv_pos1 :args (@t62))
% 0.37/0.58  (step @p102 :rule reordering :premises (@p101) :args ((or @t56 @t61 (not @t62))))
% 0.37/0.58  (step @p103 :rule chain_m_resolution :premises (@p102 @p100 @p93) :args (@t61 (@list false false) (@list @t55 @t62)))
% 0.37/0.58  (step @p104 :rule cnf_or_pos :args (@t64))
% 0.37/0.58  (step @p105 :rule reordering :premises (@p104) :args ((or @t54 @t63 (not @t64))))
% 0.37/0.58  (step @p106 false :rule chain_m_resolution :premises (@p105 @p103 @p89 @p80) :args (false (@list false false true) (@list @t61 @t64 @t54)))
% 0.37/0.58  )
% 0.37/0.58  % SZS output end Proof
% 0.37/0.58  % cvc5 exiting
%------------------------------------------------------------------------------