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

View Problem - Process Solution

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

% Computer : n003.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:06 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : CSR127^1 : TPTP v8.1.2. Released v4.1.0.
% 0.11/0.13  % Command    : do_cvc5 %s %d
% 0.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 28 13:45:55 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  %----Proving TH0
% 0.19/0.47  %------------------------------------------------------------------------------
% 0.19/0.47  % File     : CSR127^1 : TPTP v8.1.2. Released v4.1.0.
% 0.19/0.47  % Domain   : Commonsense Reasoning
% 0.19/0.47  % Problem  : Did someone like Bill in 2009?
% 0.19/0.47  % Version  : Especial.
% 0.19/0.47  % English  : Mary likes Bill. During 2009, Sue liked everybody who was liked 
% 0.19/0.47  %            by Mary. Is it the case that during 2009 Bill was liked by 
% 0.19/0.47  %            somebody?
% 0.19/0.47  
% 0.19/0.47  % Refs     : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.19/0.47  % Source   : [Ben10]
% 0.19/0.47  % Names    : ef_9.tq_SUMO_local [Ben10]
% 0.19/0.47  
% 0.19/0.47  % Status   : Theorem
% 0.19/0.47  % 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.17 v5.5.0, 0.20 v5.4.0, 0.25 v5.3.0, 0.50 v4.1.0
% 0.19/0.47  % Syntax   : Number of formulae    :   11 (   1 unt;   8 typ;   0 def)
% 0.19/0.47  %            Number of atoms       :    6 (   0 equ;   0 cnn)
% 0.19/0.47  %            Maximal formula atoms :    3 (   2 avg)
% 0.19/0.47  %            Number of connectives :   15 (   0   ~;   0   |;   0   &;  14   @)
% 0.19/0.47  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.19/0.47  %            Maximal formula depth :    6 (   5 avg)
% 0.19/0.47  %            Number of types       :    3 (   1 usr)
% 0.19/0.47  %            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
% 0.19/0.47  %            Number of symbols     :    7 (   7 usr;   4 con; 0-2 aty)
% 0.19/0.47  %            Number of variables   :    2 (   0   ^;   1   !;   1   ?;   2   :)
% 0.19/0.47  % SPC      : TH0_THM_NEQ_NAR
% 0.19/0.47  
% 0.19/0.47  % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.19/0.47  %            Initally the problem has been hand generated in KIF syntax in
% 0.19/0.47  %            SigmaKEE and then automatically translated by Benzmueller's
% 0.19/0.47  %            KIF2TH0 translator into THF syntax.
% 0.19/0.47  %          : The translation has been applied in two modes: local and SInE.
% 0.19/0.47  %            The local mode only translates the local assumptions and the
% 0.19/0.47  %            query. The SInE mode additionally translates the SInE-extract
% 0.19/0.47  %            of the loaded knowledge base (usually SUMO).
% 0.19/0.47  %          : The examples are selected to illustrate the benefits of
% 0.19/0.47  %            higher-order reasoning in ontology reasoning.
% 0.19/0.47  %------------------------------------------------------------------------------
% 0.19/0.47  %----The extracted signature
% 0.19/0.47  thf(numbers,type,
% 0.19/0.47      num: $tType ).
% 0.19/0.47  
% 0.19/0.47  thf(holdsDuring_THFTYPE_IiooI,type,
% 0.19/0.47      holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.19/0.47  
% 0.19/0.47  thf(lBill_THFTYPE_i,type,
% 0.19/0.47      lBill_THFTYPE_i: $i ).
% 0.19/0.47  
% 0.19/0.47  thf(lMary_THFTYPE_i,type,
% 0.19/0.47      lMary_THFTYPE_i: $i ).
% 0.19/0.47  
% 0.19/0.47  thf(lSue_THFTYPE_i,type,
% 0.19/0.47      lSue_THFTYPE_i: $i ).
% 0.19/0.47  
% 0.19/0.47  thf(lYearFn_THFTYPE_IiiI,type,
% 0.19/0.47      lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.19/0.47  
% 0.19/0.47  thf(likes_THFTYPE_IiioI,type,
% 0.19/0.47      likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.19/0.47  
% 0.19/0.47  thf(n2009_THFTYPE_i,type,
% 0.19/0.47      n2009_THFTYPE_i: $i ).
% 0.19/0.47  
% 0.19/0.47  %----The translated axioms
% 0.19/0.47  thf(ax,axiom,
% 0.19/0.47      likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.19/0.47  
% 0.19/0.47  thf(ax_001,axiom,
% 0.19/0.47      ! [X: $i] :
% 0.19/0.47        ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.19/0.47        @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 0.19/0.47         => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 0.19/0.47  
% 0.19/0.47  %----The translated conjecture
% 0.19/0.47  thf(con,conjecture,
% 0.19/0.47      ? [Y: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ Y @ lBill_THFTYPE_i ) ) ).
% 0.19/0.47  
% 0.19/0.47  %------------------------------------------------------------------------------
% 0.19/0.47  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.8H0vlpUbA7/cvc5---1.0.5_31508.p...
% 0.19/0.47  (declare-sort $$unsorted 0)
% 0.19/0.47  (declare-sort tptp.num 0)
% 0.19/0.47  (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.19/0.47  (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.19/0.47  (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.19/0.47  (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.19/0.47  (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.19/0.47  (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.19/0.47  (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.19/0.47  (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.19/0.47  (assert (forall ((X $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (=> (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) X) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))
% 0.19/0.50  (assert (not (exists ((Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.likes_THFTYPE_IiioI Y) tptp.lBill_THFTYPE_i)))))
% 0.19/0.50  (set-info :filename cvc5---1.0.5_31508)
% 0.19/0.50  (check-sat-assuming ( true ))
% 0.19/0.50  ------- get file name : TPTP file name is CSR127^1
% 0.19/0.50  ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_31508.smt2...
% 0.19/0.50  --- Run --ho-elim --full-saturate-quant at 10...
% 0.19/0.50  % SZS status Theorem for CSR127^1
% 0.19/0.50  % SZS output start Proof for CSR127^1
% 0.19/0.50  (
% 0.19/0.50  (let ((_let_1 (not (exists ((Y $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.likes_THFTYPE_IiioI Y) tptp.lBill_THFTYPE_i)))))) (let ((_let_2 (forall ((X $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (=> (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) X) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))) (let ((_let_3 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_4 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)))) (let ((_let_5 (ho_9 _let_4 BOOLEAN_TERM_VARIABLE_1100))) (let ((_let_6 (ho_9 _let_4 BOOLEAN_TERM_VARIABLE_1193))) (let ((_let_7 (forall ((X $$unsorted)) (ho_9 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)) (=> (ho_4 (ho_3 k_2 tptp.lMary_THFTYPE_i) X) (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) X)))))) (let ((_let_8 (EQ_RESOLVE (ASSUME :args (_let_2)) (PREPROCESS :args ((= _let_2 _let_7)))))) (let ((_let_9 (=>))) (let ((_let_10 (APPLY_UF ho_9))) (let ((_let_11 (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_12 (ho_3 k_2 tptp.lMary_THFTYPE_i))) (let ((_let_13 (ho_4 _let_12 tptp.lBill_THFTYPE_i))) (let ((_let_14 (=> _let_13 _let_11))) (let ((_let_15 (MACRO_SR_PRED_INTRO :args ((= _let_14 BOOLEAN_TERM_VARIABLE_1100))))) (let ((_let_16 (REFL :args (_let_4)))) (let ((_let_17 (_let_7))) (let ((_let_18 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_8 :args (tptp.lBill_THFTYPE_i QUANTIFIERS_INST_E_MATCHING_SIMPLE ((ho_4 _let_12 X)))) :args _let_17) (CONG (REFL :args _let_17) (CONG _let_16 _let_15 :args _let_10) :args _let_9))) _let_8 :args (_let_5 false _let_7)))) (let ((_let_19 (ho_9 _let_4 BOOLEAN_TERM_VARIABLE_1136))) (let ((_let_20 (not BOOLEAN_TERM_VARIABLE_1100))) (let ((_let_21 (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_22 (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_23 (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_24 (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_25 (forall ((u |u_(-> Bool Bool)|) (e Bool) (i Bool)) (not (forall ((v |u_(-> Bool Bool)|)) (not (forall ((ii Bool)) (= (ho_9 v ii) (ite (= i ii) e (ho_9 u ii)))))))))) (let ((_let_26 (forall ((x |u_(-> Bool Bool)|) (y |u_(-> Bool Bool)|)) (or (not (forall ((z Bool)) (= (ho_9 x z) (ho_9 y z)))) (= x y))))) (let ((_let_27 (forall ((u |u_(-> $$unsorted $$unsorted)|) (e $$unsorted) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted)|)) (not (forall ((ii $$unsorted)) (= (ho_6 v ii) (ite (= i ii) e (ho_6 u ii)))))))))) (let ((_let_28 (forall ((x |u_(-> $$unsorted $$unsorted)|) (y |u_(-> $$unsorted $$unsorted)|)) (or (not (forall ((z $$unsorted)) (= (ho_6 x z) (ho_6 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_8 v ii) (ite (= i ii) e (ho_8 u ii)))))))))) (let ((_let_30 (forall ((x |u_(-> $$unsorted Bool Bool)|) (y |u_(-> $$unsorted Bool Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_8 x z) (ho_8 y z)))) (= x y))))) (let ((_let_31 (SYMM (MACRO_SR_PRED_INTRO :args ((= BOOLEAN_TERM_VARIABLE_1136 _let_13)))))) (let ((_let_32 (forall ((Y $$unsorted)) (not (ho_9 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)) (ho_4 (ho_3 k_2 Y) tptp.lBill_THFTYPE_i)))))) (let ((_let_33 (not _let_19))) (let ((_let_34 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((Y $$unsorted)) (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.likes_THFTYPE_IiioI Y) tptp.lBill_THFTYPE_i)))) _let_32))))))) (let ((_let_35 (not))) (let ((_let_36 (_let_32))) (let ((_let_37 (REFL :args _let_36))) (let ((_let_38 (not BOOLEAN_TERM_VARIABLE_1136))) (let ((_let_39 (not _let_5))) (let ((_let_40 (or))) (let ((_let_41 (REFL :args (_let_39)))) (let ((_let_42 (_let_20))) (let ((_let_43 (ASSUME :args (_let_33)))) (let ((_let_44 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1136)))) (let ((_let_45 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1100)))) (let ((_let_46 (ASSUME :args (_let_5)))) (let ((_let_47 (TRUE_INTRO _let_46))) (let ((_let_48 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_43 _let_44 _let_45 _let_46) :args (BOOLEAN_TERM_VARIABLE_1100 _let_5 BOOLEAN_TERM_VARIABLE_1136 _let_33)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM _let_47) (CONG _let_16 (TRANS (TRUE_INTRO _let_45) (SYMM (TRUE_INTRO _let_44))) :args _let_10) (FALSE_INTRO _let_43))) :args (_let_33 BOOLEAN_TERM_VARIABLE_1136 BOOLEAN_TERM_VARIABLE_1100 _let_5)) :args ((not (and BOOLEAN_TERM_VARIABLE_1100 _let_5 BOOLEAN_TERM_VARIABLE_1136 _let_33)) SB_LITERAL))) (CONG (REFL :args _let_42) _let_41 (REFL :args (_let_38)) (MACRO_SR_PRED_INTRO :args ((= (not _let_33) _let_19))) :args _let_40)) :args ((or _let_39 _let_20 _let_19 _let_38))) _let_18 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_34 :args (tptp.lMary_THFTYPE_i QUANTIFIERS_INST_E_MATCHING_SIMPLE ((ho_3 k_2 Y)))) :args _let_36) (CONG _let_37 (CONG (CONG _let_16 _let_31 :args _let_10) :args _let_35) :args _let_9))) _let_34 :args (_let_33 false _let_32)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 _let_31) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_3)) (PREPROCESS :args ((= _let_3 _let_13)))) (PREPROCESS :args ((and _let_30 _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23 _let_22 _let_21)))) :args ((and _let_13 _let_30 _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23 _let_22 _let_21))) :args (0)) :args (BOOLEAN_TERM_VARIABLE_1136 false _let_13)) :args (_let_20 false _let_5 true _let_19 false BOOLEAN_TERM_VARIABLE_1136)))) (let ((_let_49 (not _let_6))) (let ((_let_50 (MACRO_SR_PRED_INTRO :args ((= _let_11 BOOLEAN_TERM_VARIABLE_1193))))) (let ((_let_51 (not BOOLEAN_TERM_VARIABLE_1193))) (let ((_let_52 (not _let_14))) (let ((_let_53 (ASSUME :args _let_42))) (let ((_let_54 (ASSUME :args (_let_51)))) (let ((_let_55 (ASSUME :args (_let_49)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_46 _let_53 _let_54 _let_55) :args (_let_5 _let_20 _let_49 _let_51)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_55)) (CONG _let_16 (TRANS (FALSE_INTRO _let_54) (SYMM (FALSE_INTRO _let_53))) :args _let_10) _let_47)) :args (_let_5 _let_20 _let_51 _let_49)) :args ((not (and _let_5 _let_20 _let_49 _let_51)) SB_LITERAL))) (CONG _let_41 (MACRO_SR_PRED_INTRO :args ((= (not _let_20) BOOLEAN_TERM_VARIABLE_1100))) (MACRO_SR_PRED_INTRO :args ((= (not _let_49) _let_6))) (MACRO_SR_PRED_INTRO :args ((= (not _let_51) BOOLEAN_TERM_VARIABLE_1193))) :args _let_40)) :args ((or BOOLEAN_TERM_VARIABLE_1100 _let_39 BOOLEAN_TERM_VARIABLE_1193 _let_6))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_50) (MACRO_RESOLUTION_TRUST (CNF_IMPLIES_NEG2 :args (_let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 _let_15) :args ((or BOOLEAN_TERM_VARIABLE_1100 _let_52))) _let_48 :args (_let_52 true BOOLEAN_TERM_VARIABLE_1100)) :args ((not _let_11) true _let_14)) :args (_let_51 true _let_11)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_34 :args (tptp.lSue_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_36) (CONG _let_37 (CONG (CONG _let_16 _let_50 :args _let_10) :args _let_35) :args _let_9))) _let_34 :args (_let_49 false _let_32)) _let_48 _let_18 :args (false true BOOLEAN_TERM_VARIABLE_1193 true _let_6 true BOOLEAN_TERM_VARIABLE_1100 false _let_5)) :args (_let_3 _let_2 _let_1 true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.19/0.51  )
% 0.19/0.51  % SZS output end Proof for CSR127^1
% 0.19/0.51  % cvc5---1.0.5 exiting
% 0.19/0.51  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------