TSTP Solution File: GRP142-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP142-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n029.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:47 EDT 2023
% Result : Unsatisfiable 0.19s 0.51s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP142-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 22:22:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.48 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.JK0354iLEx/cvc5---1.0.5_30641.p...
% 0.19/0.48 ------- get file name : TPTP file name is GRP142-1
% 0.19/0.49 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_30641.smt2...
% 0.19/0.49 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.51 % SZS status Unsatisfiable for GRP142-1
% 0.19/0.51 % SZS output start Proof for GRP142-1
% 0.19/0.51 (
% 0.19/0.51 (let ((_let_1 (tptp.greatest_lower_bound tptp.a tptp.b))) (let ((_let_2 (tptp.least_upper_bound _let_1 tptp.a))) (let ((_let_3 (not (= _let_2 tptp.a)))) (let ((_let_4 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)) X)))) (let ((_let_5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))))) (let ((_let_6 (= tptp.a _let_2))) (let ((_let_7 (tptp.least_upper_bound tptp.a _let_1))) (let ((_let_8 (= _let_2 _let_7))) (let ((_let_9 (= tptp.a _let_7))) (let ((_let_10 (SYMM (ASSUME :args (_let_3))))) (let ((_let_11 (_let_5))) (let ((_let_12 (ASSUME :args _let_11))) (let ((_let_13 (forall ((X $$unsorted) (Y $$unsorted)) (= X (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)))))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_15 (not _let_6))) (let ((_let_16 (and _let_15 _let_8))) (let ((_let_17 (_let_15 _let_8))) (let ((_let_18 (ASSUME :args (_let_8)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_16)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_10 _let_18) (SCOPE (FALSE_ELIM (TRANS (CONG (REFL :args (tptp.a)) (SYMM _let_18) :args (=)) (FALSE_INTRO _let_10))) :args _let_17)) :args _let_17)) :args (true _let_16)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_15) _let_6))) (REFL :args ((not _let_8))) (REFL :args ((not _let_9))) :args (or))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args (tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.greatest_lower_bound X Y)))) :args (_let_13))) _let_14 :args (_let_9 false _let_13)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (_let_1 tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.least_upper_bound X Y)))) :args _let_11)) _let_12 :args (_let_8 false _let_5)) _let_10 :args (false false _let_9 false _let_8 true _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))) _let_5 (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)) _let_4 (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.19/0.51 )
% 0.19/0.51 % SZS output end Proof for GRP142-1
% 0.19/0.51 % cvc5---1.0.5 exiting
% 0.19/0.51 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------