↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n012.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:48:15 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SET618+3 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.07  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.26  % Computer : n012.cluster.edu
% 0.09/0.26  % Model    : x86_64 x86_64
% 0.09/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.26  % Memory   : 8042.1875MB
% 0.09/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.26  % CPULimit : 300
% 0.09/0.26  % WCLimit  : 300
% 0.09/0.26  % DateTime : Tue Jun  2 16:05:03 EDT 2026
% 0.09/0.26  % CPUTime  : 
% 0.16/0.34  %----Proving TF0_NAR, FOF, or CNF
% 0.16/0.37  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.16/0.37  % SZS status Theorem
% 0.16/0.37  % SZS output start Proof
% 0.16/0.37  (
% 0.16/0.37  (declare-sort $$unsorted 0)
% 0.16/0.37  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.16/0.37  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.16/0.37  (declare-const tptp.member (-> $$unsorted $$unsorted Bool))
% 0.16/0.37  (declare-const tptp.empty_set $$unsorted)
% 0.16/0.37  (declare-const tptp.symmetric_difference (-> $$unsorted $$unsorted $$unsorted))
% 0.16/0.37  (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted))
% 0.16/0.37  (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted))
% 0.16/0.37  (define @t1 () (@var "B" $$unsorted))
% 0.16/0.37  (define @t2 () (@var "C" $$unsorted))
% 0.16/0.37  (define @t3 () (tptp.symmetric_difference @t1 @t2))
% 0.16/0.37  (define @t4 () (@list @t1 @t2))
% 0.16/0.37  (define @t5 () (tptp.union @t1 @t1))
% 0.16/0.37  (define @t6 () (@list @t1))
% 0.16/0.37  (define @t7 () (forall @t6 (= @t5 @t1)))
% 0.16/0.37  (define @t8 () (tptp.difference @t1 @t1))
% 0.16/0.37  (define @t9 () (forall @t6 (= @t8 tptp.empty_set)))
% 0.16/0.37  (define @t10 () (tptp.subset @t1 @t2))
% 0.16/0.37  (define @t11 () (= @t1 @t2))
% 0.16/0.37  (define @t12 () (@var "D" $$unsorted))
% 0.16/0.37  (define @t13 () (tptp.member @t12 @t2))
% 0.16/0.37  (define @t14 () (tptp.member @t12 @t1))
% 0.16/0.37  (define @t15 () (@list @t12))
% 0.16/0.37  (define @t16 () (tptp.symmetric_difference @t1 @t1))
% 0.16/0.37  (define @t17 () (forall @t6 (= @t16 tptp.empty_set)))
% 0.16/0.37  (define @t18 () (not @t17))
% 0.16/0.37  (define @t19 () (@quantifiers_skolemize (forall @t6 (= tptp.empty_set @t16)) 0))
% 0.16/0.37  (define @t20 () (tptp.difference @t19 @t19))
% 0.16/0.37  (define @t21 () (= tptp.empty_set @t20))
% 0.16/0.37  (define @t22 () (not @t21))
% 0.16/0.37  (define @t23 () (tptp.union @t20 @t20))
% 0.16/0.37  (define @t24 () (= @t20 @t23))
% 0.16/0.37  (define @t25 () (not @t24))
% 0.16/0.37  (define @t26 () (tptp.symmetric_difference @t19 @t19))
% 0.16/0.37  (define @t27 () (= @t26 @t23))
% 0.16/0.37  (define @t28 () (not @t27))
% 0.16/0.37  (define @t29 () (= tptp.empty_set @t26))
% 0.16/0.37  (define @t30 () (not @t29))
% 0.16/0.37  (define @t31 () (and @t30 @t27 @t24))
% 0.16/0.37  (assume @p1 (forall @t4 (= @t3 (tptp.union (tptp.difference @t1 @t2) (tptp.difference @t2 @t1)))))
% 0.16/0.37  (assume @p2 @t7)
% 0.16/0.37  (assume @p3 @t9)
% 0.16/0.37  (assume @p4 (forall @t6 (not (tptp.member @t1 tptp.empty_set))))
% 0.16/0.37  (assume @p5 (forall @t4 (= @t11 (and @t10 (tptp.subset @t2 @t1)))))
% 0.16/0.37  (assume @p6 (forall @t4 (= (tptp.union @t1 @t2) (tptp.union @t2 @t1))))
% 0.16/0.37  (assume @p7 (forall @t4 (= @t3 (tptp.symmetric_difference @t2 @t1))))
% 0.16/0.37  (assume @p8 (forall @t4 (= @t11 (forall @t15 (= @t14 @t13)))))
% 0.16/0.37  (assume @p9 (forall @t4 (= @t10 (forall @t15 (=> @t14 @t13)))))
% 0.16/0.37  (assume @p10 (forall @t6 (tptp.subset @t1 @t1)))
% 0.16/0.37  (assume @p11 (forall @t6 (= (tptp.empty @t1) (forall (@list @t2) (not (tptp.member @t2 @t1))))))
% 0.16/0.37  (assume @p12 @t18)
% 0.16/0.37  (assume @p13 true)
% 0.16/0.37  (step @p14 :rule eq-symm :args (@t16 tptp.empty_set))
% 0.16/0.37  (step @p15 :rule cong :premises (@p14) :args (@t17))
% 0.16/0.37  (step @p16 :rule cong :premises (@p15) :args (@t18))
% 0.16/0.37  (step @p17 :rule eq_resolve :premises (@p12 @p16))
% 0.16/0.37  (step @p18 :rule skolemize :premises (@p17))
% 0.16/0.37  (step @p19 :rule instantiate :premises (@p1) :args ((@list @t19 @t19)))
% 0.16/0.37  (step @p20 :rule eq-symm :args (@t5 @t1))
% 0.16/0.37  (step @p21 :rule cong :premises (@p20) :args (@t7))
% 0.16/0.37  (step @p22 :rule eq_resolve :premises (@p2 @p21))
% 0.16/0.37  (step @p23 :rule instantiate :premises (@p22) :args ((@list @t20)))
% 0.16/0.37  (step @p24 :rule eq-symm :args (@t8 tptp.empty_set))
% 0.16/0.37  (step @p25 :rule cong :premises (@p24) :args (@t9))
% 0.16/0.37  (step @p26 :rule eq_resolve :premises (@p3 @p25))
% 0.16/0.37  (step @p27 :rule instantiate :premises (@p26) :args ((@list @t19)))
% 0.16/0.37  (step @p28 :rule refl :args (@t22))
% 0.16/0.37  (step @p29 :rule refl :args (@t25))
% 0.16/0.37  (step @p30 :rule refl :args (@t28))
% 0.16/0.37  (step @p31 :rule bool-double-not-elim :args (@t29))
% 0.16/0.37  (step @p32 :rule nary_cong :premises (@p31 @p30 @p29 @p28) :args ((or (not @t30) @t28 @t25 @t22)))
% 0.16/0.37  (assume-push @p52 @t30)
% 0.16/0.37  (assume-push @p53 @t27)
% 0.16/0.37  (assume-push @p54 @t24)
% 0.16/0.37  (step @p36 :rule false_intro :premises (@p18))
% 0.16/0.37  (step @p37 :rule symm :premises (@p19))
% 0.16/0.37  (step @p38 :rule trans :premises (@p23 @p37))
% 0.16/0.37  (step @p39 :rule refl :args (tptp.empty_set))
% 0.16/0.37  (step @p40 :rule cong :premises (@p39 @p38) :args (@t21))
% 0.16/0.37  (step @p41 :rule trans :premises (@p40 @p36))
% 0.16/0.37  (step @p42 :rule false_elim :premises (@p41))
% 0.16/0.37  (step-pop @p55 :rule scope :premises (@p42))
% 0.16/0.37  (step-pop @p56 :rule scope :premises (@p55))
% 0.16/0.37  (step-pop @p57 :rule scope :premises (@p56))
% 0.16/0.37  (step @p43 :rule process_scope :premises (@p57) :args (@t22))
% 0.16/0.37  (step @p47 :rule implies_elim :premises (@p43))
% 0.16/0.37  (step @p48 :rule cnf_and_neg :args (@t31))
% 0.16/0.37  (step @p49 :rule resolution :premises (@p48 @p47) :args (true @t31))
% 0.16/0.37  (step @p50 :rule eq_resolve :premises (@p49 @p32))
% 0.16/0.37  (step @p51 false :rule chain_m_resolution :premises (@p50 @p27 @p23 @p19 @p18) :args (false (@list false false false true) (@list @t21 @t24 @t27 @t29)))
% 0.16/0.37  )
% 0.16/0.37  % SZS output end Proof
% 0.16/0.37  % cvc5 exiting
%------------------------------------------------------------------------------