↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n020.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:12:02 AM UTC 2026

% Result   : Theorem 0.40s 0.57s
% Output   : Proof 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYO094^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.14  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.35  % Computer : n020.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Tue Jun  2 23:58:56 EDT 2026
% 0.17/0.36  % CPUTime  : 
% 0.29/0.51  %----Proving TH0
% 0.40/0.57  --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s...
% 0.40/0.57  % SZS status Theorem
% 0.40/0.57  % SZS output start Proof
% 0.40/0.57  (
% 0.40/0.57  (declare-sort $$unsorted 0)
% 0.40/0.57  (declare-const tptp.cR (-> $$unsorted $$unsorted Bool))
% 0.40/0.57  (define @t1 () (@var "V" $$unsorted))
% 0.40/0.57  (define @t2 () (_ (_ tptp.cR @t1) @t1))
% 0.40/0.57  (define @t3 () (@var "U" $$unsorted))
% 0.40/0.57  (define @t4 () (_ (_ tptp.cR @t3) @t3))
% 0.40/0.57  (define @t5 () (@list @t1))
% 0.40/0.57  (define @t6 () (forall @t5 (=> @t4 @t2)))
% 0.40/0.57  (define @t7 () (@list @t3))
% 0.40/0.57  (define @t8 () (exists @t7 @t6))
% 0.40/0.57  (define @t9 () (@var "Y" $$unsorted))
% 0.40/0.57  (define @t10 () (_ (_ tptp.cR @t9) @t9))
% 0.40/0.57  (define @t11 () (@list @t9))
% 0.40/0.57  (define @t12 () (forall @t11 @t10))
% 0.40/0.57  (define @t13 () (@var "X" $$unsorted))
% 0.40/0.57  (define @t14 () (_ (_ tptp.cR @t13) @t13))
% 0.40/0.57  (define @t15 () (@list @t13))
% 0.40/0.57  (define @t16 () (exists @t15 @t14))
% 0.40/0.57  (define @t17 () (=> @t16 @t12))
% 0.40/0.57  (define @t18 () (=> @t17 @t8))
% 0.40/0.57  (define @t19 () (not @t18))
% 0.40/0.57  (define @t20 () (tptp.cR @t1 @t1))
% 0.40/0.57  (define @t21 () (forall @t5 @t20))
% 0.40/0.57  (define @t22 () (not @t21))
% 0.40/0.57  (define @t23 () (@var "BOUND_VARIABLE_7458" $$unsorted))
% 0.40/0.57  (define @t24 () (tptp.cR @t23 @t23))
% 0.40/0.57  (define @t25 () (_ (_ tptp.cR @t23) @t23))
% 0.40/0.57  (define @t26 () (@list @t23))
% 0.40/0.57  (define @t27 () (forall @t26 @t25))
% 0.40/0.57  (define @t28 () (forall @t7 @t22))
% 0.40/0.57  (define @t29 () (forall @t7 @t4))
% 0.40/0.57  (define @t30 () (@list @t23))
% 0.40/0.57  (define @t31 () (and @t29 @t28))
% 0.40/0.57  (define @t32 () (not @t4))
% 0.40/0.57  (define @t33 () (or @t32 @t21))
% 0.40/0.57  (define @t34 () (forall @t7 (not @t33)))
% 0.40/0.57  (define @t35 () (not @t34))
% 0.40/0.57  (define @t36 () (forall @t5 @t2))
% 0.40/0.57  (define @t37 () (or @t32 @t36))
% 0.40/0.57  (define @t38 () (tptp.cR @t9 @t9))
% 0.40/0.57  (define @t39 () (tptp.cR @t13 @t13))
% 0.40/0.57  (define @t40 () (not @t14))
% 0.40/0.57  (define @t41 () (forall @t15 @t40))
% 0.40/0.57  (define @t42 () (not @t41))
% 0.40/0.57  (define @t43 () (forall @t11 @t38))
% 0.40/0.57  (define @t44 () (@list @t9))
% 0.40/0.57  (define @t45 () (@list false))
% 0.40/0.57  (assume @p1 @t19)
% 0.40/0.57  (assume @p2 true)
% 0.40/0.57  (step @p3 :rule refl :args (@t22))
% 0.40/0.57  (step @p4 :rule refl :args (@t24))
% 0.40/0.57  (step @p5 :rule refl :args (@t25))
% 0.40/0.57  (step @p6 :rule cong :premises (@p5 @p4) :args ((= @t25 @t24)))
% 0.40/0.57  (step @p7 :rule symm :premises (@p6))
% 0.40/0.57  (step @p8 :rule eq_resolve :premises (@p5 @p7))
% 0.40/0.57  (step @p9 :rule cong :premises (@p8) :args (@t27))
% 0.40/0.57  (step @p10 :rule nary_cong :premises (@p9 @p3) :args ((and @t27 @t22)))
% 0.40/0.57  (step @p11 :rule quant-unused-vars :args ((= @t28 @t22)))
% 0.40/0.57  (step @p12 :rule alpha_equiv :args (@t29 (@list @t3) @t30))
% 0.40/0.57  (step @p13 :rule nary_cong :premises (@p12 @p11) :args (@t31))
% 0.40/0.57  (step @p14 :rule quant-miniscope-and :args ((= (forall @t7 (and @t4 @t22)) @t31)))
% 0.40/0.57  (step @p15 :rule trans :premises (@p14 @p13))
% 0.40/0.57  (step @p16 :rule trans :premises (@p15 @p10))
% 0.40/0.57  (step @p17 :rule refl :args (@t22))
% 0.40/0.57  (step @p18 :rule bool-double-not-elim :args (@t4))
% 0.40/0.57  (step @p19 :rule nary_cong :premises (@p18 @p17) :args ((and (not @t32) @t22)))
% 0.40/0.57  (step @p20 :rule bool-or-de-morgan :args (@t32 @t21 false))
% 0.40/0.57  (step @p21 :rule trans :premises (@p20 @p19))
% 0.40/0.57  (step @p22 :rule cong :premises (@p21) :args (@t34))
% 0.40/0.57  (step @p23 :rule trans :premises (@p22 @p16))
% 0.40/0.57  (step @p24 :rule cong :premises (@p23) :args (@t35))
% 0.40/0.57  (step @p25 :rule exists-elim :args ((= (exists @t7 @t33) @t35)))
% 0.40/0.57  (step @p26 :rule trans :premises (@p25 @p24))
% 0.40/0.57  (step @p27 :rule refl :args (@t20))
% 0.40/0.57  (step @p28 :rule refl :args (@t2))
% 0.40/0.57  (step @p29 :rule cong :premises (@p28 @p27) :args ((= @t2 @t20)))
% 0.40/0.57  (step @p30 :rule symm :premises (@p29))
% 0.40/0.57  (step @p31 :rule eq_resolve :premises (@p28 @p30))
% 0.40/0.57  (step @p32 :rule cong :premises (@p31) :args (@t36))
% 0.40/0.57  (step @p33 :rule refl :args (@t32))
% 0.40/0.57  (step @p34 :rule nary_cong :premises (@p33 @p32) :args (@t37))
% 0.40/0.57  (step @p35 :rule quant-miniscope-or :args ((= (forall @t5 (or @t32 @t2)) @t37)))
% 0.40/0.57  (step @p36 :rule trans :premises (@p35 @p34))
% 0.40/0.57  (step @p37 :rule bool-impl-elim :args (@t4 @t2))
% 0.40/0.57  (step @p38 :rule cong :premises (@p37) :args (@t6))
% 0.40/0.57  (step @p39 :rule trans :premises (@p38 @p36))
% 0.40/0.57  (step @p40 :rule cong :premises (@p39) :args (@t8))
% 0.40/0.57  (step @p41 :rule trans :premises (@p40 @p26))
% 0.40/0.57  (step @p42 :rule refl :args (@t38))
% 0.40/0.57  (step @p43 :rule refl :args (@t10))
% 0.40/0.57  (step @p44 :rule cong :premises (@p43 @p42) :args ((= @t10 @t38)))
% 0.40/0.57  (step @p45 :rule symm :premises (@p44))
% 0.40/0.57  (step @p46 :rule eq_resolve :premises (@p43 @p45))
% 0.40/0.58  (step @p47 :rule cong :premises (@p46) :args (@t12))
% 0.40/0.58  (step @p48 :rule refl :args (@t39))
% 0.40/0.58  (step @p49 :rule refl :args (@t14))
% 0.40/0.58  (step @p50 :rule cong :premises (@p49 @p48) :args ((= @t14 @t39)))
% 0.40/0.58  (step @p51 :rule symm :premises (@p50))
% 0.40/0.58  (step @p52 :rule eq_resolve :premises (@p49 @p51))
% 0.40/0.58  (step @p53 :rule cong :premises (@p52) :args (@t40))
% 0.40/0.58  (step @p54 :rule cong :premises (@p53) :args (@t41))
% 0.40/0.58  (step @p55 :rule cong :premises (@p54) :args (@t42))
% 0.40/0.58  (step @p56 :rule exists-elim :args ((= @t16 @t42)))
% 0.40/0.58  (step @p57 :rule trans :premises (@p56 @p55))
% 0.40/0.58  (step @p58 :rule cong :premises (@p57 @p47) :args (@t17))
% 0.40/0.58  (step @p59 :rule cong :premises (@p58 @p41) :args (@t18))
% 0.40/0.58  (step @p60 :rule cong :premises (@p59) :args (@t19))
% 0.40/0.58  (step @p61 :rule eq_resolve :premises (@p1 @p60))
% 0.40/0.58  (step @p62 :rule not_implies_elim2 :premises (@p61))
% 0.40/0.58  (step @p63 :rule not_not_elim :premises (@p62))
% 0.40/0.58  (step @p64 :rule and_elim :premises (@p63) :args (0))
% 0.40/0.58  (step @p65 :rule alpha_equiv :args (@t43 @t44 @t30))
% 0.40/0.58  (step @p66 :rule equiv_elim2 :premises (@p65))
% 0.40/0.58  (step @p67 :rule chain_m_resolution :premises (@p66 @p64) :args (@t43 @t45 (@list (forall @t26 @t24))))
% 0.40/0.58  (step @p68 :rule alpha_equiv :args (@t43 @t44 (@list @t1)))
% 0.40/0.58  (step @p69 :rule equiv_elim1 :premises (@p68))
% 0.40/0.58  (step @p70 :rule reordering :premises (@p69) :args ((or @t21 (not @t43))))
% 0.40/0.58  (step @p71 :rule chain_m_resolution :premises (@p70 @p67) :args (@t21 @t45 (@list @t43)))
% 0.40/0.58  (step @p72 :rule and_elim :premises (@p63) :args (1))
% 0.40/0.58  (step @p73 false :rule chain_m_resolution :premises (@p72 @p71) :args (false @t45 (@list @t21)))
% 0.40/0.58  )
% 0.40/0.58  % SZS output end Proof
% 0.40/0.58  % cvc5 exiting
%------------------------------------------------------------------------------