TSTP Solution File: GRP155-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP155-1 : 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:24:50 EDT 2023
% Result : Unsatisfiable 0.22s 0.54s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP155-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 21:01:47 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.51 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.OQXjTe90vN/cvc5---1.0.5_1453.p...
% 0.22/0.51 ------- get file name : TPTP file name is GRP155-1
% 0.22/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_1453.smt2...
% 0.22/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.54 % SZS status Unsatisfiable for GRP155-1
% 0.22/0.54 % SZS output start Proof for GRP155-1
% 0.22/0.54 (
% 0.22/0.54 (let ((_let_1 (tptp.multiply tptp.a tptp.c))) (let ((_let_2 (tptp.greatest_lower_bound _let_1 (tptp.multiply tptp.b tptp.c)))) (let ((_let_3 (not (= _let_2 _let_1)))) (let ((_let_4 (tptp.greatest_lower_bound tptp.a tptp.b))) (let ((_let_5 (= _let_4 tptp.a))) (let ((_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)))))) (let ((_let_7 (= _let_2 (tptp.multiply _let_4 tptp.c)))) (let ((_let_8 (_let_6))) (let ((_let_9 (ASSUME :args _let_8))) (let ((_let_10 (= tptp.a _let_4))) (let ((_let_11 (= _let_1 _let_2))) (let ((_let_12 (not _let_7))) (let ((_let_13 (SYMM (ASSUME :args (_let_5))))) (let ((_let_14 (SYMM (ASSUME :args (_let_3))))) (let ((_let_15 (not _let_10))) (let ((_let_16 (not _let_11))) (let ((_let_17 (and _let_10 _let_16))) (let ((_let_18 (_let_10 _let_16))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_9 :args (tptp.a tptp.b tptp.c QUANTIFIERS_INST_E_MATCHING ((tptp.multiply (tptp.greatest_lower_bound Y Z) X)))) :args _let_8))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_17)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_13 _let_14) (SCOPE (FALSE_ELIM (MACRO_SR_PRED_TRANSFORM (TRANS (CONG (CONG (SYMM _let_13) (REFL :args (tptp.c)) :args (APPLY_UF tptp.multiply)) (REFL :args (_let_2)) :args (=)) (FALSE_INTRO _let_14)) :args ((= _let_7 false)))) :args _let_18)) :args _let_18)) :args (true _let_17)) (CONG (REFL :args (_let_15)) (MACRO_SR_PRED_INTRO :args ((= (not _let_16) _let_11))) (REFL :args (_let_12)) :args (or))) :args ((or _let_11 _let_15 _let_12))) _let_14 _let_13 :args (_let_12 true _let_11 false _let_10)) _let_9 :args (false true _let_7 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))) (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)) (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)))) _let_6 _let_5 _let_3)))))))))))))))))))))
% 0.22/0.54 )
% 0.22/0.54 % SZS output end Proof for GRP155-1
% 0.22/0.54 % cvc5---1.0.5 exiting
% 0.22/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------