TSTP Solution File: GRP141-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP141-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n008.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 : Thu Aug 31 00:24:47 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP141-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 00:09:32 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.veAlMiHFpC/cvc5---1.0.5_19410.p...
% 0.21/0.51 ------- get file name : TPTP file name is GRP141-1
% 0.21/0.51 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_19410.smt2...
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.54 % SZS status Unsatisfiable for GRP141-1
% 0.21/0.54 % SZS output start Proof for GRP141-1
% 0.21/0.55 (
% 0.21/0.55 (let ((_let_1 (tptp.greatest_lower_bound tptp.a tptp.b))) (let ((_let_2 (tptp.greatest_lower_bound _let_1 tptp.c))) (let ((_let_3 (not (= _let_2 tptp.c)))) (let ((_let_4 (tptp.least_upper_bound tptp.b tptp.c))) (let ((_let_5 (= _let_4 tptp.b))) (let ((_let_6 (tptp.least_upper_bound tptp.a tptp.c))) (let ((_let_7 (= _let_6 tptp.a))) (let ((_let_8 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)) X)))) (let ((_let_9 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.greatest_lower_bound Y Z)) (tptp.greatest_lower_bound (tptp.greatest_lower_bound X Y) Z))))) (let ((_let_10 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))))) (let ((_let_11 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X Y) (tptp.greatest_lower_bound Y X))))) (let ((_let_12 (= tptp.a _let_6))) (let ((_let_13 (= tptp.b _let_4))) (let ((_let_14 (= tptp.c _let_2))) (let ((_let_15 (tptp.greatest_lower_bound tptp.c _let_1))) (let ((_let_16 (= _let_2 _let_15))) (let ((_let_17 (tptp.least_upper_bound tptp.c tptp.a))) (let ((_let_18 (= _let_6 _let_17))) (let ((_let_19 (tptp.least_upper_bound tptp.c tptp.b))) (let ((_let_20 (= _let_4 _let_19))) (let ((_let_21 (= _let_15 (tptp.greatest_lower_bound (tptp.greatest_lower_bound tptp.c tptp.a) tptp.b)))) (let ((_let_22 (= tptp.c (tptp.greatest_lower_bound tptp.c _let_17)))) (let ((_let_23 (= tptp.c (tptp.greatest_lower_bound tptp.c _let_19)))) (let ((_let_24 (SYMM (ASSUME :args (_let_7))))) (let ((_let_25 (SYMM (ASSUME :args (_let_5))))) (let ((_let_26 (SYMM (ASSUME :args (_let_3))))) (let ((_let_27 (_let_11))) (let ((_let_28 (ASSUME :args _let_27))) (let ((_let_29 (_let_10))) (let ((_let_30 (ASSUME :args _let_29))) (let ((_let_31 ((tptp.least_upper_bound X Y)))) (let ((_let_32 (_let_9))) (let ((_let_33 (ASSUME :args _let_32))) (let ((_let_34 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)))))) (let ((_let_35 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_36 (_let_34))) (let ((_let_37 ((tptp.least_upper_bound X Y)))) (let ((_let_38 (not _let_23))) (let ((_let_39 (not _let_22))) (let ((_let_40 (not _let_21))) (let ((_let_41 (not _let_20))) (let ((_let_42 (not _let_18))) (let ((_let_43 (not _let_16))) (let ((_let_44 (not _let_13))) (let ((_let_45 (not _let_12))) (let ((_let_46 (not _let_14))) (let ((_let_47 (and _let_12 _let_13 _let_46 _let_16 _let_18 _let_20 _let_21 _let_22))) (let ((_let_48 (ASSUME :args (_let_16)))) (let ((_let_49 (ASSUME :args (_let_21)))) (let ((_let_50 (APPLY_UF tptp.greatest_lower_bound))) (let ((_let_51 (ASSUME :args (_let_18)))) (let ((_let_52 (REFL :args (tptp.c)))) (let ((_let_53 (ASSUME :args (_let_22)))) (let ((_let_54 (ASSUME :args (_let_20)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_47)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_26 _let_48 _let_49 _let_24 _let_51 _let_53 _let_25 _let_54) (SCOPE (FALSE_ELIM (TRANS (CONG _let_52 (TRANS (CONG _let_52 (TRANS (SYMM _let_54) (SYMM _let_25)) :args _let_50) (CONG (TRANS (SYMM (SYMM _let_53)) (CONG _let_52 (TRANS (SYMM _let_51) (SYMM _let_24)) :args _let_50)) (REFL :args (tptp.b)) :args _let_50) (SYMM _let_49) (SYMM _let_48)) :args (=)) (FALSE_INTRO _let_26))) :args (_let_46 _let_16 _let_21 _let_12 _let_18 _let_22 _let_13 _let_20))) :args (_let_12 _let_13 _let_46 _let_16 _let_18 _let_20 _let_21 _let_22))) :args (true _let_47)) (CONG (REFL :args (_let_45)) (REFL :args (_let_44)) (MACRO_SR_PRED_INTRO :args ((= (not _let_46) _let_14))) (REFL :args (_let_43)) (REFL :args (_let_42)) (REFL :args (_let_41)) (REFL :args (_let_40)) (REFL :args (_let_39)) (REFL :args (_let_38)) :args (or))) :args ((or _let_14 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39 _let_38))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (tptp.c tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_37)) :args _let_36)) _let_35 :args (_let_23 false _let_34)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (tptp.c tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_37)) :args _let_36)) _let_35 :args (_let_22 false _let_34)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_33 :args (tptp.c tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING ((tptp.greatest_lower_bound X (tptp.greatest_lower_bound Y Z))))) :args _let_32)) _let_33 :args (_let_21 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (tptp.b tptp.c QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_31)) :args _let_29)) _let_30 :args (_let_20 false _let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (tptp.a tptp.c QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_31)) :args _let_29)) _let_30 :args (_let_18 false _let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (_let_1 tptp.c QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.greatest_lower_bound X Y)))) :args _let_27)) _let_28 :args (_let_16 false _let_11)) _let_26 _let_25 _let_24 :args (false false _let_23 false _let_22 false _let_21 false _let_20 false _let_18 false _let_16 true _let_14 false _let_13 false _let_12)) :args ((forall ((X $$unsorted)) (= (tptp.multiply tptp.identity X) X)) (forall ((X $$unsorted)) (= (tptp.multiply (tptp.inverse X) X) tptp.identity)) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply (tptp.multiply X Y) Z) (tptp.multiply X (tptp.multiply Y Z)))) _let_11 _let_10 _let_9 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.least_upper_bound X (tptp.least_upper_bound Y Z)) (tptp.least_upper_bound (tptp.least_upper_bound X Y) Z))) (forall ((X $$unsorted)) (= (tptp.least_upper_bound X X) X)) (forall ((X $$unsorted)) (= (tptp.greatest_lower_bound X X) X)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)) X)) _let_8 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply X (tptp.least_upper_bound Y Z)) (tptp.least_upper_bound (tptp.multiply X Y) (tptp.multiply X Z)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply X (tptp.greatest_lower_bound Y Z)) (tptp.greatest_lower_bound (tptp.multiply X Y) (tptp.multiply X Z)))) (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (= (tptp.multiply (tptp.least_upper_bound Y Z) X) (tptp.least_upper_bound (tptp.multiply Y X) (tptp.multiply Z X)))) (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (= (tptp.multiply (tptp.greatest_lower_bound Y Z) X) (tptp.greatest_lower_bound (tptp.multiply Y X) (tptp.multiply Z X)))) _let_7 _let_5 _let_3)))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.21/0.55 )
% 0.21/0.55 % SZS output end Proof for GRP141-1
% 0.21/0.55 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------