%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWX206-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n004.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 09:07:22 AM UTC 2026 % Result : Unsatisfiable 0.30s 0.55s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX206-1 : TPTP v9.3.0. Released v9.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 : n004.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 23:08:07 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Unsatisfiable % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.eq (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.eq2 (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.x2 (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.z $$unsorted) % 0.30/0.55 (declare-const tptp.bfalse $$unsorted) % 0.30/0.55 (declare-const tptp.s (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.impl (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.plus_not_idem (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.btrue $$unsorted) % 0.30/0.55 (define @t1 () (@var "Q" $$unsorted)) % 0.30/0.55 (define @t2 () (tptp.impl tptp.btrue @t1)) % 0.30/0.55 (define @t3 () (@list @t1)) % 0.30/0.55 (define @t4 () (forall @t3 (= @t2 @t1))) % 0.30/0.55 (define @t5 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t6 () (tptp.x2 tptp.z @t5)) % 0.30/0.55 (define @t7 () (forall (@list @t5) (= @t6 @t5))) % 0.30/0.55 (define @t8 () (@var "N" $$unsorted)) % 0.30/0.55 (define @t9 () (tptp.eq2 tptp.btrue tptp.bfalse)) % 0.30/0.55 (define @t10 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t11 () (tptp.plus_not_idem @t10)) % 0.30/0.55 (define @t12 () (@list @t10)) % 0.30/0.55 (define @t13 () (tptp.s @t10)) % 0.30/0.55 (define @t14 () (tptp.eq @t10 @t10)) % 0.30/0.55 (define @t15 () (forall @t12 (= @t14 tptp.btrue))) % 0.30/0.55 (define @t16 () (tptp.eq2 @t10 @t10)) % 0.30/0.55 (define @t17 () (forall @t12 (= @t16 tptp.btrue))) % 0.30/0.55 (define @t18 () (tptp.eq2 @t11 tptp.bfalse)) % 0.30/0.55 (define @t19 () (not (= @t18 tptp.btrue))) % 0.30/0.55 (define @t20 () (forall @t12 @t19)) % 0.30/0.55 (define @t21 () (@list tptp.z)) % 0.30/0.55 (define @t22 () (tptp.eq2 tptp.bfalse tptp.bfalse)) % 0.30/0.55 (define @t23 () (= tptp.btrue @t22)) % 0.30/0.55 (define @t24 () (forall @t12 (= tptp.btrue @t16))) % 0.30/0.55 (assume @p1 @t4) % 0.30/0.55 (assume @p2 (forall @t3 (= (tptp.impl tptp.bfalse @t1) tptp.btrue))) % 0.30/0.55 (assume @p3 @t7) % 0.30/0.55 (assume @p4 (forall (@list @t8 @t5) (= (tptp.x2 (tptp.s @t8) @t5) (tptp.s (tptp.x2 @t8 @t5))))) % 0.30/0.55 (assume @p5 (forall @t12 (= @t11 (tptp.impl (tptp.eq (tptp.x2 @t10 @t10) @t10) @t9)))) % 0.30/0.55 (assume @p6 (= (tptp.eq2 tptp.bfalse tptp.btrue) tptp.bfalse)) % 0.30/0.55 (assume @p7 (= @t9 tptp.bfalse)) % 0.30/0.55 (assume @p8 (forall (@list @t10 @t5) (= (tptp.eq @t13 (tptp.s @t5)) (tptp.eq @t10 @t5)))) % 0.30/0.55 (assume @p9 (forall @t12 (= (tptp.eq tptp.z @t13) tptp.bfalse))) % 0.30/0.55 (assume @p10 (forall @t12 (= (tptp.eq @t13 tptp.z) tptp.bfalse))) % 0.30/0.55 (assume @p11 @t15) % 0.30/0.55 (assume @p12 @t17) % 0.30/0.55 (assume @p13 @t20) % 0.30/0.55 (step @p14 :rule eq-symm :args (@t16 tptp.btrue)) % 0.30/0.55 (step @p15 :rule cong :premises (@p14) :args (@t17)) % 0.30/0.55 (step @p16 :rule eq_resolve :premises (@p12 @p15)) % 0.30/0.55 (step @p17 :rule eq-symm :args (@t18 tptp.btrue)) % 0.30/0.55 (step @p18 :rule cong :premises (@p17) :args (@t19)) % 0.30/0.55 (step @p19 :rule cong :premises (@p18) :args (@t20)) % 0.30/0.55 (step @p20 :rule eq_resolve :premises (@p13 @p19)) % 0.30/0.55 (step @p21 :rule instantiate :premises (@p20) :args (@t21)) % 0.30/0.55 (step @p22 :rule false_intro :premises (@p21)) % 0.30/0.55 (step @p23 :rule refl :args (tptp.bfalse)) % 0.30/0.55 (step @p24 :rule instantiate :premises (@p5) :args (@t21)) % 0.30/0.55 (step @p25 :rule symm :premises (@p24)) % 0.30/0.55 (step @p26 :rule refl :args (@t9)) % 0.30/0.55 (step @p27 :rule refl :args (tptp.z)) % 0.30/0.55 (step @p28 :rule eq-symm :args (@t6 @t5)) % 0.30/0.55 (step @p29 :rule cong :premises (@p28) :args (@t7)) % 0.30/0.55 (step @p30 :rule eq_resolve :premises (@p3 @p29)) % 0.30/0.55 (step @p31 :rule instantiate :premises (@p30) :args (@t21)) % 0.30/0.55 (step @p32 :rule cong :premises (@p31 @p27) :args ((tptp.eq tptp.z tptp.z))) % 0.30/0.55 (step @p33 :rule eq-symm :args (@t14 tptp.btrue)) % 0.30/0.55 (step @p34 :rule cong :premises (@p33) :args (@t15)) % 0.30/0.55 (step @p35 :rule eq_resolve :premises (@p11 @p34)) % 0.30/0.55 (step @p36 :rule instantiate :premises (@p35) :args (@t21)) % 0.30/0.55 (step @p37 :rule trans :premises (@p36 @p32)) % 0.30/0.55 (step @p38 :rule cong :premises (@p37 @p26) :args ((tptp.impl tptp.btrue @t9))) % 0.30/0.55 (step @p39 :rule eq-symm :args (@t2 @t1)) % 0.30/0.55 (step @p40 :rule cong :premises (@p39) :args (@t4)) % 0.30/0.55 (step @p41 :rule eq_resolve :premises (@p1 @p40)) % 0.30/0.55 (step @p42 :rule instantiate :premises (@p41) :args ((@list @t9))) % 0.30/0.55 (step @p43 :rule symm :premises (@p7)) % 0.30/0.55 (step @p44 :rule trans :premises (@p43 @p42 @p38 @p25)) % 0.30/0.55 (step @p45 :rule cong :premises (@p44 @p23) :args (@t22)) % 0.30/0.55 (step @p46 :rule refl :args (tptp.btrue)) % 0.30/0.55 (step @p47 :rule cong :premises (@p46 @p45) :args (@t23)) % 0.30/0.55 (step @p48 :rule trans :premises (@p47 @p22)) % 0.30/0.55 (step @p49 :rule false_elim :premises (@p48)) % 0.30/0.55 (assume-push @p56 @t24) % 0.30/0.55 (step @p51 :rule instantiate :premises (@p16) :args ((@list tptp.bfalse))) % 0.30/0.55 (step-pop @p57 :rule scope :premises (@p51)) % 0.30/0.55 (step @p52 :rule process_scope :premises (@p57) :args (@t23)) % 0.30/0.55 (step @p54 :rule implies_elim :premises (@p52)) % 0.30/0.55 (step @p55 false :rule chain_m_resolution :premises (@p54 @p49 @p16) :args (false (@list true false) (@list @t23 @t24))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.33/0.56 % cvc5 exiting %------------------------------------------------------------------------------