↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SYN051+1 : TPTP v9.2.1. Released v2.0.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 09:07:54 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  : SYN051+1 : TPTP v9.2.1. Released v2.0.0.
% 0.12/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 23:19:19 EDT 2026
% 0.17/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.p Bool)
% 0.30/0.55  (declare-const tptp.big_f (-> $$unsorted Bool))
% 0.30/0.55  (define @t1 () (@var "X" $$unsorted))
% 0.30/0.55  (define @t2 () (tptp.big_f @t1))
% 0.30/0.55  (define @t3 () (=> tptp.p @t2))
% 0.30/0.55  (define @t4 () (@list @t1))
% 0.30/0.55  (define @t5 () (exists @t4 @t3))
% 0.30/0.55  (define @t6 () (=> @t2 tptp.p))
% 0.30/0.55  (define @t7 () (exists @t4 @t6))
% 0.30/0.55  (define @t8 () (= tptp.p @t2))
% 0.30/0.55  (define @t9 () (exists @t4 @t8))
% 0.30/0.55  (define @t10 () (not @t9))
% 0.30/0.55  (define @t11 () (@var "BOUND_VARIABLE_7441" $$unsorted))
% 0.30/0.55  (define @t12 () (forall (@list @t11) (tptp.big_f @t11)))
% 0.30/0.55  (define @t13 () (not @t12))
% 0.30/0.55  (define @t14 () (not tptp.p))
% 0.30/0.55  (define @t15 () (not @t14))
% 0.30/0.55  (define @t16 () (forall @t4 @t14))
% 0.30/0.55  (define @t17 () (forall @t4 @t2))
% 0.30/0.55  (define @t18 () (@list @t1))
% 0.30/0.55  (define @t19 () (and @t17 @t16))
% 0.30/0.55  (define @t20 () (forall @t4 (not @t6)))
% 0.30/0.55  (define @t21 () (not @t20))
% 0.30/0.55  (define @t22 () (forall @t4 (= @t2 @t14)))
% 0.30/0.55  (define @t23 () (forall @t4 (not @t8)))
% 0.30/0.55  (define @t24 () (not @t23))
% 0.30/0.55  (define @t25 () (@quantifiers_skolemize @t12 0))
% 0.30/0.55  (define @t26 () (tptp.big_f @t25))
% 0.30/0.55  (define @t27 () (= @t26 @t14))
% 0.30/0.55  (define @t28 () (= @t14 @t26))
% 0.30/0.55  (define @t29 () (@list false))
% 0.30/0.55  (define @t30 () (@list @t22))
% 0.30/0.55  (define @t31 () (not @t28))
% 0.30/0.55  (define @t32 () (not @t26))
% 0.30/0.55  (define @t33 () (not @t2))
% 0.30/0.55  (define @t34 () (forall @t4 @t33))
% 0.30/0.55  (define @t35 () (@var "BOUND_VARIABLE_7426" $$unsorted))
% 0.30/0.55  (define @t36 () (forall @t4 tptp.p))
% 0.30/0.55  (define @t37 () (and @t36 @t34))
% 0.30/0.55  (define @t38 () (forall @t4 (not @t3)))
% 0.30/0.55  (define @t39 () (not @t38))
% 0.30/0.55  (define @t40 () (forall (@list @t35) (not (tptp.big_f @t35))))
% 0.30/0.55  (define @t41 () (not @t40))
% 0.30/0.55  (define @t42 () (@quantifiers_skolemize @t40 0))
% 0.30/0.55  (define @t43 () (tptp.big_f @t42))
% 0.30/0.55  (define @t44 () (= @t43 @t14))
% 0.30/0.55  (define @t45 () (= @t14 @t43))
% 0.30/0.55  (define @t46 () (not @t43))
% 0.30/0.55  (define @t47 () (not @t46))
% 0.30/0.55  (assume @p1 @t5)
% 0.30/0.55  (assume @p2 @t7)
% 0.30/0.55  (assume @p3 @t10)
% 0.30/0.55  (assume @p4 true)
% 0.30/0.55  (step @p5 :rule bool-double-not-elim :args (tptp.p))
% 0.30/0.55  (step @p6 :rule refl :args (@t13))
% 0.30/0.55  (step @p7 :rule nary_cong :premises (@p6 @p5) :args ((or @t13 @t15)))
% 0.30/0.55  (step @p8 :rule quant-unused-vars :args ((= @t16 @t14)))
% 0.30/0.55  (step @p9 :rule alpha_equiv :args (@t17 @t18 (@list @t11)))
% 0.30/0.55  (step @p10 :rule nary_cong :premises (@p9 @p8) :args (@t19))
% 0.30/0.55  (step @p11 :rule quant-miniscope-and :args ((= (forall @t4 (and @t2 @t14)) @t19)))
% 0.30/0.55  (step @p12 :rule trans :premises (@p11 @p10))
% 0.30/0.55  (step @p13 :rule bool-implies-de-morgan :args (@t2 tptp.p))
% 0.30/0.55  (step @p14 :rule cong :premises (@p13) :args (@t20))
% 0.30/0.55  (step @p15 :rule trans :premises (@p14 @p12))
% 0.30/0.55  (step @p16 :rule cong :premises (@p15) :args (@t21))
% 0.30/0.55  (step @p17 :rule exists-elim :args ((= @t7 @t21)))
% 0.30/0.55  (step @p18 :rule trans :premises (@p17 @p16))
% 0.30/0.55  (step @p19 :rule eq_resolve :premises (@p2 @p18))
% 0.30/0.55  (step @p20 :rule not_and :premises (@p19))
% 0.30/0.55  (step @p21 :rule eq_resolve :premises (@p20 @p7))
% 0.30/0.55  (step @p22 :rule reordering :premises (@p21) :args ((or tptp.p @t13)))
% 0.30/0.55  (step @p23 :rule bool-double-not-elim :args (@t22))
% 0.30/0.55  (step @p24 :rule eq-symm :args (@t14 @t2))
% 0.30/0.55  (step @p25 :rule cong :premises (@p24) :args ((forall @t4 (= @t14 @t2))))
% 0.30/0.55  (step @p26 :rule bool-not-eq-elim1 :args (tptp.p @t2))
% 0.30/0.55  (step @p27 :rule cong :premises (@p26) :args (@t23))
% 0.30/0.55  (step @p28 :rule trans :premises (@p27 @p25))
% 0.30/0.55  (step @p29 :rule cong :premises (@p28) :args (@t24))
% 0.30/0.55  (step @p30 :rule exists-elim :args ((= @t9 @t24)))
% 0.30/0.55  (step @p31 :rule trans :premises (@p30 @p29))
% 0.30/0.55  (step @p32 :rule cong :premises (@p31) :args (@t10))
% 0.30/0.55  (step @p33 :rule trans :premises (@p32 @p23))
% 0.30/0.55  (step @p34 :rule eq_resolve :premises (@p3 @p33))
% 0.30/0.55  (step @p35 :rule eq-symm :args (@t26 @t14))
% 0.30/0.55  (step @p36 :rule refl :args (@t22))
% 0.30/0.55  (step @p37 :rule cong :premises (@p36 @p35) :args ((=> @t22 @t27)))
% 0.30/0.55  (assume-push @p101 @t22)
% 0.30/0.55  (step @p39 :rule instantiate :premises (@p34) :args ((@list @t25)))
% 0.30/0.55  (step-pop @p102 :rule scope :premises (@p39))
% 0.30/0.55  (step @p40 :rule process_scope :premises (@p102) :args (@t27))
% 0.30/0.55  (step @p42 :rule eq_resolve :premises (@p40 @p37))
% 0.30/0.55  (step @p43 :rule implies_elim :premises (@p42))
% 0.30/0.55  (step @p44 :rule chain_m_resolution :premises (@p43 @p34) :args (@t28 @t29 @t30))
% 0.30/0.55  (step @p45 :rule refl :args (@t26))
% 0.30/0.55  (step @p46 :rule refl :args (@t31))
% 0.30/0.55  (step @p47 :rule nary_cong :premises (@p46 @p5 @p45) :args ((or @t31 @t15 @t26)))
% 0.30/0.55  (step @p48 :rule cnf_equiv_pos1 :args (@t28))
% 0.30/0.55  (step @p49 :rule eq_resolve :premises (@p48 @p47))
% 0.30/0.55  (step @p50 :rule reordering :premises (@p49) :args ((or tptp.p @t26 @t31)))
% 0.30/0.55  (step @p51 :rule refl :args (@t32))
% 0.30/0.55  (step @p52 :rule bool-double-not-elim :args (@t12))
% 0.30/0.55  (step @p53 :rule nary_cong :premises (@p52 @p51) :args ((or (not @t13) @t32)))
% 0.30/0.55  (assume-push @p103 @t13)
% 0.30/0.55  (step @p55 :rule skolemize :premises (@p103))
% 0.30/0.55  (step-pop @p104 :rule scope :premises (@p55))
% 0.30/0.55  (step @p56 :rule process_scope :premises (@p104) :args (@t32))
% 0.30/0.55  (step @p58 :rule implies_elim :premises (@p56))
% 0.30/0.55  (step @p59 :rule eq_resolve :premises (@p58 @p53))
% 0.30/0.55  (step @p60 :rule chain_m_resolution :premises (@p59 @p50 @p44 @p22) :args (tptp.p (@list false false true) (@list @t26 @t28 @t12)))
% 0.30/0.55  (step @p61 :rule alpha_equiv :args (@t34 @t18 (@list @t35)))
% 0.30/0.55  (step @p62 :rule quant-unused-vars :args ((= @t36 tptp.p)))
% 0.30/0.55  (step @p63 :rule nary_cong :premises (@p62 @p61) :args (@t37))
% 0.30/0.55  (step @p64 :rule quant-miniscope-and :args ((= (forall @t4 (and tptp.p @t33)) @t37)))
% 0.30/0.55  (step @p65 :rule trans :premises (@p64 @p63))
% 0.30/0.55  (step @p66 :rule bool-implies-de-morgan :args (tptp.p @t2))
% 0.30/0.55  (step @p67 :rule cong :premises (@p66) :args (@t38))
% 0.30/0.55  (step @p68 :rule trans :premises (@p67 @p65))
% 0.30/0.55  (step @p69 :rule cong :premises (@p68) :args (@t39))
% 0.30/0.55  (step @p70 :rule exists-elim :args ((= @t5 @t39)))
% 0.30/0.55  (step @p71 :rule trans :premises (@p70 @p69))
% 0.30/0.55  (step @p72 :rule eq_resolve :premises (@p1 @p71))
% 0.30/0.55  (step @p73 :rule not_and :premises (@p72))
% 0.30/0.55  (step @p74 :rule chain_m_resolution :premises (@p73 @p60) :args (@t41 @t29 (@list tptp.p)))
% 0.30/0.55  (step @p75 :rule eq-symm :args (@t43 @t14))
% 0.30/0.55  (step @p76 :rule cong :premises (@p36 @p75) :args ((=> @t22 @t44)))
% 0.30/0.55  (assume-push @p105 @t22)
% 0.30/0.55  (step @p78 :rule instantiate :premises (@p34) :args ((@list @t42)))
% 0.30/0.55  (step-pop @p106 :rule scope :premises (@p78))
% 0.30/0.55  (step @p79 :rule process_scope :premises (@p106) :args (@t44))
% 0.30/0.55  (step @p81 :rule eq_resolve :premises (@p79 @p76))
% 0.30/0.55  (step @p82 :rule implies_elim :premises (@p81))
% 0.30/0.55  (step @p83 :rule chain_m_resolution :premises (@p82 @p34) :args (@t45 @t29 @t30))
% 0.30/0.55  (step @p84 :rule cnf_equiv_pos2 :args (@t45))
% 0.30/0.55  (step @p85 :rule reordering :premises (@p84) :args ((or @t14 @t46 (not @t45))))
% 0.30/0.55  (step @p86 :rule chain_m_resolution :premises (@p85 @p60 @p83) :args (@t46 (@list false false) (@list tptp.p @t45)))
% 0.30/0.55  (step @p87 :rule refl :args (@t43))
% 0.30/0.55  (step @p88 :rule bool-double-not-elim :args (@t40))
% 0.30/0.55  (step @p89 :rule nary_cong :premises (@p88 @p87) :args ((or (not @t41) @t43)))
% 0.30/0.55  (step @p90 :rule bool-double-not-elim :args (@t43))
% 0.30/0.55  (step @p91 :rule refl :args (@t41))
% 0.30/0.55  (step @p92 :rule cong :premises (@p91 @p90) :args ((=> @t41 @t47)))
% 0.30/0.55  (assume-push @p107 @t41)
% 0.30/0.55  (step @p94 :rule skolemize :premises (@p107))
% 0.30/0.55  (step-pop @p108 :rule scope :premises (@p94))
% 0.30/0.55  (step @p95 :rule process_scope :premises (@p108) :args (@t47))
% 0.30/0.55  (step @p97 :rule eq_resolve :premises (@p95 @p92))
% 0.30/0.55  (step @p98 :rule implies_elim :premises (@p97))
% 0.30/0.55  (step @p99 :rule eq_resolve :premises (@p98 @p89))
% 0.30/0.55  (step @p100 false :rule chain_m_resolution :premises (@p99 @p86 @p74) :args (false (@list true true) (@list @t43 @t40)))
% 0.30/0.55  )
% 0.30/0.55  % SZS output end Proof
% 0.30/0.55  % cvc5 exiting
%------------------------------------------------------------------------------