TSTP Solution File: CSR153^1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : CSR153^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n020.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:27 EDT 2023

% Result   : Theorem 0.22s 0.68s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : CSR153^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n020.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Aug 28 07:35:59 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.49  %----Proving TH0
% 0.22/0.50  %------------------------------------------------------------------------------
% 0.22/0.50  % File     : CSR153^1 : TPTP v8.1.2. Released v4.1.0.
% 0.22/0.50  % Domain   : Commonsense Reasoning
% 0.22/0.50  % Problem  : Is there a common relation?
% 0.22/0.50  % Version  : Especial > Reduced > Especial.
% 0.22/0.50  % English  : Mary, Sue, Bill and Bob are mutually distinct. Mary is neither a
% 0.22/0.50  %            sister of Sue nor of Bill. Bob is not a brother of Mary. Sue is a
% 0.22/0.50  %            sister of Bill and of Bob. Bob is a brother of Bill. Is there a 
% 0.22/0.50  %            relation that holds both between Bob and Bill and between Sue and 
% 0.22/0.50  %            Bob?
% 0.22/0.50  
% 0.22/0.50  % Refs     : [PS07]  Pease & Sutcliffe (2007), First Order Reasoning on a L
% 0.22/0.50  %          : [BP10]  Benzmueller & Pease (2010), Progress in Automating Hig
% 0.22/0.50  %          : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.22/0.50  % Source   : [Ben10]
% 0.22/0.50  % Names    : paar_9.tq_SUMO_local [Ben10]
% 0.22/0.50  
% 0.22/0.50  % Status   : Theorem
% 0.22/0.50  % Rating   : 0.46 v8.1.0, 0.45 v7.5.0, 0.29 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v6.1.0, 0.57 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v5.1.0, 0.40 v5.0.0, 0.60 v4.1.0
% 0.22/0.50  % Syntax   : Number of formulae    :   13 (   1 unt;   7 typ;   0 def)
% 0.22/0.50  %            Number of atoms       :   22 (   6 equ;  10 cnn)
% 0.22/0.50  %            Maximal formula atoms :    6 (   3 avg)
% 0.22/0.50  %            Number of connectives :   47 (  10   ~;   0   |;   9   &;  28   @)
% 0.22/0.50  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.22/0.50  %            Maximal formula depth :    9 (   5 avg)
% 0.22/0.50  %            Number of types       :    3 (   1 usr)
% 0.22/0.50  %            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
% 0.22/0.50  %            Number of symbols     :    8 (   6 usr;   5 con; 0-2 aty)
% 0.22/0.50  %            Number of variables   :    3 (   0   ^;   2   !;   1   ?;   3   :)
% 0.22/0.50  % SPC      : TH0_THM_EQU_NAR
% 0.22/0.50  
% 0.22/0.50  % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.22/0.50  %            Initally the problem has been hand generated in KIF syntax in
% 0.22/0.50  %            SigmaKEE and then automatically translated by Benzmueller's
% 0.22/0.50  %            KIF2TH0 translator into THF syntax.
% 0.22/0.50  %          : The translation has been applied in two modes: local and SInE.
% 0.22/0.50  %            The local mode only translates the local assumptions and the
% 0.22/0.50  %            query. The SInE mode additionally translates the SInE-extract
% 0.22/0.50  %            of the loaded knowledge base (usually SUMO).
% 0.22/0.50  %          : The examples are selected to illustrate the benefits of
% 0.22/0.50  %            higher-order reasoning in ontology reasoning.
% 0.22/0.50  %------------------------------------------------------------------------------
% 0.22/0.50  %----The extracted Signature
% 0.22/0.50  thf(numbers,type,
% 0.22/0.50      num: $tType ).
% 0.22/0.50  
% 0.22/0.50  thf(brother_THFTYPE_IiioI,type,
% 0.22/0.50      brother_THFTYPE_IiioI: $i > $i > $o ).
% 0.22/0.50  
% 0.22/0.50  thf(lBill_THFTYPE_i,type,
% 0.22/0.50      lBill_THFTYPE_i: $i ).
% 0.22/0.50  
% 0.22/0.50  thf(lBob_THFTYPE_i,type,
% 0.22/0.50      lBob_THFTYPE_i: $i ).
% 0.22/0.50  
% 0.22/0.50  thf(lMary_THFTYPE_i,type,
% 0.22/0.50      lMary_THFTYPE_i: $i ).
% 0.22/0.50  
% 0.22/0.50  thf(lSue_THFTYPE_i,type,
% 0.22/0.50      lSue_THFTYPE_i: $i ).
% 0.22/0.50  
% 0.22/0.50  thf(sister_THFTYPE_IiioI,type,
% 0.22/0.50      sister_THFTYPE_IiioI: $i > $i > $o ).
% 0.22/0.50  
% 0.22/0.50  %----The translated axioms
% 0.22/0.50  thf(ax,axiom,
% 0.22/0.50      ( ( sister_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
% 0.22/0.50      & ( sister_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBob_THFTYPE_i )
% 0.22/0.50      & ( brother_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ) ).
% 0.22/0.50  
% 0.22/0.50  thf(ax_001,axiom,
% 0.22/0.50      ( ( (~) @ ( lMary_THFTYPE_i = lSue_THFTYPE_i ) )
% 0.22/0.50      & ( (~) @ ( lMary_THFTYPE_i = lBill_THFTYPE_i ) )
% 0.22/0.50      & ( (~) @ ( lBob_THFTYPE_i = lMary_THFTYPE_i ) ) ) ).
% 0.22/0.50  
% 0.22/0.50  thf(ax_002,axiom,
% 0.22/0.50      ( ( (~) @ ( lSue_THFTYPE_i = lBill_THFTYPE_i ) )
% 0.22/0.50      & ( (~) @ ( lSue_THFTYPE_i = lBob_THFTYPE_i ) ) ) ).
% 0.22/0.50  
% 0.22/0.50  thf(ax_003,axiom,
% 0.22/0.50      ( ( (~) @ ( sister_THFTYPE_IiioI @ lMary_THFTYPE_i @ lSue_THFTYPE_i ) )
% 0.22/0.50      & ( (~) @ ( sister_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
% 0.22/0.50      & ( (~) @ ( brother_THFTYPE_IiioI @ lBob_THFTYPE_i @ lMary_THFTYPE_i ) ) ) ).
% 0.22/0.50  
% 0.22/0.50  thf(ax_004,axiom,
% 0.22/0.50      (~) @ ( lBob_THFTYPE_i = lBill_THFTYPE_i ) ).
% 0.22/0.50  
% 0.22/0.50  %----The translated conjectures
% 0.22/0.50  thf(con,conjecture,
% 0.22/0.50      ? [R: $i > $i > $o] :
% 0.22/0.50        ( ( R @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
% 0.22/0.50        & ( R @ lSue_THFTYPE_i @ lBob_THFTYPE_i )
% 0.22/0.50        & ( (~)
% 0.22/0.68          @ ! [X: $i,Y: $i] : ( R @ X @ Y ) ) ) ).
% 0.22/0.68  
% 0.22/0.68  %------------------------------------------------------------------------------
% 0.22/0.68  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.YbUQ5rGCkJ/cvc5---1.0.5_25891.p...
% 0.22/0.68  (declare-sort $$unsorted 0)
% 0.22/0.68  (declare-sort tptp.num 0)
% 0.22/0.68  (declare-fun tptp.brother_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.22/0.68  (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.22/0.68  (declare-fun tptp.lBob_THFTYPE_i () $$unsorted)
% 0.22/0.68  (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.22/0.68  (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.22/0.68  (declare-fun tptp.sister_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.22/0.68  (assert (let ((_let_1 (@ tptp.sister_THFTYPE_IiioI tptp.lSue_THFTYPE_i))) (and (@ _let_1 tptp.lBill_THFTYPE_i) (@ _let_1 tptp.lBob_THFTYPE_i) (@ (@ tptp.brother_THFTYPE_IiioI tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i))))
% 0.22/0.68  (assert (and (not (= tptp.lMary_THFTYPE_i tptp.lSue_THFTYPE_i)) (not (= tptp.lMary_THFTYPE_i tptp.lBill_THFTYPE_i)) (not (= tptp.lBob_THFTYPE_i tptp.lMary_THFTYPE_i))))
% 0.22/0.68  (assert (and (not (= tptp.lSue_THFTYPE_i tptp.lBill_THFTYPE_i)) (not (= tptp.lSue_THFTYPE_i tptp.lBob_THFTYPE_i))))
% 0.22/0.68  (assert (let ((_let_1 (@ tptp.sister_THFTYPE_IiioI tptp.lMary_THFTYPE_i))) (and (not (@ _let_1 tptp.lSue_THFTYPE_i)) (not (@ _let_1 tptp.lBill_THFTYPE_i)) (not (@ (@ tptp.brother_THFTYPE_IiioI tptp.lBob_THFTYPE_i) tptp.lMary_THFTYPE_i)))))
% 0.22/0.68  (assert (not (= tptp.lBob_THFTYPE_i tptp.lBill_THFTYPE_i)))
% 0.22/0.68  (assert (not (exists ((R (-> $$unsorted $$unsorted Bool))) (and (@ (@ R tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ R tptp.lSue_THFTYPE_i) tptp.lBob_THFTYPE_i) (not (forall ((X $$unsorted) (Y $$unsorted)) (@ (@ R X) Y)))))))
% 0.22/0.68  (set-info :filename cvc5---1.0.5_25891)
% 0.22/0.68  (check-sat-assuming ( true ))
% 0.22/0.68  ------- get file name : TPTP file name is CSR153^1
% 0.22/0.68  ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_25891.smt2...
% 0.22/0.68  --- Run --ho-elim --full-saturate-quant at 10...
% 0.22/0.68  % SZS status Theorem for CSR153^1
% 0.22/0.68  % SZS output start Proof for CSR153^1
% 0.22/0.68  (
% 0.22/0.68  (let ((_let_1 (not (exists ((R (-> $$unsorted $$unsorted Bool))) (and (@ (@ R tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ R tptp.lSue_THFTYPE_i) tptp.lBob_THFTYPE_i) (not (forall ((X $$unsorted) (Y $$unsorted)) (@ (@ R X) Y)))))))) (let ((_let_2 (@ tptp.brother_THFTYPE_IiioI tptp.lBob_THFTYPE_i))) (let ((_let_3 (@ tptp.sister_THFTYPE_IiioI tptp.lMary_THFTYPE_i))) (let ((_let_4 (and (not (@ _let_3 tptp.lSue_THFTYPE_i)) (not (@ _let_3 tptp.lBill_THFTYPE_i)) (not (@ _let_2 tptp.lMary_THFTYPE_i))))) (let ((_let_5 (and (not (= tptp.lSue_THFTYPE_i tptp.lBill_THFTYPE_i)) (not (= tptp.lSue_THFTYPE_i tptp.lBob_THFTYPE_i))))) (let ((_let_6 (@ tptp.sister_THFTYPE_IiioI tptp.lSue_THFTYPE_i))) (let ((_let_7 (and (@ _let_6 tptp.lBill_THFTYPE_i) (@ _let_6 tptp.lBob_THFTYPE_i) (@ _let_2 tptp.lBill_THFTYPE_i)))) (let ((_let_8 (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_252 tptp.lBob_THFTYPE_i))) (let ((_let_9 (ho_4 _let_8 tptp.lBill_THFTYPE_i))) (let ((_let_10 (ho_4 _let_8 tptp.lMary_THFTYPE_i))) (let ((_let_11 (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_252 tptp.lSue_THFTYPE_i))) (let ((_let_12 (ho_4 _let_11 tptp.lBob_THFTYPE_i))) (let ((_let_13 (not _let_12))) (let ((_let_14 (not _let_9))) (let ((_let_15 (or _let_14 _let_13 _let_10))) (let ((_let_16 (ho_3 k_2 tptp.lBob_THFTYPE_i))) (let ((_let_17 (= _let_16 termITE_259))) (let ((_let_18 (= _let_8 termITE_259))) (let ((_let_19 (ho_4 _let_16 tptp.lBill_THFTYPE_i))) (let ((_let_20 (= tptp.lBob_THFTYPE_i tptp.lSue_THFTYPE_i))) (let ((_let_21 (1))) (let ((_let_22 (ho_3 k_5 tptp.lSue_THFTYPE_i))) (let ((_let_23 ((ite _let_20 (= termITE_259 _let_22) (= termITE_259 _let_16))))) (let ((_let_24 (ite _let_20 _let_22 _let_16))) (let ((_let_25 (MACRO_SR_PRED_INTRO :args ((= _let_24 termITE_259))))) (let ((_let_26 (MACRO_RESOLUTION_TRUST (ITE_ELIM2 (EQ_RESOLVE (MACRO_SR_PRED_TRANSFORM (REMOVE_TERM_FORMULA_AXIOM :args (_let_24)) _let_25 :args _let_23) (REWRITE :args _let_23))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))) :args _let_21) :args (_let_17 true _let_20)))) (let ((_let_27 (forall ((ii $$unsorted)) (= (ite (= tptp.lSue_THFTYPE_i ii) (ho_3 k_5 tptp.lSue_THFTYPE_i) (ho_3 k_2 ii)) (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_252 ii))))) (let ((_let_28 (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= tptp.lSue_THFTYPE_i ii) (ho_3 k_5 tptp.lSue_THFTYPE_i) (ho_3 k_2 ii)))))))) (let ((_let_29 (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_30 (not _let_28))) (let ((_let_31 (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_32 (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_33 (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_34 (ho_4 _let_22 tptp.lBob_THFTYPE_i))) (let ((_let_35 (ho_4 _let_22 tptp.lBill_THFTYPE_i))) (let ((_let_36 (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_7)) (PREPROCESS :args ((= _let_7 (and _let_35 _let_34 _let_19))))) (PREPROCESS :args ((and _let_33 _let_29 _let_32 _let_31)))) :args ((and _let_35 _let_34 _let_19 _let_33 _let_29 _let_32 _let_31))))) (let ((_let_37 (_let_29))) (let ((_let_38 (or))) (let ((_let_39 (_let_27))) (let ((_let_40 (REFL :args _let_39))) (let ((_let_41 (_let_30))) (let ((_let_42 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE (ASSUME :args _let_41)) :args _let_41) (REWRITE :args ((=> _let_30 (not (not (forall ((ii $$unsorted)) (= (ho_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_252 ii) (ite (= tptp.lSue_THFTYPE_i ii) (ho_3 k_5 tptp.lSue_THFTYPE_i) (ho_3 k_2 ii))))))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_30) _let_28))) _let_40 :args _let_38)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_37) :args (k_2 _let_22 tptp.lSue_THFTYPE_i QUANTIFIERS_INST_ENUM)) :args _let_37)) (AND_ELIM _let_36 :args (4)) :args (_let_30 false _let_29)) :args (_let_27 true _let_28)))) (let ((_let_43 ((ho_3 k_2 ii)))) (let ((_let_44 (ASSUME :args _let_39))) (let ((_let_45 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_44 :args (tptp.lBob_THFTYPE_i QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_43)) :args _let_39)) (CONG _let_40 (CONG (REFL :args (_let_8)) _let_25 :args (=)) :args (=>)))) _let_42 :args (_let_18 false _let_27)))) (let ((_let_46 (2))) (let ((_let_47 (and _let_19 _let_18 _let_17))) (let ((_let_48 (ASSUME :args (_let_19)))) (let ((_let_49 (APPLY_UF ho_4))) (let ((_let_50 (ASSUME :args (_let_17)))) (let ((_let_51 (ASSUME :args (_let_18)))) (let ((_let_52 (TRANS (SYMM (SYMM _let_51)) (SYMM _let_50)))) (let ((_let_53 (forall ((BOUND_VARIABLE_687 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_648 $$unsorted) (BOUND_VARIABLE_646 $$unsorted)) (or (not (ho_4 (ho_3 BOUND_VARIABLE_687 tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i)) (not (ho_4 (ho_3 BOUND_VARIABLE_687 tptp.lSue_THFTYPE_i) tptp.lBob_THFTYPE_i)) (ho_4 (ho_3 BOUND_VARIABLE_687 BOUND_VARIABLE_646) BOUND_VARIABLE_648))))) (let ((_let_54 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((R (-> $$unsorted $$unsorted Bool)) (BOUND_VARIABLE_648 $$unsorted) (BOUND_VARIABLE_646 $$unsorted)) (or (not (@ (@ R tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i)) (not (@ (@ R tptp.lSue_THFTYPE_i) tptp.lBob_THFTYPE_i)) (@ (@ R BOUND_VARIABLE_646) BOUND_VARIABLE_648))) _let_53))))))) (let ((_let_55 (ho_4 _let_16 tptp.lMary_THFTYPE_i))) (let ((_let_56 (not _let_10))) (let ((_let_57 (not _let_55))) (let ((_let_58 (ho_3 k_5 tptp.lMary_THFTYPE_i))) (let ((_let_59 (and _let_57 _let_18 _let_17))) (let ((_let_60 (ASSUME :args (_let_57)))) (let ((_let_61 (= _let_22 _let_11))) (let ((_let_62 (and _let_34 _let_61))) (let ((_let_63 (_let_34 _let_61))) (let ((_let_64 (ASSUME :args (_let_34)))) (let ((_let_65 (ASSUME :args (_let_61)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_15)) :args ((or _let_14 _let_13 _let_10 (not _let_15)))) (MACRO_RESOLUTION_TRUST (RESOLUTION (CNF_AND_NEG :args (_let_62)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_64 _let_65) (SCOPE (TRUE_ELIM (TRANS (CONG (SYMM _let_65) (REFL :args (tptp.lBob_THFTYPE_i)) :args _let_49) (TRUE_INTRO _let_64))) :args _let_63)) :args _let_63)) :args (true _let_62)) (AND_ELIM _let_36 :args _let_21) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_44 :args (tptp.lSue_THFTYPE_i QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_43)) :args _let_39))) _let_42 :args (_let_61 false _let_27)) :args (_let_12 false _let_34 false _let_61)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_59)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_60 _let_50 _let_51) (SCOPE (FALSE_ELIM (TRANS (CONG _let_52 (REFL :args (tptp.lMary_THFTYPE_i)) :args _let_49) (FALSE_INTRO _let_60))) :args (_let_57 _let_17 _let_18))) :args (_let_57 _let_18 _let_17))) :args (true _let_59)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_57) _let_55))) (REFL :args ((not _let_18))) (REFL :args ((not _let_17))) (REFL :args (_let_56)) :args _let_38)) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_4)) (PREPROCESS :args ((= _let_4 (and (not (ho_4 _let_58 tptp.lSue_THFTYPE_i)) (not (ho_4 _let_58 tptp.lBill_THFTYPE_i)) _let_57))))) :args _let_46) _let_45 _let_26 :args (_let_56 true _let_55 false _let_18 false _let_17)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_54 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_252 tptp.lMary_THFTYPE_i tptp.lBob_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args (_let_53))) _let_54 :args (_let_15 false _let_53)) (MACRO_RESOLUTION_TRUST (RESOLUTION (CNF_AND_NEG :args (_let_47)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_48 _let_50 _let_51) (SCOPE (TRUE_ELIM (TRANS (CONG _let_52 (REFL :args (tptp.lBill_THFTYPE_i)) :args _let_49) (TRUE_INTRO _let_48))) :args (_let_19 _let_17 _let_18))) :args (_let_19 _let_18 _let_17))) :args (true _let_47)) (AND_ELIM _let_36 :args _let_46) _let_45 _let_26 :args (_let_9 false _let_19 false _let_18 false _let_17)) :args (false false _let_12 true _let_10 false _let_15 false _let_9)) :args (_let_7 (and (not (= tptp.lMary_THFTYPE_i tptp.lSue_THFTYPE_i)) (not (= tptp.lMary_THFTYPE_i tptp.lBill_THFTYPE_i)) (not (= tptp.lBob_THFTYPE_i tptp.lMary_THFTYPE_i))) _let_5 _let_4 (not (= tptp.lBob_THFTYPE_i tptp.lBill_THFTYPE_i)) _let_1 true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.22/0.68  )
% 0.22/0.68  % SZS output end Proof for CSR153^1
% 0.22/0.68  % cvc5---1.0.5 exiting
% 0.22/0.69  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------