↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : LCL732^5 : TPTP v9.3.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 : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:23:43 AM UTC 2026

% Result   : Theorem 0.19s 0.49s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL732^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n019.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Fri Sep  4 19:33:53 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.14/0.43  %----Proving TH0
% 0.19/0.49  --- 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.19/0.49  % SZS status Theorem
% 0.19/0.49  % SZS output start Proof
% 0.19/0.49  (
% 0.19/0.49  (declare-sort tptp.b 0)
% 0.19/0.49  (declare-sort $$unsorted 0)
% 0.19/0.49  (declare-const tptp.p (-> $$unsorted Bool))
% 0.19/0.49  (declare-const tptp.y $$unsorted)
% 0.19/0.49  (define @t1 () (_ tptp.p tptp.y))
% 0.19/0.49  (define @t2 () (@var "Xx0" $$unsorted))
% 0.19/0.49  (define @t3 () (_ tptp.p @t2))
% 0.19/0.49  (define @t4 () (@list @t2))
% 0.19/0.49  (define @t5 () (exists @t4 @t3))
% 0.19/0.49  (define @t6 () (=> @t5 @t1))
% 0.19/0.49  (define @t7 () (@list (@var "Xx" (-> tptp.b Bool))))
% 0.19/0.49  (define @t8 () (forall @t7 @t6))
% 0.19/0.49  (define @t9 () (@list (@var "Xf" (-> (-> tptp.b Bool) tptp.b))))
% 0.19/0.49  (define @t10 () (exists @t9 @t8))
% 0.19/0.49  (define @t11 () (@list (@var "Xy0" tptp.b)))
% 0.19/0.49  (define @t12 () (exists @t11 @t6))
% 0.19/0.49  (define @t13 () (forall @t7 @t12))
% 0.19/0.49  (define @t14 () (=> @t13 @t10))
% 0.19/0.49  (define @t15 () (not @t14))
% 0.19/0.49  (define @t16 () (not @t1))
% 0.19/0.49  (define @t17 () (tptp.p @t2))
% 0.19/0.49  (define @t18 () (forall @t4 (not @t17)))
% 0.19/0.49  (define @t19 () (not @t18))
% 0.19/0.49  (define @t20 () (and @t19 @t16))
% 0.19/0.49  (define @t21 () (or @t18 @t1))
% 0.19/0.49  (define @t22 () (forall @t9 (not @t21)))
% 0.19/0.49  (define @t23 () (not @t22))
% 0.19/0.49  (define @t24 () (not @t19))
% 0.19/0.49  (define @t25 () (=> @t19 @t1))
% 0.19/0.49  (define @t26 () (not @t3))
% 0.19/0.49  (define @t27 () (forall @t4 @t26))
% 0.19/0.49  (define @t28 () (not @t27))
% 0.19/0.49  (define @t29 () (forall @t11 (not @t25)))
% 0.19/0.49  (define @t30 () (not @t29))
% 0.19/0.49  (assume @p1 @t15)
% 0.19/0.49  (assume @p2 true)
% 0.19/0.49  (step @p3 :rule quant-unused-vars :args ((= (forall @t9 @t20) @t20)))
% 0.19/0.49  (step @p4 :rule bool-or-de-morgan :args (@t18 @t1 false))
% 0.19/0.49  (step @p5 :rule cong :premises (@p4) :args (@t22))
% 0.19/0.49  (step @p6 :rule trans :premises (@p5 @p3))
% 0.19/0.49  (step @p7 :rule cong :premises (@p6) :args (@t23))
% 0.19/0.49  (step @p8 :rule exists-elim :args ((= (exists @t9 @t21) @t23)))
% 0.19/0.49  (step @p9 :rule trans :premises (@p8 @p7))
% 0.19/0.49  (step @p10 :rule quant-unused-vars :args ((= (forall @t7 @t21) @t21)))
% 0.19/0.49  (step @p11 :rule refl :args (@t1))
% 0.19/0.49  (step @p12 :rule bool-double-not-elim :args (@t18))
% 0.19/0.49  (step @p13 :rule nary_cong :premises (@p12 @p11) :args ((or @t24 @t1)))
% 0.19/0.49  (step @p14 :rule bool-impl-elim :args (@t19 @t1))
% 0.19/0.49  (step @p15 :rule trans :premises (@p14 @p13))
% 0.19/0.49  (step @p16 :rule cong :premises (@p15) :args ((forall @t7 @t25)))
% 0.19/0.49  (step @p17 :rule trans :premises (@p16 @p10))
% 0.19/0.49  (step @p18 :rule refl :args (@t1))
% 0.19/0.49  (step @p19 :rule refl :args (@t17))
% 0.19/0.49  (step @p20 :rule refl :args (@t3))
% 0.19/0.49  (step @p21 :rule cong :premises (@p20 @p19) :args ((= @t3 @t17)))
% 0.19/0.49  (step @p22 :rule symm :premises (@p21))
% 0.19/0.49  (step @p23 :rule eq_resolve :premises (@p20 @p22))
% 0.19/0.49  (step @p24 :rule cong :premises (@p23) :args (@t26))
% 0.19/0.49  (step @p25 :rule cong :premises (@p24) :args (@t27))
% 0.19/0.49  (step @p26 :rule cong :premises (@p25) :args (@t28))
% 0.19/0.49  (step @p27 :rule exists-elim :args ((= @t5 @t28)))
% 0.19/0.49  (step @p28 :rule trans :premises (@p27 @p26))
% 0.19/0.49  (step @p29 :rule cong :premises (@p28 @p18) :args (@t6))
% 0.19/0.49  (step @p30 :rule cong :premises (@p29) :args (@t8))
% 0.19/0.49  (step @p31 :rule trans :premises (@p30 @p17))
% 0.19/0.49  (step @p32 :rule cong :premises (@p31) :args (@t10))
% 0.19/0.49  (step @p33 :rule trans :premises (@p32 @p9))
% 0.19/0.49  (step @p34 :rule bool-double-not-elim :args (@t1))
% 0.19/0.49  (step @p35 :rule nary_cong :premises (@p12 @p34) :args ((or @t24 (not @t16))))
% 0.19/0.49  (step @p36 :rule bool-and-de-morgan :args (@t19 @t16 true))
% 0.19/0.49  (step @p37 :rule trans :premises (@p36 @p35))
% 0.19/0.49  (step @p38 :rule cong :premises (@p37) :args ((forall @t7 (not @t20))))
% 0.19/0.49  (step @p39 :rule trans :premises (@p38 @p10))
% 0.19/0.49  (step @p40 :rule quant-unused-vars :args ((= (forall @t11 @t20) @t20)))
% 0.19/0.49  (step @p41 :rule bool-implies-de-morgan :args (@t19 @t1))
% 0.19/0.49  (step @p42 :rule cong :premises (@p41) :args (@t29))
% 0.19/0.49  (step @p43 :rule trans :premises (@p42 @p40))
% 0.19/0.49  (step @p44 :rule cong :premises (@p43) :args (@t30))
% 0.19/0.49  (step @p45 :rule exists-elim :args ((= (exists @t11 @t25) @t30)))
% 0.19/0.49  (step @p46 :rule trans :premises (@p45 @p44))
% 0.19/0.49  (step @p47 :rule cong :premises (@p29) :args (@t12))
% 0.19/0.49  (step @p48 :rule trans :premises (@p47 @p46))
% 0.19/0.49  (step @p49 :rule cong :premises (@p48) :args (@t13))
% 0.19/0.49  (step @p50 :rule trans :premises (@p49 @p39))
% 0.19/0.49  (step @p51 :rule cong :premises (@p50 @p33) :args (@t14))
% 0.19/0.49  (step @p52 :rule cong :premises (@p51) :args (@t15))
% 0.19/0.49  (step @p53 :rule eq_resolve :premises (@p1 @p52))
% 0.19/0.49  (step @p54 :rule not_implies_elim2 :premises (@p53))
% 0.19/0.49  (step @p55 :rule not_not_elim :premises (@p54))
% 0.19/0.49  (step @p56 :rule and_elim :premises (@p55) :args (1))
% 0.19/0.49  (step @p57 :rule and_elim :premises (@p55) :args (0))
% 0.19/0.49  (step @p58 :rule cnf_or_pos :args (@t21))
% 0.19/0.49  (step @p59 :rule chain_resolution :premises (@p58 @p57 @p56) :args ((@list true true) (@list @t18 @t1)))
% 0.19/0.49  (step @p60 :rule not_implies_elim1 :premises (@p53))
% 0.19/0.49  (step @p61 false :rule contra :premises (@p60 @p59))
% 0.19/0.49  )
% 0.19/0.49  % SZS output end Proof
% 0.19/0.50  % cvc5 exiting
%------------------------------------------------------------------------------