TSTP Solution File: CSR142^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR142^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n001.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:14 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR142^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.15 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n001.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 13:50:05 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 %----Proving TH0
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 % File : CSR142^1 : TPTP v8.1.2. Released v4.1.0.
% 0.21/0.51 % Domain : Commonsense Reasoning
% 0.21/0.51 % Problem : Who is the husband of Corina?
% 0.21/0.51 % Version : Especial.
% 0.21/0.51 % English : Corina is the wife of Chris. Who is the husband of Corina?
% 0.21/0.51
% 0.21/0.51 % Refs : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.21/0.51 % Source : [Ben10]
% 0.21/0.51 % Names : ex_1.tq_SUMO_handselected [Ben10]
% 0.21/0.51
% 0.21/0.51 % Status : Theorem
% 0.21/0.51 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v6.1.0, 0.50 v6.0.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v5.1.0, 0.25 v5.0.0, 0.00 v4.1.0
% 0.21/0.51 % Syntax : Number of formulae : 10 ( 3 unt; 6 typ; 0 def)
% 0.21/0.51 % Number of atoms : 6 ( 0 equ; 0 cnn)
% 0.21/0.51 % Maximal formula atoms : 3 ( 1 avg)
% 0.21/0.51 % Number of connectives : 14 ( 0 ~; 0 |; 0 &; 12 @)
% 0.21/0.51 % ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% 0.21/0.51 % Maximal formula depth : 9 ( 5 avg)
% 0.21/0.51 % Number of types : 3 ( 1 usr)
% 0.21/0.51 % Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% 0.21/0.51 % Number of symbols : 5 ( 5 usr; 2 con; 0-2 aty)
% 0.21/0.51 % Number of variables : 5 ( 0 ^; 4 !; 1 ?; 5 :)
% 0.21/0.51 % SPC : TH0_THM_NEQ_NAR
% 0.21/0.51
% 0.21/0.51 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.21/0.51 % Initally the problem has been hand generated in KIF syntax in
% 0.21/0.51 % SigmaKEE and then automatically translated by Benzmueller's
% 0.21/0.51 % KIF2TH0 translator into THF syntax.
% 0.21/0.51 % : The translation has been applied in three modes: handselected,
% 0.21/0.51 % SInE, and local. The local mode only translates the local
% 0.21/0.51 % assumptions and the query. The SInE mode additionally translates
% 0.21/0.51 % the SInE extract of the loaded knowledge base (usually SUMO). The
% 0.21/0.51 % handselected mode contains a hand-selected relevant axioms.
% 0.21/0.51 % : The examples are selected to illustrate the benefits of
% 0.21/0.51 % higher-order reasoning in ontology reasoning.
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 %----The extracted signature
% 0.21/0.51 thf(numbers,type,
% 0.21/0.51 num: $tType ).
% 0.21/0.51
% 0.21/0.51 thf(husband_THFTYPE_IiioI,type,
% 0.21/0.51 husband_THFTYPE_IiioI: $i > $i > $o ).
% 0.21/0.51
% 0.21/0.51 thf(lChris_THFTYPE_i,type,
% 0.21/0.51 lChris_THFTYPE_i: $i ).
% 0.21/0.51
% 0.21/0.51 thf(lCorina_THFTYPE_i,type,
% 0.21/0.51 lCorina_THFTYPE_i: $i ).
% 0.21/0.51
% 0.21/0.51 thf(wife_THFTYPE_IiioI,type,
% 0.21/0.51 wife_THFTYPE_IiioI: $i > $i > $o ).
% 0.21/0.51
% 0.21/0.51 %----The handselected axioms from the knowledge base
% 0.21/0.51 thf(inverse_THFTYPE_IIiioIIiioIoI,type,
% 0.21/0.51 inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
% 0.21/0.51
% 0.21/0.51 thf(ax,axiom,
% 0.21/0.51 inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI ).
% 0.21/0.51
% 0.21/0.51 thf(ax_001,axiom,
% 0.21/0.51 ! [REL2: $i > $i > $o,REL1: $i > $i > $o] :
% 0.21/0.51 ( ( inverse_THFTYPE_IIiioIIiioIoI @ REL1 @ REL2 )
% 0.21/0.51 => ! [INST1: $i,INST2: $i] :
% 0.21/0.51 ( ( REL1 @ INST1 @ INST2 )
% 0.21/0.51 <=> ( REL2 @ INST2 @ INST1 ) ) ) ).
% 0.21/0.51
% 0.21/0.51 %----The translated axioms
% 0.21/0.51 thf(ax_002,axiom,
% 0.21/0.51 wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ).
% 0.21/0.51
% 0.21/0.51 %----The translated conjectures
% 0.21/0.51 thf(con,conjecture,
% 0.21/0.51 ? [X: $i] : ( husband_THFTYPE_IiioI @ X @ lCorina_THFTYPE_i ) ).
% 0.21/0.51
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.XuUSbDsJmI/cvc5---1.0.5_31237.p...
% 0.21/0.51 (declare-sort $$unsorted 0)
% 0.21/0.51 (declare-sort tptp.num 0)
% 0.21/0.51 (declare-fun tptp.husband_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.21/0.51 (declare-fun tptp.lChris_THFTYPE_i () $$unsorted)
% 0.21/0.51 (declare-fun tptp.lCorina_THFTYPE_i () $$unsorted)
% 0.21/0.51 (declare-fun tptp.wife_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.21/0.51 (declare-fun tptp.inverse_THFTYPE_IIiioIIiioIoI ((-> $$unsorted $$unsorted Bool) (-> $$unsorted $$unsorted Bool)) Bool)
% 0.21/0.51 (assert (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI tptp.husband_THFTYPE_IiioI) tptp.wife_THFTYPE_IiioI))
% 0.21/0.51 (assert (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool))) (=> (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2) (forall ((INST1 $$unsorted) (INST2 $$unsorted)) (= (@ (@ REL1 INST1) INST2) (@ (@ REL2 INST2) INST1))))))
% 0.21/0.53 (assert (@ (@ tptp.wife_THFTYPE_IiioI tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i))
% 0.21/0.53 (assert (not (exists ((X $$unsorted)) (@ (@ tptp.husband_THFTYPE_IiioI X) tptp.lCorina_THFTYPE_i))))
% 0.21/0.53 (set-info :filename cvc5---1.0.5_31237)
% 0.21/0.53 (check-sat-assuming ( true ))
% 0.21/0.53 ------- get file name : TPTP file name is CSR142^1
% 0.21/0.53 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_31237.smt2...
% 0.21/0.53 --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.53 % SZS status Theorem for CSR142^1
% 0.21/0.53 % SZS output start Proof for CSR142^1
% 0.21/0.53 (
% 0.21/0.53 (let ((_let_1 (not (exists ((X $$unsorted)) (@ (@ tptp.husband_THFTYPE_IiioI X) tptp.lCorina_THFTYPE_i))))) (let ((_let_2 (@ (@ tptp.wife_THFTYPE_IiioI tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i))) (let ((_let_3 (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool))) (=> (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2) (forall ((INST1 $$unsorted) (INST2 $$unsorted)) (= (@ (@ REL1 INST1) INST2) (@ (@ REL2 INST2) INST1))))))) (let ((_let_4 (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI tptp.husband_THFTYPE_IiioI) tptp.wife_THFTYPE_IiioI))) (let ((_let_5 (forall ((X $$unsorted)) (not (ho_8 (ho_3 k_4 X) tptp.lCorina_THFTYPE_i))))) (let ((_let_6 (ho_8 (ho_3 k_4 tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i))) (let ((_let_7 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((X $$unsorted)) (not (@ (@ tptp.husband_THFTYPE_IiioI X) tptp.lCorina_THFTYPE_i))) _let_5))))))) (let ((_let_8 (ho_8 (ho_3 k_2 tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i))) (let ((_let_9 (= _let_8 _let_6))) (let ((_let_10 (ho_7 (ho_6 k_5 k_4) k_2))) (let ((_let_11 (not _let_10))) (let ((_let_12 (or _let_11 _let_9))) (let ((_let_13 (forall ((BOUND_VARIABLE_647 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_652 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_614 $$unsorted) (BOUND_VARIABLE_612 $$unsorted)) (or (not (ho_7 (ho_6 k_5 BOUND_VARIABLE_652) BOUND_VARIABLE_647)) (= (ho_8 (ho_3 BOUND_VARIABLE_647 BOUND_VARIABLE_614) BOUND_VARIABLE_612) (ho_8 (ho_3 BOUND_VARIABLE_652 BOUND_VARIABLE_612) BOUND_VARIABLE_614)))))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_3)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool)) (BOUND_VARIABLE_614 $$unsorted) (BOUND_VARIABLE_612 $$unsorted)) (or (not (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2)) (= (@ (@ REL1 BOUND_VARIABLE_612) BOUND_VARIABLE_614) (@ (@ REL2 BOUND_VARIABLE_614) BOUND_VARIABLE_612)))) _let_13))))))) (let ((_let_15 (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_16 (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_17 (forall ((u |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (e Bool) (i |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((v |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (not (forall ((ii |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_7 v ii) (ite (= i ii) e (ho_7 u ii)))))))))) (let ((_let_18 (forall ((x |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (y |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (or (not (forall ((z |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_7 x z) (ho_7 y z)))) (= x y))))) (let ((_let_19 (forall ((u |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (e |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (i |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((v |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (not (forall ((ii |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_6 v ii) (ite (= i ii) e (ho_6 u ii)))))))))) (let ((_let_20 (forall ((x |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (y |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (or (not (forall ((z |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_6 x z) (ho_6 y z)))) (= x y))))) (let ((_let_21 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_8 v ii) (ite (= i ii) e (ho_8 u ii)))))))))) (let ((_let_22 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_8 x z) (ho_8 y z)))) (= x y))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_7 :args (tptp.lChris_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args (_let_5))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_9)) :args ((or (not _let_8) _let_6 (not _let_9)))) (EQ_RESOLVE (ASSUME :args (_let_2)) (PREPROCESS :args ((= _let_2 _let_8)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_12)) :args ((or _let_11 _let_9 (not _let_12)))) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_4)) (PREPROCESS :args ((= _let_4 _let_10)))) (PREPROCESS :args ((and _let_22 _let_21 _let_20 _let_19 _let_18 _let_17 _let_16 _let_15)))) :args ((and _let_10 _let_22 _let_21 _let_20 _let_19 _let_18 _let_17 _let_16 _let_15))) :args (0)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args (k_2 k_4 tptp.lCorina_THFTYPE_i tptp.lChris_THFTYPE_i QUANTIFIERS_INST_E_MATCHING ((not (= (ho_7 (ho_6 k_5 BOUND_VARIABLE_652) BOUND_VARIABLE_647) false)) (ho_8 (ho_3 BOUND_VARIABLE_647 BOUND_VARIABLE_614) BOUND_VARIABLE_612)))) :args (_let_13))) _let_14 :args (_let_12 false _let_13)) :args (_let_9 false _let_10 false _let_12)) :args (_let_6 false _let_8 false _let_9)) _let_7 :args (false false _let_6 false _let_5)) :args (_let_4 _let_3 _let_2 _let_1 true)))))))))))))))))))))))))
% 0.21/0.54 )
% 0.21/0.54 % SZS output end Proof for CSR142^1
% 0.21/0.54 % cvc5---1.0.5 exiting
% 0.21/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------