↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n025.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:47: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  : SET063+3 : TPTP v9.2.1. Released v2.2.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.34  % Computer : n025.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Tue Jun  2 14:50:01 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.30/0.54  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 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.empty (-> $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.member (-> $$unsorted $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.empty_set $$unsorted)
% 0.30/0.54  (define @t1 () (@var "B" $$unsorted))
% 0.30/0.54  (define @t2 () (@list @t1))
% 0.30/0.54  (define @t3 () (forall @t2 (tptp.subset tptp.empty_set @t1)))
% 0.30/0.54  (define @t4 () (@var "C" $$unsorted))
% 0.30/0.54  (define @t5 () (@var "D" $$unsorted))
% 0.30/0.54  (define @t6 () (tptp.subset @t1 @t4))
% 0.30/0.54  (define @t7 () (@list @t1 @t4))
% 0.30/0.54  (define @t8 () (forall @t7 (= (= @t1 @t4) (and @t6 (tptp.subset @t4 @t1)))))
% 0.30/0.54  (define @t9 () (tptp.subset @t1 tptp.empty_set))
% 0.30/0.54  (define @t10 () (=> @t9 (= @t1 tptp.empty_set)))
% 0.30/0.54  (define @t11 () (forall @t2 @t10))
% 0.30/0.54  (define @t12 () (not @t11))
% 0.30/0.54  (define @t13 () (= tptp.empty_set @t1))
% 0.30/0.54  (define @t14 () (@quantifiers_skolemize (forall @t2 (or (not @t9) @t13)) 0))
% 0.30/0.54  (define @t15 () (tptp.subset tptp.empty_set @t14))
% 0.30/0.54  (define @t16 () (tptp.subset @t14 tptp.empty_set))
% 0.30/0.54  (define @t17 () (and @t16 @t15))
% 0.30/0.54  (define @t18 () (= (= @t14 tptp.empty_set) @t17))
% 0.30/0.54  (define @t19 () (= tptp.empty_set @t14))
% 0.30/0.54  (define @t20 () (= @t19 @t17))
% 0.30/0.54  (define @t21 () (not @t16))
% 0.30/0.54  (define @t22 () (or @t21 @t19))
% 0.30/0.54  (define @t23 () (@list true))
% 0.30/0.54  (define @t24 () (@list @t22))
% 0.30/0.54  (define @t25 () (not @t17))
% 0.30/0.54  (define @t26 () (@list true false))
% 0.30/0.54  (define @t27 () (not @t15))
% 0.30/0.54  (assume @p1 @t3)
% 0.30/0.54  (assume @p2 (forall @t2 (not (tptp.member @t1 tptp.empty_set))))
% 0.30/0.54  (assume @p3 (forall @t7 (= @t6 (forall (@list @t5) (=> (tptp.member @t5 @t1) (tptp.member @t5 @t4))))))
% 0.30/0.54  (assume @p4 @t8)
% 0.30/0.54  (assume @p5 (forall @t2 (tptp.subset @t1 @t1)))
% 0.30/0.54  (assume @p6 (forall @t2 (= (tptp.empty @t1) (forall (@list @t4) (not (tptp.member @t4 @t1))))))
% 0.30/0.54  (assume @p7 @t12)
% 0.30/0.54  (assume @p8 true)
% 0.30/0.54  (step @p9 :rule refl :args (@t17))
% 0.30/0.54  (step @p10 :rule eq-symm :args (@t14 tptp.empty_set))
% 0.30/0.54  (step @p11 :rule cong :premises (@p10 @p9) :args (@t18))
% 0.30/0.54  (step @p12 :rule refl :args (@t8))
% 0.30/0.54  (step @p13 :rule cong :premises (@p12 @p11) :args ((=> @t8 @t18)))
% 0.30/0.54  (assume-push @p52 @t8)
% 0.30/0.54  (step @p15 :rule instantiate :premises (@p4) :args ((@list @t14 tptp.empty_set)))
% 0.30/0.54  (step-pop @p53 :rule scope :premises (@p15))
% 0.30/0.54  (step @p16 :rule process_scope :premises (@p53) :args (@t18))
% 0.30/0.54  (step @p18 :rule eq_resolve :premises (@p16 @p13))
% 0.30/0.54  (step @p19 :rule implies_elim :premises (@p18))
% 0.30/0.54  (step @p20 :rule chain_m_resolution :premises (@p19 @p4) :args (@t20 (@list false) (@list @t8)))
% 0.30/0.54  (step @p21 :rule bool-impl-elim :args (@t9 @t13))
% 0.30/0.54  (step @p22 :rule cong :premises (@p21) :args ((forall @t2 (=> @t9 @t13))))
% 0.30/0.54  (step @p23 :rule eq-symm :args (@t1 tptp.empty_set))
% 0.30/0.54  (step @p24 :rule refl :args (@t9))
% 0.30/0.54  (step @p25 :rule cong :premises (@p24 @p23) :args (@t10))
% 0.30/0.54  (step @p26 :rule cong :premises (@p25) :args (@t11))
% 0.30/0.54  (step @p27 :rule trans :premises (@p26 @p22))
% 0.30/0.54  (step @p28 :rule cong :premises (@p27) :args (@t12))
% 0.30/0.54  (step @p29 :rule eq_resolve :premises (@p7 @p28))
% 0.30/0.54  (step @p30 :rule skolemize :premises (@p29))
% 0.30/0.54  (step @p31 :rule cnf_or_neg :args (@t22 1))
% 0.30/0.54  (step @p32 :rule chain_m_resolution :premises (@p31 @p30) :args ((not @t19) @t23 @t24))
% 0.30/0.54  (step @p33 :rule cnf_equiv_pos2 :args (@t20))
% 0.30/0.54  (step @p34 :rule reordering :premises (@p33) :args ((or @t19 @t25 (not @t20))))
% 0.30/0.54  (step @p35 :rule chain_m_resolution :premises (@p34 @p32 @p20) :args (@t25 @t26 (@list @t19 @t20)))
% 0.30/0.54  (step @p36 :rule bool-double-not-elim :args (@t16))
% 0.30/0.54  (step @p37 :rule refl :args (@t22))
% 0.30/0.54  (step @p38 :rule nary_cong :premises (@p37 @p36) :args ((or @t22 (not @t21))))
% 0.30/0.54  (step @p39 :rule cnf_or_neg :args (@t22 0))
% 0.30/0.54  (step @p40 :rule eq_resolve :premises (@p39 @p38))
% 0.30/0.54  (step @p41 :rule reordering :premises (@p40) :args ((or @t16 @t22)))
% 0.30/0.54  (step @p42 :rule chain_m_resolution :premises (@p41 @p30) :args (@t16 @t23 @t24))
% 0.30/0.54  (step @p43 :rule cnf_and_neg :args (@t17))
% 0.30/0.54  (step @p44 :rule reordering :premises (@p43) :args ((or @t21 @t17 @t27)))
% 0.30/0.54  (step @p45 :rule chain_m_resolution :premises (@p44 @p42 @p35) :args (@t27 (@list false true) (@list @t16 @t17)))
% 0.30/0.54  (assume-push @p54 @t3)
% 0.30/0.54  (step @p47 :rule instantiate :premises (@p1) :args ((@list @t14)))
% 0.30/0.55  (step-pop @p55 :rule scope :premises (@p47))
% 0.30/0.55  (step @p48 :rule process_scope :premises (@p55) :args (@t15))
% 0.30/0.55  (step @p50 :rule implies_elim :premises (@p48))
% 0.30/0.55  (step @p51 false :rule chain_m_resolution :premises (@p50 @p45 @p1) :args (false @t26 (@list @t15 @t3)))
% 0.30/0.55  )
% 0.30/0.55  % SZS output end Proof
% 0.30/0.55  % cvc5 exiting
%------------------------------------------------------------------------------