TSTP Solution File: GRP186-4 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP186-4 : 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:25:05 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP186-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 20:54:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.49 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.SI0ZNT74Tk/cvc5---1.0.5_9228.p...
% 0.21/0.50 ------- get file name : TPTP file name is GRP186-4
% 0.21/0.50 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_9228.smt2...
% 0.21/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.54 % SZS status Unsatisfiable for GRP186-4
% 0.21/0.54 % SZS output start Proof for GRP186-4
% 0.21/0.54 (
% 0.21/0.54 (let ((_let_1 (tptp.inverse tptp.a))) (let ((_let_2 (tptp.multiply tptp.a (tptp.least_upper_bound _let_1 tptp.b)))) (let ((_let_3 (tptp.multiply tptp.a tptp.b))) (let ((_let_4 (tptp.least_upper_bound _let_3 tptp.identity))) (let ((_let_5 (= _let_4 _let_2))) (let ((_let_6 (not _let_5))) (let ((_let_7 (forall ((X $$unsorted)) (= (tptp.inverse (tptp.inverse X)) X)))) (let ((_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)))))) (let ((_let_9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)) X)))) (let ((_let_10 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))))) (let ((_let_11 (forall ((X $$unsorted)) (= (tptp.multiply (tptp.inverse X) X) tptp.identity)))) (let ((_let_12 (= _let_3 (tptp.greatest_lower_bound _let_3 _let_4)))) (let ((_let_13 (tptp.multiply tptp.a _let_1))) (let ((_let_14 (tptp.least_upper_bound _let_13 _let_3))) (let ((_let_15 (= _let_2 _let_14))) (let ((_let_16 (= _let_14 (tptp.least_upper_bound _let_3 _let_13)))) (let ((_let_17 (tptp.inverse _let_1))) (let ((_let_18 (= tptp.identity (tptp.multiply _let_17 _let_1)))) (let ((_let_19 (= tptp.a _let_17))) (let ((_let_20 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)))))) (let ((_let_21 (EQ_RESOLVE (ASSUME :args (_let_9)) (MACRO_SR_EQ_INTRO :args (_let_9 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_22 (_let_8))) (let ((_let_23 (ASSUME :args _let_22))) (let ((_let_24 (_let_10))) (let ((_let_25 (ASSUME :args _let_24))) (let ((_let_26 (forall ((X $$unsorted)) (= tptp.identity (tptp.multiply (tptp.inverse X) X))))) (let ((_let_27 (EQ_RESOLVE (ASSUME :args (_let_11)) (MACRO_SR_EQ_INTRO :args (_let_11 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_28 (forall ((X $$unsorted)) (= X (tptp.inverse (tptp.inverse X)))))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_30 (and _let_12 _let_15 _let_16 _let_18 _let_19))) (let ((_let_31 (ASSUME :args (_let_15)))) (let ((_let_32 (ASSUME :args (_let_16)))) (let ((_let_33 (APPLY_UF tptp.least_upper_bound))) (let ((_let_34 (ASSUME :args (_let_12)))) (let ((_let_35 (ASSUME :args (_let_19)))) (let ((_let_36 (ASSUME :args (_let_18)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_30)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_31 _let_32 _let_34 _let_35 _let_36) (SCOPE (TRANS (CONG _let_34 (TRANS (SYMM (SYMM _let_36)) (CONG (SYMM _let_35) (REFL :args (_let_1)) :args (APPLY_UF tptp.multiply))) :args _let_33) (CONG (SYMM _let_34) (REFL :args (_let_13)) :args _let_33) (SYMM _let_32) (SYMM _let_31)) :args (_let_15 _let_16 _let_12 _let_19 _let_18))) :args (_let_12 _let_15 _let_16 _let_18 _let_19))) :args (true _let_30)) :args ((or _let_5 (not _let_12) (not _let_15) (not _let_16) (not _let_18) (not _let_19)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_29 :args (tptp.a QUANTIFIERS_INST_E_MATCHING ((tptp.inverse (tptp.inverse X))))) :args (_let_28))) _let_29 :args (_let_19 false _let_28)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_27 :args (_let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.inverse X)))) :args (_let_26))) _let_27 :args (_let_18 false _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_25 :args (_let_13 _let_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args _let_24)) _let_25 :args (_let_16 false _let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (tptp.a _let_1 tptp.b QUANTIFIERS_INST_E_MATCHING ((tptp.multiply X (tptp.least_upper_bound Y Z))))) :args _let_22)) _let_23 :args (_let_15 false _let_8)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (_let_3 tptp.identity QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args (_let_20))) _let_21 :args (_let_12 false _let_20)) (ASSUME :args (_let_6)) :args (false false _let_19 false _let_18 false _let_16 false _let_15 false _let_12 true _let_5)) :args ((forall ((X $$unsorted)) (= (tptp.multiply tptp.identity X) X)) _let_11 (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_10 (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_9 _let_8 (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) _let_7 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.inverse (tptp.multiply X Y)) (tptp.multiply (tptp.inverse Y) (tptp.inverse X)))) _let_6)))))))))))))))))))))))))))))))))))))))
% 0.21/0.54 )
% 0.21/0.55 % SZS output end Proof for GRP186-4
% 0.21/0.55 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------