↑ Up

cvc5---1.3.4.UNS-Prf.s

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

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

% Result   : Unsatisfiable 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  : SET845-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.34  % Computer : n015.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Tue Jun  2 16:15:04 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.30/0.48  %----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.54  % SZS status Unsatisfiable
% 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.v_m $$unsorted)
% 0.30/0.54  (declare-const tptp.v_S $$unsorted)
% 0.30/0.54  (declare-const tptp.t_a $$unsorted)
% 0.30/0.54  (declare-const tptp.c_Zorn_Osucc (-> $$unsorted $$unsorted $$unsorted $$unsorted))
% 0.30/0.54  (declare-const tptp.c_Zorn_OTFin (-> $$unsorted $$unsorted $$unsorted))
% 0.30/0.54  (declare-const tptp.c_in (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.c_lessequals (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.c_Union (-> $$unsorted $$unsorted $$unsorted))
% 0.30/0.54  (declare-const tptp.tc_set (-> $$unsorted $$unsorted))
% 0.30/0.54  (define @t1 () (@var "T_a" $$unsorted))
% 0.30/0.54  (define @t2 () (tptp.tc_set @t1))
% 0.30/0.54  (define @t3 () (@var "V_A" $$unsorted))
% 0.30/0.54  (define @t4 () (@var "V_B" $$unsorted))
% 0.30/0.54  (define @t5 () (@list @t4 @t3 @t1))
% 0.30/0.54  (define @t6 () (not (tptp.c_lessequals @t3 @t4 @t2)))
% 0.30/0.54  (define @t7 () (not (tptp.c_lessequals @t4 @t3 @t2)))
% 0.30/0.54  (define @t8 () (or @t7 @t6 (= @t3 @t4)))
% 0.30/0.54  (define @t9 () (forall @t5 @t8))
% 0.30/0.54  (define @t10 () (tptp.tc_set @t2))
% 0.30/0.54  (define @t11 () (@var "V_x" $$unsorted))
% 0.30/0.54  (define @t12 () (@var "V_S" $$unsorted))
% 0.30/0.54  (define @t13 () (tptp.c_Zorn_Osucc @t12 @t11 @t1))
% 0.30/0.54  (define @t14 () (@list @t11 @t12 @t1))
% 0.30/0.54  (define @t15 () (tptp.c_Zorn_OTFin @t12 @t1))
% 0.30/0.54  (define @t16 () (tptp.tc_set tptp.t_a))
% 0.30/0.54  (define @t17 () (tptp.tc_set @t16))
% 0.30/0.54  (define @t18 () (tptp.c_Zorn_OTFin tptp.v_S tptp.t_a))
% 0.30/0.54  (define @t19 () (tptp.c_in tptp.v_m @t18 @t17))
% 0.30/0.54  (define @t20 () (tptp.c_Union @t18 @t16))
% 0.30/0.54  (define @t21 () (= tptp.v_m @t20))
% 0.30/0.54  (define @t22 () (tptp.c_Zorn_Osucc tptp.v_S tptp.v_m tptp.t_a))
% 0.30/0.54  (define @t23 () (= tptp.v_m @t22))
% 0.30/0.54  (define @t24 () (@list tptp.v_m tptp.v_S tptp.t_a))
% 0.30/0.54  (define @t25 () (tptp.c_in @t22 @t18 @t17))
% 0.30/0.54  (define @t26 () (not @t19))
% 0.30/0.54  (define @t27 () (or @t26 @t25))
% 0.30/0.54  (define @t28 () (@list false false))
% 0.30/0.54  (define @t29 () (tptp.c_lessequals @t22 @t20 @t17))
% 0.30/0.54  (define @t30 () (not @t25))
% 0.30/0.54  (define @t31 () (or @t30 @t29))
% 0.30/0.54  (define @t32 () (tptp.c_lessequals @t22 tptp.v_m @t17))
% 0.30/0.54  (define @t33 () (not @t32))
% 0.30/0.54  (define @t34 () (tptp.c_lessequals tptp.v_m @t22 @t17))
% 0.30/0.54  (define @t35 () (not @t34))
% 0.30/0.54  (define @t36 () (or @t35 @t33 @t23))
% 0.30/0.54  (define @t37 () (@list true false false))
% 0.30/0.54  (define @t38 () (and @t21 @t29))
% 0.30/0.54  (assume @p1 (forall @t5 (or (not (tptp.c_in @t4 @t3 @t2)) (tptp.c_lessequals @t4 (tptp.c_Union @t3 @t1) @t2))))
% 0.30/0.54  (assume @p2 @t9)
% 0.30/0.54  (assume @p3 (forall @t14 (tptp.c_lessequals @t11 @t13 @t10)))
% 0.30/0.54  (assume @p4 (forall @t14 (or (not (tptp.c_in @t11 @t15 @t10)) (tptp.c_in @t13 @t15 @t10))))
% 0.30/0.54  (assume @p5 @t19)
% 0.30/0.54  (assume @p6 @t21)
% 0.30/0.54  (assume @p7 (not @t23))
% 0.30/0.54  (step @p8 :rule instantiate :premises (@p1) :args ((@list @t22 @t18 @t16)))
% 0.30/0.54  (step @p9 :rule instantiate :premises (@p4) :args (@t24))
% 0.30/0.54  (step @p10 :rule cnf_or_pos :args (@t27))
% 0.30/0.54  (step @p11 :rule reordering :premises (@p10) :args ((or @t26 @t25 (not @t27))))
% 0.30/0.54  (step @p12 :rule chain_m_resolution :premises (@p11 @p5 @p9) :args (@t25 @t28 (@list @t19 @t27)))
% 0.30/0.54  (step @p13 :rule cnf_or_pos :args (@t31))
% 0.30/0.54  (step @p14 :rule reordering :premises (@p13) :args ((or @t30 @t29 (not @t31))))
% 0.30/0.54  (step @p15 :rule chain_m_resolution :premises (@p14 @p12 @p8) :args (@t29 @t28 (@list @t25 @t31)))
% 0.30/0.54  (step @p16 :rule eq-symm :args (@t3 @t4))
% 0.30/0.54  (step @p17 :rule refl :args (@t6))
% 0.30/0.54  (step @p18 :rule refl :args (@t7))
% 0.30/0.54  (step @p19 :rule nary_cong :premises (@p18 @p17 @p16) :args (@t8))
% 0.30/0.54  (step @p20 :rule cong :premises (@p19) :args (@t9))
% 0.30/0.54  (step @p21 :rule eq_resolve :premises (@p2 @p20))
% 0.30/0.54  (step @p22 :rule instantiate :premises (@p21) :args ((@list tptp.v_m @t22 @t16)))
% 0.30/0.54  (step @p23 :rule instantiate :premises (@p3) :args (@t24))
% 0.30/0.54  (step @p24 :rule cnf_or_pos :args (@t36))
% 0.30/0.54  (step @p25 :rule reordering :premises (@p24) :args ((or @t23 @t35 @t33 (not @t36))))
% 0.30/0.54  (step @p26 :rule chain_m_resolution :premises (@p25 @p7 @p23 @p22) :args (@t33 @t37 (@list @t23 @t34 @t36)))
% 0.30/0.54  (assume-push @p43 @t21)
% 0.30/0.54  (assume-push @p44 @t29)
% 0.30/0.54  (step @p29 :rule true_intro :premises (@p15))
% 0.30/0.54  (step @p30 :rule refl :args (@t17))
% 0.30/0.54  (step @p31 :rule refl :args (@t22))
% 0.30/0.54  (step @p32 :rule cong :premises (@p31 @p6 @p30) :args (@t32))
% 0.30/0.54  (step @p33 :rule trans :premises (@p32 @p29))
% 0.30/0.54  (step @p34 :rule true_elim :premises (@p33))
% 0.30/0.54  (step-pop @p45 :rule scope :premises (@p34))
% 0.30/0.54  (step-pop @p46 :rule scope :premises (@p45))
% 0.30/0.54  (step @p35 :rule process_scope :premises (@p46) :args (@t32))
% 0.30/0.54  (step @p38 :rule implies_elim :premises (@p35))
% 0.30/0.54  (step @p39 :rule cnf_and_neg :args (@t38))
% 0.30/0.54  (step @p40 :rule resolution :premises (@p39 @p38) :args (true @t38))
% 0.30/0.54  (step @p41 :rule reordering :premises (@p40) :args ((or (not @t21) @t32 (not @t29))))
% 0.30/0.54  (step @p42 false :rule chain_m_resolution :premises (@p41 @p26 @p15 @p6) :args (false @t37 (@list @t32 @t29 @t21)))
% 0.30/0.54  )
% 0.30/0.55  % SZS output end Proof
% 0.30/0.55  % cvc5 exiting
%------------------------------------------------------------------------------