TSTP Solution File: CAT016-3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CAT016-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n011.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 18:14:36 EDT 2023
% Result : Unsatisfiable 0.15s 0.62s
% Output : Proof 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.19 % Problem : CAT016-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.20 % Command : do_cvc5 %s %d
% 0.10/0.40 % Computer : n011.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8042.1875MB
% 0.10/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Sun Aug 27 00:27:24 EDT 2023
% 0.10/0.42 % CPUTime :
% 0.15/0.57 %----Proving TF0_NAR, FOF, or CNF
% 0.15/0.58 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.qzR54N8JkV/cvc5---1.0.5_13604.p...
% 0.15/0.59 ------- get file name : TPTP file name is CAT016-3
% 0.15/0.59 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_13604.smt2...
% 0.15/0.59 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.15/0.62 % SZS status Unsatisfiable for CAT016-3
% 0.15/0.62 % SZS output start Proof for CAT016-3
% 0.15/0.62 (
% 0.15/0.62 (let ((_let_1 (tptp.domain tptp.a))) (let ((_let_2 (tptp.there_exists _let_1))) (let ((_let_3 (not _let_2))) (let ((_let_4 (tptp.there_exists tptp.a))) (let ((_let_5 (forall ((X $$unsorted)) (= (tptp.compose X (tptp.domain X)) X)))) (let ((_let_6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.there_exists (tptp.compose X Y))) (tptp.there_exists (tptp.domain X)))))) (let ((_let_7 (tptp.compose tptp.a _let_1))) (let ((_let_8 (tptp.there_exists _let_7))) (let ((_let_9 (not _let_8))) (let ((_let_10 (or _let_9 _let_2))) (let ((_let_11 (_let_6))) (let ((_let_12 (ASSUME :args _let_11))) (let ((_let_13 (not _let_10))) (let ((_let_14 (= tptp.a _let_7))) (let ((_let_15 (forall ((X $$unsorted)) (= X (tptp.compose X (tptp.domain X)))))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_17 (ASSUME :args (_let_4)))) (let ((_let_18 (and _let_4 _let_14))) (let ((_let_19 (_let_4 _let_14))) (let ((_let_20 (ASSUME :args (_let_14)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (tptp.a _let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.compose X Y)))) :args _let_11)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_10)) :args ((or _let_2 _let_9 _let_13))) (ASSUME :args (_let_3)) (MACRO_RESOLUTION_TRUST (RESOLUTION (CNF_AND_NEG :args (_let_18)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_17 _let_20) (SCOPE (TRUE_ELIM (TRANS (CONG (SYMM _let_20) :args (APPLY_UF tptp.there_exists)) (TRUE_INTRO _let_17))) :args _let_19)) :args _let_19)) :args (true _let_18)) _let_17 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_16 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.domain X)))) :args (_let_15))) _let_16 :args (_let_14 false _let_15)) :args (_let_8 false _let_4 false _let_14)) :args (_let_13 true _let_2 false _let_8)) _let_12 :args (false true _let_10 false _let_6)) :args ((forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equivalent X Y)) (tptp.there_exists X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equivalent X Y)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.there_exists X)) (not (= X Y)) (tptp.equivalent X Y))) (forall ((X $$unsorted)) (or (not (tptp.there_exists (tptp.domain X))) (tptp.there_exists X))) (forall ((X $$unsorted)) (or (not (tptp.there_exists (tptp.codomain X))) (tptp.there_exists X))) _let_6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.there_exists (tptp.compose X Y))) (= (tptp.domain X) (tptp.codomain Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.domain X))) (or (not (tptp.there_exists _let_1)) (not (= _let_1 (tptp.codomain Y))) (tptp.there_exists (tptp.compose X Y))))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.compose X (tptp.compose Y Z)) (tptp.compose (tptp.compose X Y) Z))) _let_5 (forall ((X $$unsorted)) (= (tptp.compose (tptp.codomain X) X) X)) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equivalent X Y)) (tptp.there_exists Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.there_exists X)) (not (tptp.there_exists Y)) (not (= X Y)) (tptp.equivalent X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.there_exists (tptp.compose X Y))) (tptp.there_exists (tptp.codomain X)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.there_exists (tptp.f1 X Y)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.f1 X Y))) (or (= X _let_1) (= Y _let_1) (= X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.f1 X Y))) (or (not (= X _let_1)) (not (= Y _let_1)) (= X Y)))) _let_4 _let_3)))))))))))))))))))))))
% 0.15/0.62 )
% 0.15/0.62 % SZS output end Proof for CAT016-3
% 0.15/0.62 % cvc5---1.0.5 exiting
% 0.15/0.63 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------