↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : KRS165+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/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 08:29:03 AM UTC 2026

% Result   : Theorem 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  : KRS165+1 : TPTP v9.2.1. Released v3.1.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/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 05:28:22 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.30/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.30/0.55  % SZS status Theorem
% 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.cCar (-> $$unsorted Bool))
% 0.30/0.55  (declare-const tptp.cAutomobile (-> $$unsorted Bool))
% 0.30/0.55  (declare-const tptp.xsd_string (-> $$unsorted Bool))
% 0.30/0.55  (declare-const tptp.xsd_integer (-> $$unsorted Bool))
% 0.30/0.55  (declare-const tptp.cowlThing (-> $$unsorted Bool))
% 0.30/0.55  (declare-const tptp.cowlNothing (-> $$unsorted Bool))
% 0.30/0.55  (define @t1 () (@var "X" $$unsorted))
% 0.30/0.55  (define @t2 () (not (tptp.cowlNothing @t1)))
% 0.30/0.55  (define @t3 () (tptp.cowlThing @t1))
% 0.30/0.55  (define @t4 () (@list @t1))
% 0.30/0.55  (define @t5 () (forall @t4 (and @t3 @t2)))
% 0.30/0.55  (define @t6 () (forall @t4 (= (tptp.xsd_string @t1) (not (tptp.xsd_integer @t1)))))
% 0.30/0.55  (define @t7 () (tptp.cAutomobile @t1))
% 0.30/0.55  (define @t8 () (tptp.cCar @t1))
% 0.30/0.55  (define @t9 () (forall @t4 (= @t8 @t7)))
% 0.30/0.55  (define @t10 () (forall @t4 (=> @t8 @t7)))
% 0.30/0.55  (define @t11 () (forall @t4 (=> @t7 @t8)))
% 0.30/0.55  (define @t12 () (and @t5 @t6 @t11 @t10))
% 0.30/0.55  (define @t13 () (not @t12))
% 0.30/0.55  (define @t14 () (forall @t4 (or (not @t8) @t7)))
% 0.30/0.55  (define @t15 () (@quantifiers_skolemize @t14 0))
% 0.30/0.55  (define @t16 () (forall @t4 (or (not @t7) @t8)))
% 0.30/0.55  (define @t17 () (@quantifiers_skolemize @t16 0))
% 0.30/0.55  (define @t18 () (tptp.cAutomobile @t17))
% 0.30/0.55  (define @t19 () (tptp.cCar @t17))
% 0.30/0.55  (define @t20 () (not @t18))
% 0.30/0.55  (define @t21 () (or @t20 @t19))
% 0.30/0.55  (define @t22 () (= @t19 @t18))
% 0.30/0.55  (define @t23 () (= @t18 @t19))
% 0.30/0.55  (define @t24 () (@list false))
% 0.30/0.55  (define @t25 () (not @t21))
% 0.30/0.55  (define @t26 () (not @t16))
% 0.30/0.55  (define @t27 () (forall @t4 @t2))
% 0.30/0.55  (define @t28 () (@list @t1))
% 0.30/0.55  (define @t29 () (@var "BOUND_VARIABLE_7441" $$unsorted))
% 0.30/0.55  (define @t30 () (forall @t4 @t3))
% 0.30/0.55  (define @t31 () (@var "BOUND_VARIABLE_7436" $$unsorted))
% 0.30/0.55  (define @t32 () (and @t30 @t27))
% 0.30/0.55  (define @t33 () (forall (@list @t29) (not (tptp.cowlNothing @t29))))
% 0.30/0.55  (define @t34 () (forall (@list @t31) (tptp.cowlThing @t31)))
% 0.30/0.55  (define @t35 () (not @t14))
% 0.30/0.55  (define @t36 () (tptp.cAutomobile @t15))
% 0.30/0.55  (define @t37 () (tptp.cCar @t15))
% 0.30/0.55  (define @t38 () (not @t37))
% 0.30/0.55  (define @t39 () (or @t38 @t36))
% 0.30/0.55  (define @t40 () (not @t39))
% 0.30/0.55  (define @t41 () (@list true))
% 0.30/0.55  (define @t42 () (@list @t39))
% 0.30/0.55  (define @t43 () (= @t37 @t36))
% 0.30/0.55  (assume @p1 @t5)
% 0.30/0.55  (assume @p2 @t6)
% 0.30/0.55  (assume @p3 @t9)
% 0.30/0.55  (assume @p4 @t13)
% 0.30/0.55  (assume @p5 true)
% 0.30/0.55  (step @p6 :rule instantiate :premises (@p3) :args ((@list @t15)))
% 0.30/0.55  (step @p7 :rule bool-double-not-elim :args (@t18))
% 0.30/0.55  (step @p8 :rule refl :args (@t21))
% 0.30/0.55  (step @p9 :rule nary_cong :premises (@p8 @p7) :args ((or @t21 (not @t20))))
% 0.30/0.55  (step @p10 :rule cnf_or_neg :args (@t21 0))
% 0.30/0.55  (step @p11 :rule eq_resolve :premises (@p10 @p9))
% 0.30/0.55  (step @p12 :rule reordering :premises (@p11) :args ((or @t18 @t21)))
% 0.30/0.55  (step @p13 :rule cnf_or_neg :args (@t21 1))
% 0.30/0.55  (step @p14 :rule eq-symm :args (@t19 @t18))
% 0.30/0.55  (step @p15 :rule refl :args (@t9))
% 0.30/0.55  (step @p16 :rule cong :premises (@p15 @p14) :args ((=> @t9 @t22)))
% 0.30/0.55  (assume-push @p80 @t9)
% 0.30/0.55  (step @p18 :rule instantiate :premises (@p3) :args ((@list @t17)))
% 0.30/0.55  (step-pop @p81 :rule scope :premises (@p18))
% 0.30/0.55  (step @p19 :rule process_scope :premises (@p81) :args (@t22))
% 0.30/0.55  (step @p21 :rule eq_resolve :premises (@p19 @p16))
% 0.30/0.55  (step @p22 :rule implies_elim :premises (@p21))
% 0.30/0.55  (step @p23 :rule chain_m_resolution :premises (@p22 @p3) :args (@t23 @t24 (@list @t9)))
% 0.30/0.55  (step @p24 :rule cnf_equiv_pos1 :args (@t23))
% 0.30/0.55  (step @p25 :rule reordering :premises (@p24) :args ((or @t20 @t19 (not @t23))))
% 0.30/0.55  (step @p26 :rule chain_m_resolution :premises (@p25 @p23 @p13 @p12) :args (@t21 (@list false true false) (@list @t23 @t19 @t18)))
% 0.30/0.55  (step @p27 :rule refl :args (@t25))
% 0.30/0.55  (step @p28 :rule bool-double-not-elim :args (@t16))
% 0.30/0.55  (step @p29 :rule nary_cong :premises (@p28 @p27) :args ((or (not @t26) @t25)))
% 0.30/0.55  (assume-push @p82 @t26)
% 0.30/0.55  (step @p31 :rule skolemize :premises (@p82))
% 0.30/0.55  (step-pop @p83 :rule scope :premises (@p31))
% 0.30/0.55  (step @p32 :rule process_scope :premises (@p83) :args (@t25))
% 0.30/0.55  (step @p34 :rule implies_elim :premises (@p32))
% 0.30/0.55  (step @p35 :rule eq_resolve :premises (@p34 @p29))
% 0.30/0.55  (step @p36 :rule chain_m_resolution :premises (@p35 @p26) :args (@t16 @t24 (@list @t21)))
% 0.30/0.55  (step @p37 :rule alpha_equiv :args (@t27 @t28 (@list @t29)))
% 0.30/0.55  (step @p38 :rule alpha_equiv :args (@t30 @t28 (@list @t31)))
% 0.30/0.55  (step @p39 :rule nary_cong :premises (@p38 @p37) :args (@t32))
% 0.30/0.55  (step @p40 :rule quant-miniscope-and :args ((= @t5 @t32)))
% 0.30/0.55  (step @p41 :rule trans :premises (@p40 @p39))
% 0.30/0.55  (step @p42 :rule eq_resolve :premises (@p1 @p41))
% 0.30/0.55  (step @p43 :rule and_elim :premises (@p42) :args (1))
% 0.30/0.55  (step @p44 :rule and_elim :premises (@p42) :args (0))
% 0.30/0.55  (step @p45 :rule aci_norm :args ((= (and (and @t34 @t33) @t6 @t16 @t14) (and @t6 @t16 @t14 @t34 @t33))))
% 0.30/0.55  (step @p46 :rule bool-impl-elim :args (@t8 @t7))
% 0.30/0.55  (step @p47 :rule cong :premises (@p46) :args (@t10))
% 0.30/0.55  (step @p48 :rule bool-impl-elim :args (@t7 @t8))
% 0.30/0.55  (step @p49 :rule cong :premises (@p48) :args (@t11))
% 0.30/0.55  (step @p50 :rule refl :args (@t6))
% 0.30/0.55  (step @p51 :rule nary_cong :premises (@p41 @p50 @p49 @p47) :args (@t12))
% 0.30/0.55  (step @p52 :rule trans :premises (@p51 @p45))
% 0.30/0.55  (step @p53 :rule cong :premises (@p52) :args (@t13))
% 0.30/0.55  (step @p54 :rule eq_resolve :premises (@p4 @p53))
% 0.30/0.55  (step @p55 :rule not_and :premises (@p54))
% 0.30/0.55  (step @p56 :rule reordering :premises (@p55) :args ((or (not @t34) (not @t33) (not @t6) @t26 @t35)))
% 0.30/0.55  (step @p57 :rule chain_m_resolution :premises (@p56 @p44 @p43 @p2 @p36) :args (@t35 (@list false false false false) (@list @t34 @t33 @t6 @t16)))
% 0.30/0.55  (step @p58 :rule refl :args (@t40))
% 0.30/0.55  (step @p59 :rule bool-double-not-elim :args (@t14))
% 0.30/0.55  (step @p60 :rule nary_cong :premises (@p59 @p58) :args ((or (not @t35) @t40)))
% 0.30/0.55  (assume-push @p84 @t35)
% 0.30/0.55  (step @p62 :rule skolemize :premises (@p84))
% 0.30/0.55  (step-pop @p85 :rule scope :premises (@p62))
% 0.30/0.55  (step @p63 :rule process_scope :premises (@p85) :args (@t40))
% 0.30/0.55  (step @p65 :rule implies_elim :premises (@p63))
% 0.30/0.55  (step @p66 :rule eq_resolve :premises (@p65 @p60))
% 0.30/0.55  (step @p67 :rule chain_m_resolution :premises (@p66 @p57) :args (@t40 @t41 (@list @t14)))
% 0.30/0.55  (step @p68 :rule bool-double-not-elim :args (@t37))
% 0.30/0.55  (step @p69 :rule refl :args (@t39))
% 0.30/0.55  (step @p70 :rule nary_cong :premises (@p69 @p68) :args ((or @t39 (not @t38))))
% 0.30/0.55  (step @p71 :rule cnf_or_neg :args (@t39 0))
% 0.30/0.55  (step @p72 :rule eq_resolve :premises (@p71 @p70))
% 0.30/0.55  (step @p73 :rule reordering :premises (@p72) :args ((or @t37 @t39)))
% 0.30/0.55  (step @p74 :rule chain_m_resolution :premises (@p73 @p67) :args (@t37 @t41 @t42))
% 0.30/0.55  (step @p75 :rule cnf_or_neg :args (@t39 1))
% 0.30/0.55  (step @p76 :rule chain_m_resolution :premises (@p75 @p67) :args ((not @t36) @t41 @t42))
% 0.30/0.55  (step @p77 :rule cnf_equiv_pos1 :args (@t43))
% 0.30/0.55  (step @p78 :rule reordering :premises (@p77) :args ((or @t38 @t36 (not @t43))))
% 0.30/0.55  (step @p79 false :rule chain_m_resolution :premises (@p78 @p76 @p74 @p6) :args (false (@list true false false) (@list @t36 @t37 @t43)))
% 0.30/0.55  )
% 0.30/0.55  % SZS output end Proof
% 0.30/0.55  % cvc5 exiting
%------------------------------------------------------------------------------