↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n002.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:08:38 AM UTC 2026

% Result   : Theorem 0.35s 0.59s
% Output   : Proof 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN346+1 : TPTP v9.2.1. Released v2.0.0.
% 0.12/0.14  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.36  % Computer : n002.cluster.edu
% 0.18/0.36  % Model    : x86_64 x86_64
% 0.18/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36  % Memory   : 8042.1875MB
% 0.18/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36  % CPULimit : 300
% 0.18/0.36  % WCLimit  : 300
% 0.18/0.36  % DateTime : Tue Jun  2 23:24:48 EDT 2026
% 0.18/0.36  % CPUTime  : 
% 0.35/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.35/0.59  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.35/0.59  % SZS status Theorem
% 0.35/0.59  % SZS output start Proof
% 0.35/0.59  (
% 0.35/0.59  (declare-sort $$unsorted 0)
% 0.35/0.59  (declare-const tptp.big_f (-> $$unsorted $$unsorted Bool))
% 0.35/0.59  (define @t1 () (@var "Z2" $$unsorted))
% 0.35/0.59  (define @t2 () (@var "Y2" $$unsorted))
% 0.35/0.59  (define @t3 () (@var "X2" $$unsorted))
% 0.35/0.59  (define @t4 () (tptp.big_f @t3 @t1))
% 0.35/0.59  (define @t5 () (and @t4 (tptp.big_f @t2 @t1)))
% 0.35/0.59  (define @t6 () (@var "Z1" $$unsorted))
% 0.35/0.59  (define @t7 () (@var "Y1" $$unsorted))
% 0.35/0.59  (define @t8 () (and (tptp.big_f @t7 @t6) (tptp.big_f @t2 @t6)))
% 0.35/0.59  (define @t9 () (or @t8 @t5))
% 0.35/0.59  (define @t10 () (tptp.big_f @t7 @t1))
% 0.35/0.59  (define @t11 () (=> @t10 @t9))
% 0.35/0.59  (define @t12 () (tptp.big_f @t3 @t6))
% 0.35/0.59  (define @t13 () (@list @t6 @t1))
% 0.35/0.59  (define @t14 () (forall @t13 (=> @t12 @t11)))
% 0.35/0.59  (define @t15 () (@list @t7 @t2))
% 0.35/0.59  (define @t16 () (exists @t15 @t14))
% 0.35/0.59  (define @t17 () (@list (@var "X1" $$unsorted) @t3))
% 0.35/0.59  (define @t18 () (forall @t17 @t16))
% 0.35/0.59  (define @t19 () (not @t18))
% 0.35/0.59  (define @t20 () (@var "BOUND_VARIABLE_7467" $$unsorted))
% 0.41/0.59  (define @t21 () (tptp.big_f @t20 @t1))
% 0.41/0.59  (define @t22 () (@var "BOUND_VARIABLE_7465" $$unsorted))
% 0.41/0.59  (define @t23 () (not (tptp.big_f @t22 @t1)))
% 0.41/0.59  (define @t24 () (@list @t1))
% 0.41/0.59  (define @t25 () (@list @t22 @t20))
% 0.41/0.59  (define @t26 () (forall @t25 (not (forall @t24 (or @t23 (and @t4 @t21))))))
% 0.41/0.59  (define @t27 () (@var "BOUND_VARIABLE_7455" $$unsorted))
% 0.41/0.59  (define @t28 () (@var "BOUND_VARIABLE_7453" $$unsorted))
% 0.41/0.59  (define @t29 () (and (tptp.big_f @t28 @t6) (tptp.big_f @t27 @t6)))
% 0.41/0.59  (define @t30 () (not @t12))
% 0.41/0.59  (define @t31 () (@list @t6))
% 0.41/0.59  (define @t32 () (@list @t28 @t27))
% 0.41/0.59  (define @t33 () (forall @t32 (not (forall @t31 (or @t30 @t29)))))
% 0.41/0.59  (define @t34 () (or (not @t33) (not @t26)))
% 0.41/0.59  (define @t35 () (forall (@list @t3) @t34))
% 0.41/0.59  (define @t36 () (not @t10))
% 0.41/0.59  (define @t37 () (or @t36 @t5))
% 0.41/0.59  (define @t38 () (forall @t24 @t37))
% 0.41/0.59  (define @t39 () (not @t38))
% 0.41/0.59  (define @t40 () (forall @t15 @t39))
% 0.41/0.59  (define @t41 () (@list @t7 @t2))
% 0.41/0.59  (define @t42 () (or @t30 @t8))
% 0.41/0.59  (define @t43 () (forall @t31 @t42))
% 0.41/0.59  (define @t44 () (not @t43))
% 0.41/0.59  (define @t45 () (forall @t15 @t44))
% 0.41/0.59  (define @t46 () (and @t45 @t40))
% 0.41/0.59  (define @t47 () (or @t43 @t38))
% 0.41/0.59  (define @t48 () (forall @t15 (not @t47)))
% 0.41/0.59  (define @t49 () (not @t48))
% 0.41/0.59  (define @t50 () (or @t42 @t37))
% 0.41/0.59  (define @t51 () (or @t30 @t36 @t8 @t5))
% 0.41/0.59  (define @t52 () (or @t36 @t8 @t5))
% 0.41/0.59  (define @t53 () (@quantifiers_skolemize @t35 0))
% 0.41/0.59  (define @t54 () (tptp.big_f @t53 @t6))
% 0.41/0.59  (define @t55 () (not @t54))
% 0.41/0.59  (define @t56 () (forall @t32 (not (forall @t31 (or @t55 @t29)))))
% 0.41/0.59  (define @t57 () (not @t56))
% 0.41/0.59  (define @t58 () (or @t57 (not (forall @t25 (not (forall @t24 (or @t23 (and (tptp.big_f @t53 @t1) @t21))))))))
% 0.41/0.59  (define @t59 () (and @t54 @t54))
% 0.41/0.59  (define @t60 () (or @t55 @t59))
% 0.41/0.59  (define @t61 () (forall @t31 @t60))
% 0.41/0.59  (define @t62 () (not @t61))
% 0.41/0.59  (assume @p1 @t19)
% 0.41/0.59  (assume @p2 true)
% 0.41/0.59  (step @p3 :rule quant-unused-vars :args ((= (forall @t17 @t34) @t35)))
% 0.41/0.59  (step @p4 :rule bool-and-de-morgan :args (@t33 @t26 true))
% 0.41/0.59  (step @p5 :rule cong :premises (@p4) :args ((forall @t17 (not (and @t33 @t26)))))
% 0.41/0.59  (step @p6 :rule trans :premises (@p5 @p3))
% 0.41/0.59  (step @p7 :rule alpha_equiv :args (@t40 @t41 (@list @t22 @t20)))
% 0.41/0.59  (step @p8 :rule alpha_equiv :args (@t45 @t41 (@list @t28 @t27)))
% 0.41/0.59  (step @p9 :rule nary_cong :premises (@p8 @p7) :args (@t46))
% 0.41/0.59  (step @p10 :rule quant-miniscope-and :args ((= (forall @t15 (and @t44 @t39)) @t46)))
% 0.41/0.59  (step @p11 :rule trans :premises (@p10 @p9))
% 0.41/0.59  (step @p12 :rule bool-or-de-morgan :args (@t43 @t38 false))
% 0.41/0.59  (step @p13 :rule cong :premises (@p12) :args (@t48))
% 0.41/0.59  (step @p14 :rule trans :premises (@p13 @p11))
% 0.41/0.59  (step @p15 :rule cong :premises (@p14) :args (@t49))
% 0.41/0.59  (step @p16 :rule exists-elim :args ((= (exists @t15 @t47) @t49)))
% 0.41/0.59  (step @p17 :rule trans :premises (@p16 @p15))
% 0.41/0.59  (step @p18 :rule quant-miniscope-or :args ((= (forall @t13 @t50) @t47)))
% 0.41/0.59  (step @p19 :rule aci_norm :args ((= @t51 @t50)))
% 0.41/0.59  (step @p20 :rule cong :premises (@p19) :args ((forall @t13 @t51)))
% 0.41/0.59  (step @p21 :rule trans :premises (@p20 @p18))
% 0.41/0.59  (step @p22 :rule aci_norm :args ((= (or @t30 @t52) @t51)))
% 0.41/0.59  (step @p23 :rule aci_norm :args ((= (or @t36 @t9) @t52)))
% 0.41/0.59  (step @p24 :rule bool-impl-elim :args (@t10 @t9))
% 0.41/0.59  (step @p25 :rule trans :premises (@p24 @p23))
% 0.41/0.59  (step @p26 :rule refl :args (@t30))
% 0.41/0.59  (step @p27 :rule nary_cong :premises (@p26 @p25) :args ((or @t30 @t11)))
% 0.41/0.59  (step @p28 :rule trans :premises (@p27 @p22))
% 0.41/0.59  (step @p29 :rule bool-impl-elim :args (@t12 @t11))
% 0.41/0.59  (step @p30 :rule trans :premises (@p29 @p28))
% 0.41/0.59  (step @p31 :rule cong :premises (@p30) :args (@t14))
% 0.41/0.59  (step @p32 :rule trans :premises (@p31 @p21))
% 0.41/0.59  (step @p33 :rule cong :premises (@p32) :args (@t16))
% 0.41/0.59  (step @p34 :rule trans :premises (@p33 @p17))
% 0.41/0.59  (step @p35 :rule cong :premises (@p34) :args (@t18))
% 0.41/0.59  (step @p36 :rule trans :premises (@p35 @p6))
% 0.41/0.59  (step @p37 :rule cong :premises (@p36) :args (@t19))
% 0.41/0.59  (step @p38 :rule eq_resolve :premises (@p1 @p37))
% 0.41/0.59  (step @p39 :rule skolemize :premises (@p38))
% 0.41/0.59  (step @p40 :rule bool-double-not-elim :args (@t56))
% 0.41/0.59  (step @p41 :rule refl :args (@t58))
% 0.41/0.59  (step @p42 :rule nary_cong :premises (@p41 @p40) :args ((or @t58 (not @t57))))
% 0.41/0.59  (step @p43 :rule cnf_or_neg :args (@t58 0))
% 0.41/0.59  (step @p44 :rule eq_resolve :premises (@p43 @p42))
% 0.41/0.59  (step @p45 :rule reordering :premises (@p44) :args ((or @t56 @t58)))
% 0.41/0.59  (step @p46 :rule chain_m_resolution :premises (@p45 @p39) :args (@t56 (@list true) (@list @t58)))
% 0.41/0.59  (step @p47 :rule bool-impl-false1 :args (@t56))
% 0.41/0.59  (step @p48 :rule evaluate :args ((not true)))
% 0.41/0.59  (step @p49 :rule quant-unused-vars :args ((= (forall @t31 true) true)))
% 0.41/0.59  (step @p50 :rule bool-or-taut2 :args (false @t54 false false))
% 0.41/0.59  (step @p51 :rule cong :premises (@p50) :args ((forall @t31 (or @t55 @t54))))
% 0.41/0.59  (step @p52 :rule trans :premises (@p51 @p49))
% 0.41/0.59  (step @p53 :rule aci_norm :args ((= @t59 @t54)))
% 0.41/0.59  (step @p54 :rule refl :args (@t55))
% 0.41/0.59  (step @p55 :rule nary_cong :premises (@p54 @p53) :args (@t60))
% 0.41/0.59  (step @p56 :rule cong :premises (@p55) :args (@t61))
% 0.41/0.59  (step @p57 :rule trans :premises (@p56 @p52))
% 0.41/0.59  (step @p58 :rule cong :premises (@p57) :args (@t62))
% 0.41/0.59  (step @p59 :rule trans :premises (@p58 @p48))
% 0.41/0.59  (step @p60 :rule refl :args (@t56))
% 0.41/0.59  (step @p61 :rule cong :premises (@p60 @p59) :args ((=> @t56 @t62)))
% 0.41/0.59  (step @p62 :rule trans :premises (@p61 @p47))
% 0.41/0.59  (assume-push @p69 @t56)
% 0.41/0.59  (step @p64 :rule instantiate :premises (@p46) :args ((@list @t53 @t53)))
% 0.41/0.59  (step-pop @p70 :rule scope :premises (@p64))
% 0.41/0.59  (step @p65 :rule process_scope :premises (@p70) :args (@t62))
% 0.41/0.59  (step @p67 :rule eq_resolve :premises (@p65 @p62))
% 0.41/0.59  (step @p68 false :rule chain_m_resolution :premises (@p67 @p46) :args (false (@list false) (@list @t56)))
% 0.41/0.59  )
% 0.41/0.59  % SZS output end Proof
% 0.41/0.59  % cvc5 exiting
%------------------------------------------------------------------------------