TSTP Solution File: CSR149^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR149^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n024.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 Aug 30 21:07:19 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR149^1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 13:36:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TH0
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 % File : CSR149^1 : TPTP v8.1.2. Released v4.1.0.
% 0.20/0.50 % Domain : Commonsense Reasoning
% 0.20/0.50 % Problem : Elegantly, is there a year in which Sue liked somebody?
% 0.20/0.50 % Version : Especial > Reduced > Especial.
% 0.20/0.50 % English : What holds that holds at all times (elegantly expressed). Mary
% 0.20/0.50 % likes Bill. During 2009 Sue liked whoever Mary liked. Is there a
% 0.20/0.50 % year in which Sue liked somebody?
% 0.20/0.50
% 0.20/0.50 % Refs : [PS07] Pease & Sutcliffe (2007), First Order Reasoning on a L
% 0.20/0.50 % : [BP10] Benzmueller & Pease (2010), Progress in Automating Hig
% 0.20/0.50 % : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.20/0.50 % Source : [Ben10]
% 0.20/0.50 % Names : paar_5.tq_SUMO_local [Ben10]
% 0.20/0.50
% 0.20/0.50 % Status : Theorem
% 0.20/0.50 % Rating : 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.50 v6.0.0, 0.00 v5.4.0, 0.25 v5.3.0, 0.50 v4.1.0
% 0.20/0.50 % Syntax : Number of formulae : 12 ( 1 unt; 8 typ; 0 def)
% 0.20/0.50 % Number of atoms : 8 ( 0 equ; 0 cnn)
% 0.20/0.50 % Maximal formula atoms : 3 ( 2 avg)
% 0.20/0.50 % Number of connectives : 17 ( 0 ~; 0 |; 0 &; 16 @)
% 0.20/0.50 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.20/0.50 % Maximal formula depth : 6 ( 5 avg)
% 0.20/0.50 % Number of types : 3 ( 1 usr)
% 0.20/0.50 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.20/0.50 % Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% 0.20/0.50 % Number of variables : 4 ( 0 ^; 2 !; 2 ?; 4 :)
% 0.20/0.50 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.50
% 0.20/0.50 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.20/0.50 % Initally the problem has been hand generated in KIF syntax in
% 0.20/0.50 % SigmaKEE and then automatically translated by Benzmueller's
% 0.20/0.50 % KIF2TH0 translator into THF syntax.
% 0.20/0.50 % : The translation has been applied in two modes: local and SInE.
% 0.20/0.50 % The local mode only translates the local assumptions and the
% 0.20/0.50 % query. The SInE mode additionally translates the SInE-extract
% 0.20/0.50 % of the loaded knowledge base (usually SUMO).
% 0.20/0.50 % : The examples are selected to illustrate the benefits of
% 0.20/0.50 % higher-order reasoning in ontology reasoning.
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 %----The extracted Signature
% 0.20/0.50 thf(numbers,type,
% 0.20/0.50 num: $tType ).
% 0.20/0.50
% 0.20/0.50 thf(holdsDuring_THFTYPE_IiooI,type,
% 0.20/0.50 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.20/0.50
% 0.20/0.50 thf(lBill_THFTYPE_i,type,
% 0.20/0.50 lBill_THFTYPE_i: $i ).
% 0.20/0.50
% 0.20/0.50 thf(lMary_THFTYPE_i,type,
% 0.20/0.50 lMary_THFTYPE_i: $i ).
% 0.20/0.50
% 0.20/0.50 thf(lSue_THFTYPE_i,type,
% 0.20/0.50 lSue_THFTYPE_i: $i ).
% 0.20/0.50
% 0.20/0.50 thf(lYearFn_THFTYPE_IiiI,type,
% 0.20/0.50 lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.20/0.50
% 0.20/0.50 thf(likes_THFTYPE_IiioI,type,
% 0.20/0.50 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.20/0.50
% 0.20/0.50 thf(n2009_THFTYPE_i,type,
% 0.20/0.50 n2009_THFTYPE_i: $i ).
% 0.20/0.50
% 0.20/0.50 %----The translated axioms
% 0.20/0.50 thf(ax,axiom,
% 0.20/0.50 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.20/0.50
% 0.20/0.50 thf(ax_001,axiom,
% 0.20/0.50 ! [Y: $i] : ( holdsDuring_THFTYPE_IiooI @ Y @ $true ) ).
% 0.20/0.50
% 0.20/0.50 thf(ax_002,axiom,
% 0.20/0.50 ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.20/0.50 @ ! [X: $i] :
% 0.20/0.50 ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 0.20/0.50 => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 0.20/0.50
% 0.20/0.50 %----The translated conjectures
% 0.20/0.50 thf(con,conjecture,
% 0.20/0.50 ? [X: $i,Y: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ Y ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ).
% 0.20/0.50
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.9vPsk92UEV/cvc5---1.0.5_20432.p...
% 0.20/0.50 (declare-sort $$unsorted 0)
% 0.20/0.50 (declare-sort tptp.num 0)
% 0.20/0.50 (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.20/0.50 (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.20/0.50 (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.20/0.50 (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.20/0.50 (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.20/0.50 (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.20/0.53 (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.20/0.53 (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.20/0.53 (assert (forall ((Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI Y) true)))
% 0.20/0.53 (assert (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (forall ((X $$unsorted)) (=> (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) X) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))
% 0.20/0.53 (assert (not (exists ((X $$unsorted) (Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI Y)) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))
% 0.20/0.53 (set-info :filename cvc5---1.0.5_20432)
% 0.20/0.53 (check-sat-assuming ( true ))
% 0.20/0.53 ------- get file name : TPTP file name is CSR149^1
% 0.20/0.53 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_20432.smt2...
% 0.20/0.53 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.53 % SZS status Theorem for CSR149^1
% 0.20/0.53 % SZS output start Proof for CSR149^1
% 0.20/0.53 (
% 0.20/0.53 (let ((_let_1 (not (exists ((X $$unsorted) (Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI Y)) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))) (let ((_let_2 (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)))) (let ((_let_3 (@ _let_2 (forall ((X $$unsorted)) (=> (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) X) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))) (let ((_let_4 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_5 (ho_6 k_5 (ho_9 k_8 tptp.n2009_THFTYPE_i)))) (let ((_let_6 (ho_7 _let_5 BOOLEAN_TERM_VARIABLE_869))) (let ((_let_7 (ho_7 _let_5 BOOLEAN_TERM_VARIABLE_1265))) (let ((_let_8 (APPLY_UF ho_7))) (let ((_let_9 (forall ((X $$unsorted)) (or (not (ho_4 (ho_3 k_2 tptp.lMary_THFTYPE_i) X)) (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) X))))) (let ((_let_10 (MACRO_SR_PRED_INTRO :args ((= _let_9 BOOLEAN_TERM_VARIABLE_869))))) (let ((_let_11 (REFL :args (_let_5)))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_3)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (@ _let_2 (forall ((X $$unsorted)) (or (not (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) X)) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))) (ho_7 _let_5 _let_9)))) (CONG _let_11 _let_10 :args _let_8))))) (let ((_let_13 (not BOOLEAN_TERM_VARIABLE_869))) (let ((_let_14 (ho_3 k_2 tptp.lSue_THFTYPE_i))) (let ((_let_15 (ho_4 _let_14 tptp.lBill_THFTYPE_i))) (let ((_let_16 (ho_3 k_2 tptp.lMary_THFTYPE_i))) (let ((_let_17 (ho_4 _let_16 tptp.lBill_THFTYPE_i))) (let ((_let_18 (not _let_17))) (let ((_let_19 (or _let_18 _let_15))) (let ((_let_20 (ho_7 _let_5 BOOLEAN_TERM_VARIABLE_1178))) (let ((_let_21 (not _let_9))) (let ((_let_22 (_let_9))) (let ((_let_23 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_24 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_25 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_26 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_27 (forall ((u |u_(-> Bool Bool)|) (e Bool) (i Bool)) (not (forall ((v |u_(-> Bool Bool)|)) (not (forall ((ii Bool)) (= (ho_7 v ii) (ite (= i ii) e (ho_7 u ii)))))))))) (let ((_let_28 (forall ((x |u_(-> Bool Bool)|) (y |u_(-> Bool Bool)|)) (or (not (forall ((z Bool)) (= (ho_7 x z) (ho_7 y z)))) (= x y))))) (let ((_let_29 (forall ((u |u_(-> $$unsorted Bool Bool)|) (e |u_(-> Bool Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_6 v ii) (ite (= i ii) e (ho_6 u ii)))))))))) (let ((_let_30 (forall ((x |u_(-> $$unsorted Bool Bool)|) (y |u_(-> $$unsorted Bool Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_6 x z) (ho_6 y z)))) (= x y))))) (let ((_let_31 (forall ((u |u_(-> $$unsorted $$unsorted)|) (e $$unsorted) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted)|)) (not (forall ((ii $$unsorted)) (= (ho_9 v ii) (ite (= i ii) e (ho_9 u ii)))))))))) (let ((_let_32 (forall ((x |u_(-> $$unsorted $$unsorted)|) (y |u_(-> $$unsorted $$unsorted)|)) (or (not (forall ((z $$unsorted)) (= (ho_9 x z) (ho_9 y z)))) (= x y))))) (let ((_let_33 (SYMM (MACRO_SR_PRED_INTRO :args ((= BOOLEAN_TERM_VARIABLE_1178 _let_15)))))) (let ((_let_34 (forall ((X $$unsorted) (Y $$unsorted)) (not (ho_7 (ho_6 k_5 (ho_9 k_8 Y)) (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) X)))))) (let ((_let_35 (not _let_20))) (let ((_let_36 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((X $$unsorted) (Y $$unsorted)) (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI Y)) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))) _let_34))))))) (let ((_let_37 (=>))) (let ((_let_38 (not))) (let ((_let_39 (_let_34))) (let ((_let_40 (REFL :args _let_39))) (let ((_let_41 (not BOOLEAN_TERM_VARIABLE_1178))) (let ((_let_42 (not _let_6))) (let ((_let_43 (or))) (let ((_let_44 (REFL :args (_let_42)))) (let ((_let_45 (_let_13))) (let ((_let_46 (TRUE_INTRO _let_12))) (let ((_let_47 (ASSUME :args (BOOLEAN_TERM_VARIABLE_869)))) (let ((_let_48 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1178)))) (let ((_let_49 (ASSUME :args (_let_35)))) (let ((_let_50 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_12 _let_47 _let_48 _let_49) :args (BOOLEAN_TERM_VARIABLE_869 _let_6 BOOLEAN_TERM_VARIABLE_1178 _let_35)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_49)) (CONG _let_11 (TRANS (TRUE_INTRO _let_48) (SYMM (TRUE_INTRO _let_47))) :args _let_8) _let_46)) :args (_let_6 BOOLEAN_TERM_VARIABLE_869 BOOLEAN_TERM_VARIABLE_1178 _let_35)) :args ((not (and BOOLEAN_TERM_VARIABLE_869 _let_6 BOOLEAN_TERM_VARIABLE_1178 _let_35)) SB_LITERAL))) (CONG (REFL :args _let_45) _let_44 (REFL :args (_let_41)) (MACRO_SR_PRED_INTRO :args ((= (not _let_35) _let_20))) :args _let_43)) :args ((or _let_42 _let_13 _let_20 _let_41))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_36 :args (tptp.lBill_THFTYPE_i tptp.n2009_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_39) (CONG _let_40 (CONG (CONG _let_11 _let_33 :args _let_8) :args _let_38) :args _let_37))) _let_36 :args (_let_35 false _let_34)) _let_12 (EQUIV_ELIM1 _let_33) (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_15 (not _let_19)))) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_4)) (PREPROCESS :args ((= _let_4 _let_17)))) (PREPROCESS :args ((and _let_32 _let_31 _let_30 _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23)))) :args ((and _let_17 _let_32 _let_31 _let_30 _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23))) :args (0)) (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_22) :args (tptp.lBill_THFTYPE_i QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (ho_4 _let_16 X) false))))) :args _let_22)) (REORDERING (EQUIV_ELIM1 _let_10) :args ((or BOOLEAN_TERM_VARIABLE_869 _let_21))) :args (_let_21 true _let_20 false _let_6 false BOOLEAN_TERM_VARIABLE_1178 false _let_15 false _let_17 false _let_19 false BOOLEAN_TERM_VARIABLE_869)))) (let ((_let_51 (not _let_7))) (let ((_let_52 (ho_4 _let_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_13))) (let ((_let_53 (MACRO_SR_PRED_INTRO :args ((= _let_52 BOOLEAN_TERM_VARIABLE_1265))))) (let ((_let_54 (not BOOLEAN_TERM_VARIABLE_1265))) (let ((_let_55 (or (not (ho_4 _let_16 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_13)) _let_52))) (let ((_let_56 (not _let_55))) (let ((_let_57 (_let_21))) (let ((_let_58 (ASSUME :args _let_45))) (let ((_let_59 (ASSUME :args (_let_54)))) (let ((_let_60 (ASSUME :args (_let_51)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_12 _let_58 _let_59 _let_60) :args (_let_6 _let_13 _let_51 _let_54)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_60)) (CONG _let_11 (TRANS (FALSE_INTRO _let_59) (SYMM (FALSE_INTRO _let_58))) :args _let_8) _let_46)) :args (_let_6 _let_13 _let_54 _let_51)) :args ((not (and _let_6 _let_13 _let_51 _let_54)) SB_LITERAL))) (CONG _let_44 (MACRO_SR_PRED_INTRO :args ((= (not _let_13) BOOLEAN_TERM_VARIABLE_869))) (MACRO_SR_PRED_INTRO :args ((= (not _let_51) _let_7))) (MACRO_SR_PRED_INTRO :args ((= (not _let_54) BOOLEAN_TERM_VARIABLE_1265))) :args _let_43)) :args ((or BOOLEAN_TERM_VARIABLE_869 _let_42 BOOLEAN_TERM_VARIABLE_1265 _let_7))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_53) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_55 1)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_57)) :args _let_57)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_21) _let_9))) (REFL :args (_let_56)) :args _let_43)) _let_50 :args (_let_56 true _let_9)) :args ((not _let_52) true _let_55)) :args (_let_54 true _let_52)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_36 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_13 tptp.n2009_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_39) (CONG _let_40 (CONG (CONG _let_11 _let_53 :args _let_8) :args _let_38) :args _let_37))) _let_36 :args (_let_51 false _let_34)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_10) _let_50 :args (_let_13 true _let_9)) _let_12 :args (false true BOOLEAN_TERM_VARIABLE_1265 true _let_7 true BOOLEAN_TERM_VARIABLE_869 false _let_6)) :args (_let_4 (forall ((Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI Y) true)) _let_3 _let_1 true)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.20/0.54 )
% 0.20/0.54 % SZS output end Proof for CSR149^1
% 0.20/0.54 % cvc5---1.0.5 exiting
% 0.20/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------