↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEV258^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 : 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 08:55:41 AM UTC 2026

% Result   : Theorem 0.31s 0.54s
% Output   : Proof 0.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEV258^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.34  % Computer : n002.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 18:23:18 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.31/0.48  %----Proving TH0
% 0.31/0.54  --- 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.31/0.54  % SZS status Theorem
% 0.31/0.54  % SZS output start Proof
% 0.31/0.54  (
% 0.31/0.54  (declare-sort tptp.a 0)
% 0.31/0.54  (define @t1 () (@var "Xx" tptp.a))
% 0.31/0.54  (define @t2 () (@var "Z" (-> tptp.a Bool)))
% 0.31/0.54  (define @t3 () (@var "Y" (-> tptp.a Bool)))
% 0.31/0.54  (define @t4 () (@list @t1))
% 0.31/0.54  (define @t5 () (@var "S" (-> tptp.a Bool)))
% 0.31/0.54  (define @t6 () (= @t5 (lambda @t4 (and (_ @t3 @t1) (_ @t2 @t1)))))
% 0.31/0.54  (define @t7 () (and true true @t6))
% 0.31/0.54  (define @t8 () (@list @t3 @t2 @t5))
% 0.31/0.54  (define @t9 () (forall @t8 (=> @t7 true)))
% 0.31/0.54  (define @t10 () (@var "K" (-> (-> tptp.a Bool) Bool)))
% 0.31/0.54  (define @t11 () (@var "R" (-> tptp.a Bool)))
% 0.31/0.54  (define @t12 () (@var "Xx" (-> tptp.a Bool)))
% 0.31/0.54  (define @t13 () (and (forall (@list @t12) (=> (_ @t10 @t12) true)) (= @t11 (lambda @t4 (exists (@list @t5) (and (_ @t10 @t5) (_ @t5 @t1)))))))
% 0.31/0.54  (define @t14 () (@list @t10 @t11))
% 0.31/0.54  (define @t15 () (forall @t14 (=> @t13 true)))
% 0.31/0.54  (define @t16 () (= @t11 (lambda @t4 (not false))))
% 0.31/0.54  (define @t17 () (@list @t11))
% 0.31/0.54  (define @t18 () (forall @t17 (=> @t16 true)))
% 0.31/0.54  (define @t19 () (= @t11 (lambda @t4 false)))
% 0.31/0.54  (define @t20 () (forall @t17 (=> @t19 true)))
% 0.31/0.54  (define @t21 () (and @t20 @t18 @t15 @t9))
% 0.31/0.54  (define @t22 () (not @t21))
% 0.31/0.54  (define @t23 () (not true))
% 0.31/0.54  (define @t24 () (not @t6))
% 0.31/0.54  (define @t25 () (or @t23 @t24))
% 0.31/0.54  (define @t26 () (or @t23 @t23 @t24))
% 0.31/0.54  (assume @p1 @t22)
% 0.31/0.54  (assume @p2 true)
% 0.31/0.54  (step @p3 :rule evaluate :args (@t23))
% 0.31/0.54  (step @p4 :rule evaluate :args ((and true true true true)))
% 0.31/0.54  (step @p5 :rule quant-unused-vars :args ((= (forall @t8 true) true)))
% 0.31/0.54  (step @p6 :rule absorb :args ((= (or @t25 true) true)))
% 0.31/0.54  (step @p7 :rule refl :args (true))
% 0.31/0.54  (step @p8 :rule aci_norm :args ((= @t26 @t25)))
% 0.31/0.54  (step @p9 :rule aci_norm :args ((= (or @t23 @t25) @t26)))
% 0.31/0.54  (step @p10 :rule bool-and-de-morgan :args (true @t6 true))
% 0.31/0.54  (step @p11 :rule refl :args (@t23))
% 0.31/0.54  (step @p12 :rule nary_cong :premises (@p11 @p10) :args ((or @t23 (not (and true @t6)))))
% 0.31/0.54  (step @p13 :rule bool-and-de-morgan :args (true true (and @t6)))
% 0.31/0.54  (step @p14 :rule trans :premises (@p13 @p12))
% 0.31/0.54  (step @p15 :rule trans :premises (@p14 @p9))
% 0.31/0.54  (step @p16 :rule trans :premises (@p15 @p8))
% 0.31/0.54  (step @p17 :rule nary_cong :premises (@p16 @p7) :args ((or (not @t7) true)))
% 0.31/0.54  (step @p18 :rule trans :premises (@p17 @p6))
% 0.31/0.54  (step @p19 :rule bool-impl-elim :args (@t7 true))
% 0.31/0.54  (step @p20 :rule trans :premises (@p19 @p18))
% 0.31/0.54  (step @p21 :rule cong :premises (@p20) :args (@t9))
% 0.31/0.54  (step @p22 :rule trans :premises (@p21 @p5))
% 0.31/0.54  (step @p23 :rule quant-unused-vars :args ((= (forall @t14 true) true)))
% 0.31/0.54  (step @p24 :rule bool-impl-true1 :args (@t13))
% 0.31/0.54  (step @p25 :rule cong :premises (@p24) :args (@t15))
% 0.31/0.54  (step @p26 :rule trans :premises (@p25 @p23))
% 0.31/0.54  (step @p27 :rule quant-unused-vars :args ((= (forall @t17 true) true)))
% 0.31/0.54  (step @p28 :rule bool-impl-true1 :args (@t16))
% 0.31/0.54  (step @p29 :rule cong :premises (@p28) :args (@t18))
% 0.31/0.54  (step @p30 :rule trans :premises (@p29 @p27))
% 0.31/0.54  (step @p31 :rule bool-impl-true1 :args (@t19))
% 0.31/0.54  (step @p32 :rule cong :premises (@p31) :args (@t20))
% 0.31/0.54  (step @p33 :rule trans :premises (@p32 @p27))
% 0.31/0.54  (step @p34 :rule nary_cong :premises (@p33 @p30 @p26 @p22) :args (@t21))
% 0.31/0.54  (step @p35 :rule trans :premises (@p34 @p4))
% 0.31/0.54  (step @p36 :rule cong :premises (@p35) :args (@t22))
% 0.31/0.54  (step @p37 :rule trans :premises (@p36 @p3))
% 0.31/0.54  (step @p38 false :rule eq_resolve :premises (@p1 @p37))
% 0.31/0.54  )
% 0.31/0.54  % SZS output end Proof
% 0.31/0.54  % cvc5 exiting
%------------------------------------------------------------------------------