TSTP Solution File: CSR032+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n027.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:04:40 EDT 2023
% Result : Theorem 0.20s 0.57s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 11:33:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.57 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.I6sGe1VXcH/cvc5---1.0.5_18624.p...
% 0.20/0.57 ------- get file name : TPTP file name is CSR032+1
% 0.20/0.57 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_18624.smt2...
% 0.20/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.57 % SZS status Theorem for CSR032+1
% 0.20/0.57 % SZS output start Proof for CSR032+1
% 0.20/0.57 (
% 0.20/0.57 (let ((_let_1 (not (exists ((COL $$unsorted)) (=> (tptp.mtvisible tptp.c_reasoningaboutpossibleantecedentsmt) (tptp.isa (tptp.f_citynamedfn tptp.s_agen tptp.c_france) COL)))))) (let ((_let_2 (forall ((X $$unsorted)) (=> (tptp.individual X) (tptp.isa X tptp.c_individual))))) (let ((_let_3 (tptp.f_citynamedfn tptp.s_agen tptp.c_france))) (let ((_let_4 (tptp.individual _let_3))) (let ((_let_5 (forall ((BOUND_VARIABLE_1300 $$unsorted)) (not (tptp.isa (tptp.f_citynamedfn tptp.s_agen tptp.c_france) BOUND_VARIABLE_1300))))) (let ((_let_6 (tptp.isa _let_3 tptp.c_individual))) (let ((_let_7 (not _let_4))) (let ((_let_8 (or _let_7 _let_6))) (let ((_let_9 (forall ((X $$unsorted)) (or (not (tptp.individual X)) (tptp.isa X tptp.c_individual))))) (let ((_let_10 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_11 (_let_5))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_11) :args (tptp.c_individual QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.isa _let_3 BOUND_VARIABLE_1300) false))))) :args _let_11)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_8)) :args ((or _let_7 _let_6 (not _let_8)))) (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_10 :args (_let_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.individual X) false))))) :args (_let_9))) _let_10 :args (_let_8 false _let_9)) :args (_let_6 false _let_4 false _let_8)) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (1)) :args (false false _let_6 false _let_5)) :args (_let_4 (tptp.genls tptp.c_trajector_underspecified tptp.c_location_underspecified) (forall ((OBJ $$unsorted)) (=> (tptp.trajector_underspecified OBJ) (tptp.location_underspecified OBJ))) (tptp.genls tptp.c_location_underspecified tptp.c_thing) (forall ((OBJ $$unsorted)) (=> (tptp.location_underspecified OBJ) (tptp.thing OBJ))) (tptp.genlmt tptp.c_humansociallifemt tptp.c_basekb) (tptp.transitivebinarypredicate tptp.c_genlmt) (tptp.genlmt tptp.c_reasoningaboutpossibleantecedentsmt tptp.c_humansociallifemt) (tptp.genls tptp.c_individual tptp.c_trajector_underspecified) (forall ((OBJ $$unsorted)) (=> (tptp.individual OBJ) (tptp.trajector_underspecified OBJ))) (tptp.genlmt tptp.c_basekb tptp.c_universalvocabularymt) (forall ((OBJ $$unsorted) (COL1 $$unsorted) (COL2 $$unsorted)) (not (and (tptp.isa OBJ COL1) (tptp.isa OBJ COL2) (tptp.disjointwith COL1 COL2)))) (forall ((SPECPRED $$unsorted) (PRED $$unsorted) (GENLPRED $$unsorted)) (=> (and (tptp.genlinverse SPECPRED PRED) (tptp.genlinverse PRED GENLPRED)) (tptp.genlpreds SPECPRED GENLPRED))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genlpreds ARG1 INS) (tptp.predicate INS))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genlpreds ARG1 INS) (tptp.predicate INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genlpreds INS ARG2) (tptp.predicate INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genlpreds INS ARG2) (tptp.predicate INS))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.genlpreds X Y) (tptp.genlpreds Y Z)) (tptp.genlpreds X Z))) (forall ((X $$unsorted)) (=> (tptp.predicate X) (tptp.genlpreds X X))) (forall ((X $$unsorted)) (=> (tptp.predicate X) (tptp.genlpreds X X))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genlinverse ARG1 INS) (tptp.binarypredicate INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genlinverse INS ARG2) (tptp.binarypredicate INS))) (forall ((OLD $$unsorted) (ARG2 $$unsorted) (NEW $$unsorted)) (=> (and (tptp.genlinverse OLD ARG2) (tptp.genlpreds NEW OLD)) (tptp.genlinverse NEW ARG2))) (forall ((ARG1 $$unsorted) (OLD $$unsorted) (NEW $$unsorted)) (=> (and (tptp.genlinverse ARG1 OLD) (tptp.genlpreds OLD NEW)) (tptp.genlinverse ARG1 NEW))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.disjointwith ARG1 INS) (tptp.collection INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.disjointwith INS ARG2) (tptp.collection INS))) (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.disjointwith X Y) (tptp.disjointwith Y X))) (forall ((ARG1 $$unsorted) (OLD $$unsorted) (NEW $$unsorted)) (=> (and (tptp.disjointwith ARG1 OLD) (tptp.genls NEW OLD)) (tptp.disjointwith ARG1 NEW))) (forall ((OLD $$unsorted) (ARG2 $$unsorted) (NEW $$unsorted)) (=> (and (tptp.disjointwith OLD ARG2) (tptp.genls NEW OLD)) (tptp.disjointwith NEW ARG2))) (forall ((X $$unsorted)) (=> (tptp.isa X tptp.c_transitivebinarypredicate) (tptp.transitivebinarypredicate X))) (forall ((X $$unsorted)) (=> (tptp.transitivebinarypredicate X) (tptp.isa X tptp.c_transitivebinarypredicate))) (tptp.mtvisible tptp.c_basekb) (forall ((SPECMT $$unsorted) (GENLMT $$unsorted)) (=> (and (tptp.mtvisible SPECMT) (tptp.genlmt SPECMT GENLMT)) (tptp.mtvisible GENLMT))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genlmt ARG1 INS) (tptp.microtheory INS))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genlmt ARG1 INS) (tptp.microtheory INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genlmt INS ARG2) (tptp.microtheory INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genlmt INS ARG2) (tptp.microtheory INS))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.genlmt X Y) (tptp.genlmt Y Z)) (tptp.genlmt X Z))) (forall ((X $$unsorted)) (=> (tptp.microtheory X) (tptp.genlmt X X))) (forall ((X $$unsorted)) (=> (tptp.microtheory X) (tptp.genlmt X X))) (forall ((X $$unsorted)) (=> (tptp.isa X tptp.c_thing) (tptp.thing X))) (forall ((X $$unsorted)) (=> (tptp.thing X) (tptp.isa X tptp.c_thing))) (forall ((X $$unsorted)) (=> (tptp.isa X tptp.c_location_underspecified) (tptp.location_underspecified X))) (forall ((X $$unsorted)) (=> (tptp.location_underspecified X) (tptp.isa X tptp.c_location_underspecified))) (forall ((X $$unsorted)) (=> (tptp.isa X tptp.c_trajector_underspecified) (tptp.trajector_underspecified X))) (forall ((X $$unsorted)) (=> (tptp.trajector_underspecified X) (tptp.isa X tptp.c_trajector_underspecified))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genls ARG1 INS) (tptp.collection INS))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.genls ARG1 INS) (tptp.collection INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genls INS ARG2) (tptp.collection INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.genls INS ARG2) (tptp.collection INS))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.genls X Y) (tptp.genls Y Z)) (tptp.genls X Z))) (forall ((X $$unsorted)) (=> (tptp.collection X) (tptp.genls X X))) (forall ((X $$unsorted)) (=> (tptp.collection X) (tptp.genls X X))) (forall ((OLD $$unsorted) (ARG2 $$unsorted) (NEW $$unsorted)) (=> (and (tptp.genls OLD ARG2) (tptp.genls NEW OLD)) (tptp.genls NEW ARG2))) (forall ((ARG1 $$unsorted) (OLD $$unsorted) (NEW $$unsorted)) (=> (and (tptp.genls ARG1 OLD) (tptp.genls OLD NEW)) (tptp.genls ARG1 NEW))) (forall ((X $$unsorted)) (=> (tptp.isa X tptp.c_individual) (tptp.individual X))) _let_2 (forall ((ARG1 $$unsorted) (ARG2 $$unsorted)) (tptp.natfunction (tptp.f_citynamedfn ARG1 ARG2) tptp.c_citynamedfn)) (forall ((ARG1 $$unsorted) (ARG2 $$unsorted)) (tptp.natargument (tptp.f_citynamedfn ARG1 ARG2) tptp.n_1 ARG1)) (forall ((ARG1 $$unsorted) (ARG2 $$unsorted)) (tptp.natargument (tptp.f_citynamedfn ARG1 ARG2) tptp.n_2 ARG2)) (forall ((ARG1 $$unsorted) (ARG2 $$unsorted)) (tptp.city (tptp.f_citynamedfn ARG1 ARG2))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.isa ARG1 INS) (tptp.collection INS))) (forall ((ARG1 $$unsorted) (INS $$unsorted)) (=> (tptp.isa ARG1 INS) (tptp.collection INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.isa INS ARG2) (tptp.thing INS))) (forall ((INS $$unsorted) (ARG2 $$unsorted)) (=> (tptp.isa INS ARG2) (tptp.thing INS))) (forall ((ARG1 $$unsorted) (OLD $$unsorted) (NEW $$unsorted)) (=> (and (tptp.isa ARG1 OLD) (tptp.genls OLD NEW)) (tptp.isa ARG1 NEW))) (tptp.mtvisible tptp.c_universalvocabularymt) _let_1 true))))))))))))))
% 0.20/0.57 )
% 0.20/0.57 % SZS output end Proof for CSR032+1
% 0.20/0.57 % cvc5---1.0.5 exiting
% 0.20/0.58 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------