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