TSTP Solution File: GRP163-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n031.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:53 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.11/0.13 % Problem : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n031.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 : Tue Aug 29 02:16:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.48 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.JSzs5VrW48/cvc5---1.0.5_18465.p...
% 0.19/0.49 ------- get file name : TPTP file name is GRP163-1
% 0.19/0.49 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_18465.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 GRP163-1
% 0.19/0.51 % SZS output start Proof for GRP163-1
% 0.19/0.52 (
% 0.19/0.52 (let ((_let_1 (tptp.greatest_lower_bound tptp.a tptp.c))) (let ((_let_2 (not (= _let_1 tptp.a)))) (let ((_let_3 (tptp.greatest_lower_bound tptp.b tptp.c))) (let ((_let_4 (= _let_3 tptp.b))) (let ((_let_5 (tptp.greatest_lower_bound tptp.a tptp.b))) (let ((_let_6 (= _let_5 tptp.a))) (let ((_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))))) (let ((_let_8 (= (tptp.greatest_lower_bound tptp.a _let_3) (tptp.greatest_lower_bound _let_5 tptp.c)))) (let ((_let_9 (_let_7))) (let ((_let_10 (ASSUME :args _let_9))) (let ((_let_11 (= tptp.b _let_3))) (let ((_let_12 (= tptp.a _let_5))) (let ((_let_13 (= tptp.a _let_1))) (let ((_let_14 (not _let_8))) (let ((_let_15 (SYMM (ASSUME :args (_let_4))))) (let ((_let_16 (SYMM (ASSUME :args (_let_6))))) (let ((_let_17 (SYMM (ASSUME :args (_let_2))))) (let ((_let_18 (not _let_11))) (let ((_let_19 (not _let_12))) (let ((_let_20 (not _let_13))) (let ((_let_21 (and _let_12 _let_11 _let_20))) (let ((_let_22 (_let_12 _let_11 _let_20))) (let ((_let_23 (APPLY_UF tptp.greatest_lower_bound))) (let ((_let_24 (SYMM _let_16))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_10 :args (tptp.a tptp.b tptp.c QUANTIFIERS_INST_E_MATCHING ((tptp.greatest_lower_bound X (tptp.greatest_lower_bound Y Z))))) :args _let_9)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_21)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_16 _let_15 _let_17) (SCOPE (FALSE_ELIM (TRANS (CONG (TRANS (CONG (REFL :args (tptp.a)) (SYMM _let_15) :args _let_23) _let_24) (CONG _let_24 (REFL :args (tptp.c)) :args _let_23) :args (=)) (FALSE_INTRO _let_17))) :args _let_22)) :args _let_22)) :args (true _let_21)) (CONG (REFL :args (_let_19)) (REFL :args (_let_18)) (MACRO_SR_PRED_INTRO :args ((= (not _let_20) _let_13))) (REFL :args (_let_14)) :args (or))) :args ((or _let_13 _let_19 _let_18 _let_14))) _let_17 _let_16 _let_15 :args (_let_14 true _let_13 false _let_12 false _let_11)) _let_10 :args (false true _let_8 false _let_7)) :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))) _let_7 (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)))) (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 _let_4 _let_2)))))))))))))))))))))))))))
% 0.19/0.52 )
% 0.19/0.52 % SZS output end Proof for GRP163-1
% 0.19/0.52 % cvc5---1.0.5 exiting
% 0.19/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------