TSTP Solution File: GRP176-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n026.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:59 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n026.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 23:25: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/sandbox2/tmp/tmp.efgGmFXmgn/cvc5---1.0.5_8855.p...
% 0.21/0.50 ------- get file name : TPTP file name is GRP176-1
% 0.21/0.50 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_8855.smt2...
% 0.21/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52 % SZS status Unsatisfiable for GRP176-1
% 0.21/0.52 % SZS output start Proof for GRP176-1
% 0.21/0.52 (
% 0.21/0.52 (let ((_let_1 (tptp.multiply tptp.b tptp.d))) (let ((_let_2 (tptp.multiply tptp.a tptp.d))) (let ((_let_3 (tptp.least_upper_bound (tptp.multiply tptp.c _let_2) (tptp.multiply tptp.c _let_1)))) (let ((_let_4 (tptp.multiply (tptp.least_upper_bound tptp.a tptp.b) tptp.d))) (let ((_let_5 (= (tptp.multiply tptp.c _let_4) _let_3))) (let ((_let_6 (not _let_5))) (let ((_let_7 (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_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 (tptp.least_upper_bound _let_2 _let_1))) (let ((_let_10 (= _let_3 (tptp.multiply tptp.c _let_9)))) (let ((_let_11 (= _let_4 _let_9))) (let ((_let_12 (_let_8))) (let ((_let_13 (ASSUME :args _let_12))) (let ((_let_14 (_let_7))) (let ((_let_15 (ASSUME :args _let_14))) (let ((_let_16 (and _let_10 _let_11))) (let ((_let_17 (_let_10 _let_11))) (let ((_let_18 (ASSUME :args (_let_10)))) (let ((_let_19 (ASSUME :args (_let_11)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_16)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_18 _let_19) (SCOPE (TRANS (CONG (REFL :args (tptp.c)) (SYMM (SYMM _let_19)) :args (APPLY_UF tptp.multiply)) (SYMM _let_18)) :args _let_17)) :args _let_17)) :args (true _let_16)) :args ((or _let_5 (not _let_10) (not _let_11)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_15 :args (tptp.a tptp.b tptp.d QUANTIFIERS_INST_E_MATCHING ((tptp.multiply (tptp.least_upper_bound Y Z) X)))) :args _let_14)) _let_15 :args (_let_11 false _let_7)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_13 :args (tptp.c _let_2 _let_1 QUANTIFIERS_INST_E_MATCHING ((tptp.least_upper_bound (tptp.multiply X Y) (tptp.multiply X Z))))) :args _let_12))) _let_13 :args (_let_10 false _let_8)) (ASSUME :args (_let_6)) :args (false false _let_11 false _let_10 true _let_5)) :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))) (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))) (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)) _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)))) _let_7 (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_6))))))))))))))))))))))
% 0.21/0.52 )
% 0.21/0.53 % SZS output end Proof for GRP176-1
% 0.21/0.53 % cvc5---1.0.5 exiting
% 0.21/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------