↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n018.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:09:25 AM UTC 2026

% Result   : Unsatisfiable 0.30s 0.55s
% Output   : Proof 0.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CAT013-3 : TPTP v9.2.1. Released v1.0.0.
% 0.13/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n018.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 : Wed Jun  3 02:55:05 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.30/0.51  --- 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.a $$unsorted)
% 0.30/0.55  (declare-const tptp.f1 (-> $$unsorted $$unsorted $$unsorted))
% 0.30/0.55  (declare-const tptp.codomain (-> $$unsorted $$unsorted))
% 0.30/0.55  (declare-const tptp.domain (-> $$unsorted $$unsorted))
% 0.30/0.55  (declare-const tptp.equivalent (-> $$unsorted $$unsorted Bool))
% 0.30/0.55  (declare-const tptp.compose (-> $$unsorted $$unsorted $$unsorted))
% 0.30/0.55  (declare-const tptp.there_exists (-> $$unsorted Bool))
% 0.30/0.55  (define @t1 () (@var "X" $$unsorted))
% 0.30/0.55  (define @t2 () (tptp.there_exists @t1))
% 0.30/0.55  (define @t3 () (@var "Y" $$unsorted))
% 0.30/0.55  (define @t4 () (tptp.equivalent @t1 @t3))
% 0.30/0.55  (define @t5 () (not @t4))
% 0.30/0.55  (define @t6 () (@list @t1 @t3))
% 0.30/0.55  (define @t7 () (= @t1 @t3))
% 0.30/0.55  (define @t8 () (not @t7))
% 0.30/0.55  (define @t9 () (not @t2))
% 0.30/0.55  (define @t10 () (tptp.domain @t1))
% 0.30/0.55  (define @t11 () (tptp.there_exists @t10))
% 0.30/0.55  (define @t12 () (not @t11))
% 0.30/0.55  (define @t13 () (@list @t1))
% 0.30/0.55  (define @t14 () (tptp.codomain @t1))
% 0.30/0.55  (define @t15 () (tptp.there_exists @t14))
% 0.30/0.55  (define @t16 () (tptp.compose @t1 @t3))
% 0.30/0.55  (define @t17 () (tptp.there_exists @t16))
% 0.30/0.55  (define @t18 () (not @t17))
% 0.30/0.55  (define @t19 () (= @t10 (tptp.codomain @t3)))
% 0.30/0.55  (define @t20 () (forall @t6 (or @t18 @t19)))
% 0.30/0.55  (define @t21 () (@var "Z" $$unsorted))
% 0.30/0.55  (define @t22 () (tptp.compose @t14 @t1))
% 0.30/0.55  (define @t23 () (forall @t13 (= @t22 @t1)))
% 0.30/0.55  (define @t24 () (tptp.there_exists @t3))
% 0.30/0.55  (define @t25 () (tptp.f1 @t1 @t3))
% 0.30/0.55  (define @t26 () (= @t3 @t25))
% 0.30/0.55  (define @t27 () (= @t1 @t25))
% 0.30/0.55  (define @t28 () (tptp.codomain tptp.a))
% 0.30/0.55  (define @t29 () (tptp.there_exists @t28))
% 0.30/0.55  (define @t30 () (tptp.domain @t28))
% 0.30/0.55  (define @t31 () (= @t30 @t28))
% 0.30/0.55  (define @t32 () (@list tptp.a))
% 0.30/0.55  (define @t33 () (tptp.there_exists tptp.a))
% 0.30/0.55  (define @t34 () (not @t29))
% 0.30/0.55  (define @t35 () (or @t34 @t33))
% 0.30/0.55  (define @t36 () (tptp.there_exists (tptp.compose @t28 tptp.a)))
% 0.30/0.55  (define @t37 () (= @t28 @t30))
% 0.30/0.55  (define @t38 () (not @t36))
% 0.30/0.55  (define @t39 () (or @t38 @t37))
% 0.30/0.55  (define @t40 () (not @t39))
% 0.30/0.55  (define @t41 () (@list true false))
% 0.30/0.55  (define @t42 () (or @t38 @t31))
% 0.30/0.55  (assume @p1 (forall @t6 (or @t5 @t2)))
% 0.30/0.55  (assume @p2 (forall @t6 (or @t5 @t7)))
% 0.30/0.55  (assume @p3 (forall @t6 (or @t9 @t8 @t4)))
% 0.30/0.55  (assume @p4 (forall @t13 (or @t12 @t2)))
% 0.30/0.55  (assume @p5 (forall @t13 (or (not @t15) @t2)))
% 0.30/0.55  (assume @p6 (forall @t6 (or @t18 @t11)))
% 0.30/0.55  (assume @p7 @t20)
% 0.30/0.55  (assume @p8 (forall @t6 (or @t12 (not @t19) @t17)))
% 0.30/0.55  (assume @p9 (forall (@list @t1 @t3 @t21) (= (tptp.compose @t1 (tptp.compose @t3 @t21)) (tptp.compose @t16 @t21))))
% 0.30/0.55  (assume @p10 (forall @t13 (= (tptp.compose @t1 @t10) @t1)))
% 0.30/0.55  (assume @p11 @t23)
% 0.30/0.55  (assume @p12 (forall @t6 (or @t5 @t24)))
% 0.30/0.55  (assume @p13 (forall @t6 (or @t9 (not @t24) @t8 @t4)))
% 0.30/0.55  (assume @p14 (forall @t6 (or @t18 @t15)))
% 0.30/0.55  (assume @p15 (forall @t6 (or (tptp.there_exists @t25) @t7)))
% 0.30/0.55  (assume @p16 (forall @t6 (or @t27 @t26 @t7)))
% 0.30/0.55  (assume @p17 (forall @t6 (or (not @t27) (not @t26) @t7)))
% 0.30/0.55  (assume @p18 @t29)
% 0.30/0.55  (assume @p19 (not @t31))
% 0.30/0.55  (step @p20 :rule instantiate :premises (@p5) :args (@t32))
% 0.30/0.55  (step @p21 :rule cnf_or_pos :args (@t35))
% 0.30/0.55  (step @p22 :rule reordering :premises (@p21) :args ((or @t34 @t33 (not @t35))))
% 0.30/0.55  (step @p23 :rule chain_m_resolution :premises (@p22 @p18 @p20) :args (@t33 (@list false false) (@list @t29 @t35)))
% 0.30/0.55  (step @p24 :rule true_intro :premises (@p23))
% 0.30/0.55  (step @p25 :rule eq-symm :args (@t22 @t1))
% 0.30/0.55  (step @p26 :rule cong :premises (@p25) :args (@t23))
% 0.30/0.55  (step @p27 :rule eq_resolve :premises (@p11 @p26))
% 0.30/0.55  (step @p28 :rule instantiate :premises (@p27) :args (@t32))
% 0.30/0.55  (step @p29 :rule symm :premises (@p28))
% 0.30/0.55  (step @p30 :rule cong :premises (@p29) :args (@t36))
% 0.30/0.55  (step @p31 :rule trans :premises (@p30 @p24))
% 0.30/0.55  (step @p32 :rule true_elim :premises (@p31))
% 0.30/0.55  (step @p33 :rule symm :premises (@p19))
% 0.30/0.55  (step @p34 :rule cnf_or_pos :args (@t39))
% 0.30/0.55  (step @p35 :rule reordering :premises (@p34) :args ((or @t37 @t38 @t40)))
% 0.30/0.55  (step @p36 :rule chain_m_resolution :premises (@p35 @p33 @p32) :args (@t40 @t41 (@list @t37 @t36)))
% 0.30/0.55  (step @p37 :rule eq-symm :args (@t30 @t28))
% 0.30/0.55  (step @p38 :rule refl :args (@t38))
% 0.30/0.55  (step @p39 :rule nary_cong :premises (@p38 @p37) :args (@t42))
% 0.30/0.55  (step @p40 :rule refl :args (@t20))
% 0.30/0.55  (step @p41 :rule cong :premises (@p40 @p39) :args ((=> @t20 @t42)))
% 0.30/0.55  (assume-push @p49 @t20)
% 0.30/0.55  (step @p43 :rule instantiate :premises (@p7) :args ((@list @t28 tptp.a)))
% 0.30/0.55  (step-pop @p50 :rule scope :premises (@p43))
% 0.30/0.55  (step @p44 :rule process_scope :premises (@p50) :args (@t42))
% 0.30/0.55  (step @p46 :rule eq_resolve :premises (@p44 @p41))
% 0.30/0.55  (step @p47 :rule implies_elim :premises (@p46))
% 0.30/0.55  (step @p48 false :rule chain_m_resolution :premises (@p47 @p36 @p7) :args (false @t41 (@list @t39 @t20)))
% 0.30/0.55  )
% 0.37/0.56  % SZS output end Proof
% 0.37/0.56  % cvc5 exiting
%------------------------------------------------------------------------------