TSTP Solution File: GRP189-2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP189-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:25:06 EDT 2023
% Result : Unsatisfiable 0.23s 0.56s
% Output : Proof 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP189-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.16 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n008.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Aug 29 01:04:17 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.53 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.UG6zoE8AMH/cvc5---1.0.5_5640.p...
% 0.23/0.53 ------- get file name : TPTP file name is GRP189-2
% 0.23/0.53 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_5640.smt2...
% 0.23/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.23/0.56 % SZS status Unsatisfiable for GRP189-2
% 0.23/0.56 % SZS output start Proof for GRP189-2
% 0.23/0.56 (
% 0.23/0.56 (let ((_let_1 (tptp.least_upper_bound tptp.a tptp.b))) (let ((_let_2 (tptp.greatest_lower_bound tptp.b _let_1))) (let ((_let_3 (not (= _let_2 tptp.b)))) (let ((_let_4 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)) X)))) (let ((_let_5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))))) (let ((_let_6 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)))))) (let ((_let_7 (tptp.least_upper_bound tptp.b tptp.a))) (let ((_let_8 (= tptp.b (tptp.greatest_lower_bound tptp.b _let_7)))) (let ((_let_9 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_10 (= _let_1 _let_7))) (let ((_let_11 (= tptp.b _let_2))) (let ((_let_12 (not _let_8))) (let ((_let_13 (_let_5))) (let ((_let_14 (ASSUME :args _let_13))) (let ((_let_15 (SYMM (ASSUME :args (_let_3))))) (let ((_let_16 (not _let_11))) (let ((_let_17 (and _let_16 _let_10))) (let ((_let_18 (_let_16 _let_10))) (let ((_let_19 (ASSUME :args (_let_10)))) (let ((_let_20 (REFL :args (tptp.b)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_9 :args (tptp.b tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args (_let_6))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_17)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_15 _let_19) (SCOPE (FALSE_ELIM (TRANS (CONG _let_20 (CONG _let_20 (SYMM _let_19) :args (APPLY_UF tptp.greatest_lower_bound)) :args (=)) (FALSE_INTRO _let_15))) :args _let_18)) :args _let_18)) :args (true _let_17)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_16) _let_11))) (REFL :args ((not _let_10))) (REFL :args (_let_12)) :args (or))) _let_15 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args (tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args _let_13)) _let_14 :args (_let_10 false _let_5)) :args (_let_12 true _let_11 false _let_10)) _let_9 :args (false true _let_8 false _let_6)) :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))) _let_5 (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)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)) X)) _let_4 (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)))) (= (tptp.inverse tptp.identity) tptp.identity) (forall ((X $$unsorted)) (= (tptp.inverse (tptp.inverse X)) X)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.inverse (tptp.multiply X Y)) (tptp.multiply (tptp.inverse Y) (tptp.inverse X)))) _let_3)))))))))))))))))))))))
% 0.23/0.56 )
% 0.23/0.56 % SZS output end Proof for GRP189-2
% 0.23/0.56 % cvc5---1.0.5 exiting
% 0.23/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------