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