TSTP Solution File: GRP171-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP171-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n024.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:57 EDT 2023
% Result : Unsatisfiable 0.21s 0.55s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP171-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n024.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 : Mon Aug 28 23:19:53 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.OfkcdHju9h/cvc5---1.0.5_13432.p...
% 0.21/0.51 ------- get file name : TPTP file name is GRP171-1
% 0.21/0.52 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_13432.smt2...
% 0.21/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.55 % SZS status Unsatisfiable for GRP171-1
% 0.21/0.55 % SZS output start Proof for GRP171-1
% 0.21/0.55 (
% 0.21/0.55 (let ((_let_1 (tptp.multiply tptp.a tptp.b))) (let ((_let_2 (tptp.least_upper_bound tptp.identity _let_1))) (let ((_let_3 (not (= _let_2 _let_1)))) (let ((_let_4 (tptp.least_upper_bound tptp.identity tptp.b))) (let ((_let_5 (= _let_4 tptp.b))) (let ((_let_6 (tptp.least_upper_bound tptp.identity tptp.a))) (let ((_let_7 (= _let_6 tptp.a))) (let ((_let_8 (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_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)) (= (tptp.multiply tptp.identity X) X)))) (let ((_let_11 (= tptp.a _let_6))) (let ((_let_12 (= tptp.b _let_4))) (let ((_let_13 (= _let_1 _let_2))) (let ((_let_14 (tptp.multiply tptp.identity tptp.b))) (let ((_let_15 (tptp.least_upper_bound _let_14 _let_1))) (let ((_let_16 (= (tptp.multiply _let_6 tptp.b) _let_15))) (let ((_let_17 (= tptp.b _let_14))) (let ((_let_18 (= (tptp.least_upper_bound tptp.identity _let_15) (tptp.least_upper_bound (tptp.least_upper_bound tptp.identity _let_14) _let_1)))) (let ((_let_19 (SYMM (ASSUME :args (_let_7))))) (let ((_let_20 (SYMM (ASSUME :args (_let_5))))) (let ((_let_21 (_let_8))) (let ((_let_22 (ASSUME :args _let_21))) (let ((_let_23 (forall ((X $$unsorted)) (= X (tptp.multiply tptp.identity X))))) (let ((_let_24 (EQ_RESOLVE (ASSUME :args (_let_10)) (MACRO_SR_EQ_INTRO :args (_let_10 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_25 (_let_9))) (let ((_let_26 (ASSUME :args _let_25))) (let ((_let_27 (and _let_11 _let_12 _let_16 _let_17 _let_18))) (let ((_let_28 (APPLY_UF tptp.least_upper_bound))) (let ((_let_29 (CONG (SYMM _let_19) (REFL :args (tptp.b)) :args (APPLY_UF tptp.multiply)))) (let ((_let_30 (ASSUME :args (_let_16)))) (let ((_let_31 (REFL :args (tptp.identity)))) (let ((_let_32 (ASSUME :args (_let_18)))) (let ((_let_33 (ASSUME :args (_let_17)))) (let ((_let_34 (SYMM _let_33))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_27)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_19 _let_30 _let_32 _let_33 _let_20) (SCOPE (TRANS (SYMM _let_29) _let_30 (CONG (TRANS _let_34 (TRANS (SYMM (SYMM _let_20)) (CONG _let_31 (SYMM _let_34) :args _let_28))) (REFL :args (_let_1)) :args _let_28) (SYMM _let_32) (CONG _let_31 (TRANS (SYMM _let_30) _let_29) :args _let_28)) :args (_let_11 _let_16 _let_18 _let_17 _let_12))) :args (_let_11 _let_12 _let_16 _let_17 _let_18))) :args (true _let_27)) :args ((or _let_13 (not _let_11) (not _let_12) (not _let_16) (not _let_17) (not _let_18)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (tptp.identity _let_14 _let_1 QUANTIFIERS_INST_E_MATCHING ((tptp.least_upper_bound X (tptp.least_upper_bound Y Z))))) :args _let_25)) _let_26 :args (_let_18 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_24 :args (tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.multiply tptp.identity X)))) :args (_let_23))) _let_24 :args (_let_17 false _let_23)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_22 :args (tptp.identity tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING ((tptp.multiply (tptp.least_upper_bound Y Z) X)))) :args _let_21)) _let_22 :args (_let_16 false _let_8)) (SYMM (ASSUME :args (_let_3))) _let_20 _let_19 :args (false false _let_18 false _let_17 false _let_16 true _let_13 false _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))) (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)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)) X)) (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_8 (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 GRP171-1
% 0.21/0.56 % cvc5---1.0.5 exiting
% 0.21/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------