↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n008.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:52:06 AM UTC 2026

% Result   : Theorem 0.34s 0.56s
% Output   : Proof 0.34s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU536^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.14  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.35  % Computer : n008.cluster.edu
% 0.19/0.35  % Model    : x86_64 x86_64
% 0.19/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.35  % Memory   : 8042.1875MB
% 0.19/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.35  % CPULimit : 300
% 0.19/0.35  % WCLimit  : 300
% 0.19/0.35  % DateTime : Tue Jun  2 17:41:18 EDT 2026
% 0.19/0.35  % CPUTime  : 
% 0.34/0.50  %----Proving TH0
% 0.34/0.56  --- 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.34/0.56  % SZS status Theorem
% 0.34/0.56  % SZS output start Proof
% 0.34/0.56  (
% 0.34/0.56  (declare-sort $$unsorted 0)
% 0.34/0.56  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.34/0.56  (define @t1 () (@var "Xx" $$unsorted))
% 0.34/0.56  (define @t2 () (@var "Xphi" (-> $$unsorted Bool)))
% 0.34/0.56  (define @t3 () (_ @t2 @t1))
% 0.34/0.56  (define @t4 () (not @t3))
% 0.34/0.56  (define @t5 () (@var "A" $$unsorted))
% 0.34/0.56  (define @t6 () (_ (_ tptp.in @t1) @t5))
% 0.34/0.56  (define @t7 () (and @t6 @t4))
% 0.34/0.56  (define @t8 () (@list @t1))
% 0.34/0.56  (define @t9 () (exists @t8 @t7))
% 0.34/0.56  (define @t10 () (forall @t8 (=> @t6 @t3)))
% 0.34/0.56  (define @t11 () (not @t10))
% 0.34/0.56  (define @t12 () (=> @t11 @t9))
% 0.34/0.56  (define @t13 () (@list @t5 @t2))
% 0.34/0.56  (define @t14 () (forall @t13 @t12))
% 0.34/0.56  (define @t15 () (not @t14))
% 0.34/0.56  (define @t16 () (_ @t2 @t1))
% 0.34/0.56  (define @t17 () (tptp.in @t1 @t5))
% 0.34/0.56  (define @t18 () (forall @t8 (or (not @t17) @t16)))
% 0.34/0.56  (define @t19 () (not @t18))
% 0.34/0.56  (define @t20 () (not @t6))
% 0.34/0.56  (define @t21 () (or @t20 @t3))
% 0.34/0.56  (define @t22 () (forall @t8 (not @t7)))
% 0.34/0.56  (define @t23 () (not @t22))
% 0.34/0.56  (assume @p1 @t15)
% 0.34/0.56  (assume @p2 true)
% 0.34/0.56  (step @p3 :rule evaluate :args ((not true)))
% 0.34/0.56  (step @p4 :rule quant-unused-vars :args ((= (forall @t13 true) true)))
% 0.34/0.56  (step @p5 :rule bool-or-taut :args (false @t18 false false))
% 0.34/0.56  (step @p6 :rule refl :args (@t19))
% 0.34/0.56  (step @p7 :rule bool-double-not-elim :args (@t18))
% 0.34/0.56  (step @p8 :rule nary_cong :premises (@p7 @p6) :args ((or (not @t19) @t19)))
% 0.34/0.56  (step @p9 :rule bool-impl-elim :args (@t19 @t19))
% 0.34/0.56  (step @p10 :rule trans :premises (@p9 @p8))
% 0.34/0.56  (step @p11 :rule trans :premises (@p10 @p5))
% 0.34/0.56  (step @p12 :rule cong :premises (@p11) :args ((forall @t13 (=> @t19 @t19))))
% 0.34/0.56  (step @p13 :rule trans :premises (@p12 @p4))
% 0.34/0.56  (step @p14 :rule refl :args (@t16))
% 0.34/0.56  (step @p15 :rule refl :args (@t3))
% 0.34/0.56  (step @p16 :rule cong :premises (@p15 @p14) :args ((= @t3 @t16)))
% 0.34/0.56  (step @p17 :rule symm :premises (@p16))
% 0.34/0.56  (step @p18 :rule eq_resolve :premises (@p15 @p17))
% 0.34/0.56  (step @p19 :rule refl :args (@t17))
% 0.34/0.56  (step @p20 :rule refl :args (@t6))
% 0.34/0.56  (step @p21 :rule cong :premises (@p20 @p19) :args ((= @t6 @t17)))
% 0.34/0.56  (step @p22 :rule symm :premises (@p21))
% 0.34/0.56  (step @p23 :rule eq_resolve :premises (@p20 @p22))
% 0.34/0.56  (step @p24 :rule cong :premises (@p23) :args (@t20))
% 0.34/0.56  (step @p25 :rule nary_cong :premises (@p24 @p18) :args (@t21))
% 0.34/0.56  (step @p26 :rule cong :premises (@p25) :args ((forall @t8 @t21)))
% 0.34/0.56  (step @p27 :rule bool-double-not-elim :args (@t3))
% 0.34/0.56  (step @p28 :rule refl :args (@t20))
% 0.34/0.56  (step @p29 :rule nary_cong :premises (@p28 @p27) :args ((or @t20 (not @t4))))
% 0.34/0.56  (step @p30 :rule bool-and-de-morgan :args (@t6 @t4 true))
% 0.34/0.56  (step @p31 :rule trans :premises (@p30 @p29))
% 0.34/0.56  (step @p32 :rule cong :premises (@p31) :args (@t22))
% 0.34/0.56  (step @p33 :rule trans :premises (@p32 @p26))
% 0.34/0.56  (step @p34 :rule cong :premises (@p33) :args (@t23))
% 0.34/0.56  (step @p35 :rule exists-elim :args ((= @t9 @t23)))
% 0.34/0.56  (step @p36 :rule trans :premises (@p35 @p34))
% 0.34/0.56  (step @p37 :rule bool-impl-elim :args (@t6 @t3))
% 0.34/0.56  (step @p38 :rule cong :premises (@p37) :args (@t10))
% 0.34/0.56  (step @p39 :rule trans :premises (@p38 @p26))
% 0.34/0.56  (step @p40 :rule cong :premises (@p39) :args (@t11))
% 0.34/0.56  (step @p41 :rule cong :premises (@p40 @p36) :args (@t12))
% 0.34/0.56  (step @p42 :rule cong :premises (@p41) :args (@t14))
% 0.34/0.56  (step @p43 :rule trans :premises (@p42 @p13))
% 0.34/0.56  (step @p44 :rule cong :premises (@p43) :args (@t15))
% 0.34/0.56  (step @p45 :rule trans :premises (@p44 @p3))
% 0.34/0.56  (step @p46 false :rule eq_resolve :premises (@p1 @p45))
% 0.34/0.56  )
% 0.34/0.56  % SZS output end Proof
% 0.34/0.56  % cvc5 exiting
%------------------------------------------------------------------------------