TSTP Solution File: CSR125^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR125^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n026.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:05 EDT 2023
% Result : Theorem 0.21s 0.52s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR125^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n026.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 08:34:34 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 %----Proving TH0
% 0.21/0.49 %------------------------------------------------------------------------------
% 0.21/0.49 % File : CSR125^1 : TPTP v8.1.2. Released v4.1.0.
% 0.21/0.49 % Domain : Commonsense Reasoning
% 0.21/0.49 % Problem : Sue contradicts her likes
% 0.21/0.49 % Version : Especial.
% 0.21/0.49 % English : Mary likes Bill and Sue likes Bill. During 2009 Sue didn't like
% 0.21/0.49 % anybody. During year 2009 we get a contradiction.
% 0.21/0.49
% 0.21/0.49 % Refs : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.21/0.49 % Source : [Ben10]
% 0.21/0.49 % Names : ef_7.tq_SUMO_local [Ben10]
% 0.21/0.49
% 0.21/0.49 % Status : Theorem
% 0.21/0.49 % 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.3.0, 0.25 v5.2.0, 0.50 v4.1.0
% 0.21/0.49 % Syntax : Number of formulae : 12 ( 2 unt; 8 typ; 0 def)
% 0.21/0.49 % Number of atoms : 7 ( 0 equ; 1 cnn)
% 0.21/0.49 % Maximal formula atoms : 3 ( 1 avg)
% 0.21/0.49 % Number of connectives : 14 ( 1 ~; 0 |; 0 &; 13 @)
% 0.21/0.49 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.21/0.49 % Maximal formula depth : 6 ( 4 avg)
% 0.21/0.49 % Number of types : 3 ( 1 usr)
% 0.21/0.49 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.21/0.49 % Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% 0.21/0.49 % Number of variables : 1 ( 0 ^; 1 !; 0 ?; 1 :)
% 0.21/0.49 % SPC : TH0_THM_NEQ_NAR
% 0.21/0.49
% 0.21/0.49 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.21/0.49 % Initally the problem has been hand generated in KIF syntax in
% 0.21/0.49 % SigmaKEE and then automatically translated by Benzmueller's
% 0.21/0.49 % KIF2TH0 translator into THF syntax.
% 0.21/0.49 % : The translation has been applied in two modes: local and SInE.
% 0.21/0.49 % The local mode only translates the local assumptions and the
% 0.21/0.49 % query. The SInE mode additionally translates the SInE-extract
% 0.21/0.49 % of the loaded knowledge base (usually SUMO).
% 0.21/0.49 % : The examples are selected to illustrate the benefits of
% 0.21/0.49 % higher-order reasoning in ontology reasoning.
% 0.21/0.49 %------------------------------------------------------------------------------
% 0.21/0.49 %----The extracted signature
% 0.21/0.49 thf(numbers,type,
% 0.21/0.49 num: $tType ).
% 0.21/0.49
% 0.21/0.49 thf(holdsDuring_THFTYPE_IiooI,type,
% 0.21/0.49 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.21/0.49
% 0.21/0.49 thf(lBill_THFTYPE_i,type,
% 0.21/0.49 lBill_THFTYPE_i: $i ).
% 0.21/0.49
% 0.21/0.49 thf(lMary_THFTYPE_i,type,
% 0.21/0.49 lMary_THFTYPE_i: $i ).
% 0.21/0.49
% 0.21/0.49 thf(lSue_THFTYPE_i,type,
% 0.21/0.49 lSue_THFTYPE_i: $i ).
% 0.21/0.49
% 0.21/0.49 thf(lYearFn_THFTYPE_IiiI,type,
% 0.21/0.49 lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.21/0.49
% 0.21/0.49 thf(likes_THFTYPE_IiioI,type,
% 0.21/0.49 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.21/0.49
% 0.21/0.49 thf(n2009_THFTYPE_i,type,
% 0.21/0.49 n2009_THFTYPE_i: $i ).
% 0.21/0.49
% 0.21/0.49 %----The translated axioms
% 0.21/0.49 thf(ax,axiom,
% 0.21/0.49 likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.21/0.49
% 0.21/0.49 thf(ax_001,axiom,
% 0.21/0.49 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.21/0.49
% 0.21/0.49 thf(ax_002,axiom,
% 0.21/0.49 ! [X: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( (~) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 0.21/0.49
% 0.21/0.49 %----The translated conjecture
% 0.21/0.49 thf(con,conjecture,
% 0.21/0.49 holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ).
% 0.21/0.49
% 0.21/0.49 %------------------------------------------------------------------------------
% 0.21/0.49 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.vfMCwkGHKg/cvc5---1.0.5_24391.p...
% 0.21/0.49 (declare-sort $$unsorted 0)
% 0.21/0.49 (declare-sort tptp.num 0)
% 0.21/0.49 (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.21/0.49 (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.21/0.49 (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.21/0.49 (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.21/0.49 (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.21/0.49 (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.21/0.49 (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.21/0.49 (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.21/0.49 (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.21/0.49 (assert (forall ((X $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (not (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))
% 0.21/0.52 (assert (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) false)))
% 0.21/0.52 (set-info :filename cvc5---1.0.5_24391)
% 0.21/0.52 (check-sat-assuming ( true ))
% 0.21/0.52 ------- get file name : TPTP file name is CSR125^1
% 0.21/0.52 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24391.smt2...
% 0.21/0.52 --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.52 % SZS status Theorem for CSR125^1
% 0.21/0.52 % SZS output start Proof for CSR125^1
% 0.21/0.52 (
% 0.21/0.52 (let ((_let_1 (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) false)))) (let ((_let_2 (forall ((X $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (not (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) X)))))) (let ((_let_3 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_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_840))) (let ((_let_6 (ho_9 _let_4 BOOLEAN_TERM_VARIABLE_1079))) (let ((_let_7 (APPLY_UF ho_9))) (let ((_let_8 (MACRO_SR_PRED_INTRO :args ((= false BOOLEAN_TERM_VARIABLE_840))))) (let ((_let_9 (REFL :args (_let_4)))) (let ((_let_10 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (PREPROCESS :args ((= _let_1 (not (ho_9 _let_4 false))))) (CONG (CONG _let_9 _let_8 :args _let_7) :args (not)))))) (let ((_let_11 ((= BOOLEAN_TERM_VARIABLE_840 false)))) (let ((_let_12 (EQ_RESOLVE (MACRO_SR_PRED_INTRO :args _let_11) (REWRITE :args _let_11)))) (let ((_let_13 (forall ((X $$unsorted)) (ho_9 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)) (not (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) X)))))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_2)) (PREPROCESS :args ((= _let_2 _let_13)))))) (let ((_let_15 (ho_3 k_2 tptp.lSue_THFTYPE_i))) (let ((_let_16 (ho_4 _let_15 tptp.lBill_THFTYPE_i))) (let ((_let_17 (MACRO_SR_PRED_INTRO :args ((= (not _let_16) BOOLEAN_TERM_VARIABLE_1079))))) (let ((_let_18 (_let_13))) (let ((_let_19 (not BOOLEAN_TERM_VARIABLE_1079))) (let ((_let_20 (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_21 (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_22 (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_23 (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_24 (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_25 (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_26 (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_27 (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_28 (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_29 (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_30 (not _let_6))) (let ((_let_31 (not BOOLEAN_TERM_VARIABLE_840))) (let ((_let_32 (not _let_5))) (let ((_let_33 (ASSUME :args (_let_19)))) (let ((_let_34 (ASSUME :args (_let_6)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_10 _let_12 _let_33 _let_34) :args (_let_32 _let_31 _let_6 _let_19)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO _let_34)) (CONG _let_9 (TRANS (FALSE_INTRO _let_33) _let_8) :args _let_7) (FALSE_INTRO _let_10))) :args (_let_32 _let_31 _let_19 _let_6)) :args ((not (and _let_32 _let_31 _let_6 _let_19)) SB_LITERAL))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_32) _let_5))) (MACRO_SR_PRED_INTRO :args ((= (not _let_31) BOOLEAN_TERM_VARIABLE_840))) (REFL :args (_let_30)) (MACRO_SR_PRED_INTRO :args ((= (not _let_19) BOOLEAN_TERM_VARIABLE_1079))) :args (or))) :args ((or BOOLEAN_TERM_VARIABLE_840 _let_5 BOOLEAN_TERM_VARIABLE_1079 _let_30))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_17) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_3)) (PREPROCESS :args ((= _let_3 _let_16)))) (PREPROCESS :args ((and _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23 _let_22 _let_21 _let_20)))) :args ((and _let_16 _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23 _let_22 _let_21 _let_20))) :args (0)) :args (_let_19 false _let_16)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_14 :args (tptp.lBill_THFTYPE_i QUANTIFIERS_INST_E_MATCHING_SIMPLE ((ho_4 _let_15 X)))) :args _let_18) (CONG (REFL :args _let_18) (CONG _let_9 _let_17 :args _let_7) :args (=>)))) _let_14 :args (_let_6 false _let_13)) _let_12 _let_10 :args (false true BOOLEAN_TERM_VARIABLE_1079 false _let_6 true BOOLEAN_TERM_VARIABLE_840 true _let_5)) :args (_let_3 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) _let_2 _let_1 true)))))))))))))))))))))))))))))))))))))
% 0.21/0.52 )
% 0.21/0.52 % SZS output end Proof for CSR125^1
% 0.21/0.52 % cvc5---1.0.5 exiting
% 0.21/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------