TSTP Solution File: GRP148-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n025.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:49 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % Command : do_cvc5 %s %d
% 0.18/0.34 % Computer : n025.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Mon Aug 28 20:12:25 EDT 2023
% 0.18/0.34 % CPUTime :
% 0.20/0.47 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.48 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.RsO0FBYQaw/cvc5---1.0.5_24958.p...
% 0.20/0.49 ------- get file name : TPTP file name is GRP148-1
% 0.20/0.49 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24958.smt2...
% 0.20/0.49 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Unsatisfiable for GRP148-1
% 0.20/0.52 % SZS output start Proof for GRP148-1
% 0.20/0.52 (
% 0.20/0.52 (let ((_let_1 (tptp.least_upper_bound tptp.a tptp.b))) (let ((_let_2 (tptp.greatest_lower_bound _let_1 tptp.c))) (let ((_let_3 (not (= _let_2 _let_1)))) (let ((_let_4 (tptp.least_upper_bound tptp.b tptp.c))) (let ((_let_5 (= _let_4 tptp.c))) (let ((_let_6 (tptp.least_upper_bound tptp.a tptp.c))) (let ((_let_7 (= _let_6 tptp.c))) (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.least_upper_bound X (tptp.least_upper_bound Y Z)) (tptp.least_upper_bound (tptp.least_upper_bound X Y) Z))))) (let ((_let_10 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)))))) (let ((_let_11 (tptp.least_upper_bound _let_1 tptp.c))) (let ((_let_12 (= _let_1 (tptp.greatest_lower_bound _let_1 _let_11)))) (let ((_let_13 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_14 (= (tptp.least_upper_bound tptp.a _let_4) _let_11))) (let ((_let_15 (= tptp.c _let_4))) (let ((_let_16 (= tptp.c _let_6))) (let ((_let_17 (= _let_1 _let_2))) (let ((_let_18 (not _let_12))) (let ((_let_19 (_let_9))) (let ((_let_20 (ASSUME :args _let_19))) (let ((_let_21 (SYMM (ASSUME :args (_let_5))))) (let ((_let_22 (SYMM (ASSUME :args (_let_7))))) (let ((_let_23 (SYMM (ASSUME :args (_let_3))))) (let ((_let_24 (not _let_14))) (let ((_let_25 (not _let_15))) (let ((_let_26 (not _let_16))) (let ((_let_27 (not _let_17))) (let ((_let_28 (and _let_16 _let_15 _let_27 _let_14))) (let ((_let_29 (ASSUME :args (_let_14)))) (let ((_let_30 (REFL :args (_let_1)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_13 :args (_let_1 tptp.c QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args (_let_10))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_28)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_23 _let_22 _let_21 _let_29) (SCOPE (FALSE_ELIM (TRANS (CONG _let_30 (CONG _let_30 (TRANS (SYMM _let_29) (CONG (REFL :args (tptp.a)) (SYMM _let_21) :args (APPLY_UF tptp.least_upper_bound)) (SYMM _let_22)) :args (APPLY_UF tptp.greatest_lower_bound)) :args (=)) (FALSE_INTRO _let_23))) :args (_let_27 _let_16 _let_15 _let_14))) :args (_let_16 _let_15 _let_27 _let_14))) :args (true _let_28)) (CONG (REFL :args (_let_26)) (REFL :args (_let_25)) (MACRO_SR_PRED_INTRO :args ((= (not _let_27) _let_17))) (REFL :args (_let_24)) (REFL :args (_let_18)) :args (or))) :args ((or _let_17 _let_26 _let_25 _let_24 _let_18))) _let_23 _let_22 _let_21 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_20 :args (tptp.a tptp.b tptp.c QUANTIFIERS_INST_E_MATCHING ((tptp.least_upper_bound X (tptp.least_upper_bound Y Z))))) :args _let_19)) _let_20 :args (_let_14 false _let_9)) :args (_let_18 true _let_17 false _let_16 false _let_15 false _let_14)) _let_13 :args (false true _let_12 false _let_10)) :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)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X Y) (tptp.greatest_lower_bound Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))) (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_9 (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.20/0.52 )
% 0.20/0.52 % SZS output end Proof for GRP148-1
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------