TSTP Solution File: GRP165-2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP165-2 : 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:53 EDT 2023
% Result : Unsatisfiable 0.21s 0.79s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP165-2 : 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:48:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.uijPYAO07z/cvc5---1.0.5_3247.p...
% 0.21/0.50 ------- get file name : TPTP file name is GRP165-2
% 0.21/0.51 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_3247.smt2...
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.79 % SZS status Unsatisfiable for GRP165-2
% 0.21/0.79 % SZS output start Proof for GRP165-2
% 0.21/0.80 (
% 0.21/0.80 (let ((_let_1 (tptp.multiply tptp.a tptp.a))) (let ((_let_2 (tptp.greatest_lower_bound tptp.a _let_1))) (let ((_let_3 (not (= _let_2 tptp.a)))) (let ((_let_4 (tptp.greatest_lower_bound tptp.a tptp.identity))) (let ((_let_5 (= _let_4 tptp.identity))) (let ((_let_6 (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)))))) (let ((_let_7 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)) X)))) (let ((_let_8 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)) X)))) (let ((_let_9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))))) (let ((_let_10 (forall ((X $$unsorted)) (= (tptp.multiply tptp.identity X) X)))) (let ((_let_11 (= tptp.identity _let_4))) (let ((_let_12 (= tptp.a _let_2))) (let ((_let_13 (tptp.least_upper_bound tptp.a _let_4))) (let ((_let_14 (= tptp.a _let_13))) (let ((_let_15 (tptp.least_upper_bound _let_4 tptp.a))) (let ((_let_16 (= _let_13 _let_15))) (let ((_let_17 (tptp.multiply _let_4 tptp.a))) (let ((_let_18 (tptp.least_upper_bound _let_17 _let_1))) (let ((_let_19 (= (tptp.multiply _let_15 tptp.a) _let_18))) (let ((_let_20 (= tptp.a (tptp.multiply tptp.identity tptp.a)))) (let ((_let_21 (= _let_17 (tptp.greatest_lower_bound _let_17 _let_18)))) (let ((_let_22 (SYMM (ASSUME :args (_let_5))))) (let ((_let_23 (SYMM (ASSUME :args (_let_3))))) (let ((_let_24 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)))))) (let ((_let_25 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_26 (_let_9))) (let ((_let_27 (ASSUME :args _let_26))) (let ((_let_28 (_let_6))) (let ((_let_29 (ASSUME :args _let_28))) (let ((_let_30 (forall ((X $$unsorted)) (= X (tptp.multiply tptp.identity X))))) (let ((_let_31 (EQ_RESOLVE (ASSUME :args (_let_10)) (MACRO_SR_EQ_INTRO :args (_let_10 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_32 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)))))) (let ((_let_33 (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_34 (not _let_21))) (let ((_let_35 (not _let_20))) (let ((_let_36 (not _let_19))) (let ((_let_37 (not _let_16))) (let ((_let_38 (not _let_14))) (let ((_let_39 (not _let_11))) (let ((_let_40 (not _let_12))) (let ((_let_41 (and _let_11 _let_40 _let_14 _let_16 _let_19 _let_20))) (let ((_let_42 (APPLY_UF tptp.multiply))) (let ((_let_43 (REFL :args (tptp.a)))) (let ((_let_44 (ASSUME :args (_let_14)))) (let ((_let_45 (ASSUME :args (_let_16)))) (let ((_let_46 (ASSUME :args (_let_19)))) (let ((_let_47 (ASSUME :args (_let_20)))) (let ((_let_48 (TRANS (CONG (SYMM _let_22) _let_43 :args _let_42) (SYMM _let_47)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_41)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_23 _let_47 _let_22 _let_44 _let_45 _let_46) (SCOPE (FALSE_ELIM (TRANS (CONG _let_48 (CONG _let_48 (TRANS (SYMM _let_46) (CONG (TRANS (SYMM _let_45) (SYMM _let_44)) _let_43 :args _let_42)) :args (APPLY_UF tptp.greatest_lower_bound)) :args (=)) (FALSE_INTRO _let_23))) :args (_let_40 _let_20 _let_11 _let_14 _let_16 _let_19))) :args (_let_11 _let_40 _let_14 _let_16 _let_19 _let_20))) :args (true _let_41)) (CONG (REFL :args (_let_39)) (MACRO_SR_PRED_INTRO :args ((= (not _let_40) _let_12))) (REFL :args (_let_38)) (REFL :args (_let_37)) (REFL :args (_let_36)) (REFL :args (_let_35)) (REFL :args (_let_34)) :args (or))) :args ((or _let_12 _let_39 _let_38 _let_37 _let_36 _let_35 _let_34))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_33 :args (_let_17 _let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args (_let_32))) _let_33 :args (_let_21 false _let_32)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.multiply tptp.identity X)))) :args (_let_30))) _let_31 :args (_let_20 false _let_30)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_29 :args (_let_4 tptp.a tptp.a QUANTIFIERS_INST_E_MATCHING ((tptp.multiply (tptp.least_upper_bound Y Z) X)))) :args _let_28)) _let_29 :args (_let_19 false _let_6)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_27 :args (tptp.a _let_4 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args _let_26)) _let_27 :args (_let_16 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_25 :args (tptp.a tptp.identity QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.greatest_lower_bound X Y)))) :args (_let_24))) _let_25 :args (_let_14 false _let_24)) _let_23 _let_22 :args (false false _let_21 false _let_20 false _let_19 false _let_16 false _let_14 true _let_12 false _let_11)) :args (_let_10 (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)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X Y) (tptp.greatest_lower_bound Y X))) _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))) (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)) _let_8 _let_7 (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)))) _let_6 (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_5 _let_3)))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.21/0.80 )
% 0.21/0.80 % SZS output end Proof for GRP165-2
% 0.21/0.80 % cvc5---1.0.5 exiting
% 0.21/0.80 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------