TSTP Solution File: RNG006-2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : RNG006-2 : TPTP v8.1.2. Released v1.0.0.
% 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 13:49:25 EDT 2023
% Result : Unsatisfiable 0.22s 0.55s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG006-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun Aug 27 03:14:10 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.49 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.8x3FgfR9Fs/cvc5---1.0.5_19225.p...
% 0.22/0.50 ------- get file name : TPTP file name is RNG006-2
% 0.22/0.51 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_19225.smt2...
% 0.22/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.55 % SZS status Unsatisfiable for RNG006-2
% 0.22/0.55 % SZS output start Proof for RNG006-2
% 0.22/0.55 (
% 0.22/0.55 (let ((_let_1 (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) (let ((_let_2 (not _let_1))) (let ((_let_3 (tptp.additive_inverse tptp.aPc))) (let ((_let_4 (tptp.sum tptp.aPb _let_3 tptp.aPb_S_IaPc))) (let ((_let_5 (tptp.product tptp.a tptp.c tptp.aPc))) (let ((_let_6 (tptp.product tptp.a tptp.b tptp.aPb))) (let ((_let_7 (tptp.additive_inverse tptp.c))) (let ((_let_8 (tptp.sum tptp.b _let_7 tptp.bS_Ic))) (let ((_let_9 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))))) (let ((_let_10 (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))))) (let ((_let_11 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))))) (let ((_let_12 (tptp.product tptp.a _let_7 _let_3))) (let ((_let_13 (not _let_5))) (let ((_let_14 (or _let_13 _let_12))) (let ((_let_15 (_let_9))) (let ((_let_16 (ASSUME :args _let_15))) (let ((_let_17 (not _let_14))) (let ((_let_18 (tptp.sum _let_3 tptp.aPb tptp.aPb_S_IaPc))) (let ((_let_19 (not _let_18))) (let ((_let_20 (tptp.sum _let_7 tptp.b tptp.bS_Ic))) (let ((_let_21 (not _let_20))) (let ((_let_22 (not _let_6))) (let ((_let_23 (not _let_12))) (let ((_let_24 (or _let_23 _let_22 _let_21 _let_19 _let_1))) (let ((_let_25 (_let_10))) (let ((_let_26 (ASSUME :args _let_25))) (let ((_let_27 (not _let_4))) (let ((_let_28 (or _let_27 _let_18))) (let ((_let_29 (_let_11))) (let ((_let_30 (ASSUME :args _let_29))) (let ((_let_31 ((not (= (tptp.sum X Y Z) false))))) (let ((_let_32 (not _let_8))) (let ((_let_33 (or _let_32 _let_20))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_16 :args (tptp.a tptp.c tptp.aPc QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)) true))))) :args _let_15)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_14)) :args ((or _let_13 _let_12 _let_17))) (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_24)) :args ((or _let_1 _let_22 _let_21 _let_19 _let_23 (not _let_24)))) (ASSUME :args (_let_2)) (ASSUME :args (_let_6)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_33)) :args ((or _let_32 _let_20 (not _let_33)))) (ASSUME :args (_let_8)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (tptp.b _let_7 tptp.bS_Ic QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_31)) :args _let_29)) _let_30 :args (_let_33 false _let_11)) :args (_let_20 false _let_8 false _let_33)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_28)) :args ((or _let_27 _let_18 (not _let_28)))) (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (tptp.aPb _let_3 tptp.aPb_S_IaPc QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_31)) :args _let_29)) _let_30 :args (_let_28 false _let_11)) :args (_let_18 false _let_4 false _let_28)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (tptp.a _let_7 _let_3 tptp.b tptp.aPb tptp.bS_Ic tptp.aPb_S_IaPc QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.product X Z V2) false)) (not (= (tptp.sum Y Z V3) false)) (not (= (tptp.sum V1 V2 V4) false))))) :args _let_25)) _let_26 :args (_let_24 false _let_10)) :args (_let_23 true _let_1 false _let_6 false _let_20 false _let_18 false _let_24)) :args (_let_17 false _let_5 true _let_12)) _let_16 :args (false true _let_14 false _let_9)) :args ((forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equalish X Y)) (tptp.equalish (tptp.additive_inverse X) (tptp.additive_inverse Y)))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted)) (or (not (tptp.equalish X Y)) (tptp.equalish (tptp.add X W) (tptp.add Y W)))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.sum X W Z)) (tptp.sum Y W Z))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.sum W X Z)) (tptp.sum W Y Z))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.sum W Z X)) (tptp.sum W Z Y))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted)) (or (not (tptp.equalish X Y)) (tptp.equalish (tptp.multiply X W) (tptp.multiply Y W)))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.product X W Z)) (tptp.product Y W Z))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.product W X Z)) (tptp.product W Y Z))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.product W Z X)) (tptp.product W Z Y))) (forall ((X $$unsorted)) (tptp.sum tptp.additive_identity X X)) (forall ((X $$unsorted)) (tptp.sum X tptp.additive_identity X)) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.sum X Y (tptp.add X Y))) (forall ((X $$unsorted)) (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity)) (forall ((X $$unsorted)) (tptp.sum X (tptp.additive_inverse X) tptp.additive_identity)) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)) (tptp.sum X V W))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum X V W)) (tptp.sum U Z W))) _let_11 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.product X V3 V4)) (tptp.sum V1 V2 V4))) _let_10 (forall ((Y $$unsorted) (X $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product Y X V1)) (not (tptp.product Z X V2)) (not (tptp.sum Y Z V3)) (not (tptp.product V3 X V4)) (tptp.sum V1 V2 V4))) (forall ((Y $$unsorted) (X $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product Y X V1)) (not (tptp.product Z X V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product V3 X V4))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.sum X Y U)) (not (tptp.sum X Y V)) (tptp.equalish U V))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product X Y V)) (tptp.equalish U V))) (forall ((X $$unsorted)) (tptp.product tptp.additive_identity X tptp.additive_identity)) (forall ((X $$unsorted)) (tptp.product X tptp.additive_identity tptp.additive_identity)) _let_9 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product (tptp.additive_inverse A) B (tptp.additive_inverse C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product (tptp.additive_inverse A) (tptp.additive_inverse B) C))) _let_8 _let_6 _let_5 _let_4 _let_2))))))))))))))))))))))))))))))))))))
% 0.22/0.55 )
% 0.22/0.55 % SZS output end Proof for RNG006-2
% 0.22/0.55 % cvc5---1.0.5 exiting
% 0.22/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------