TSTP Solution File: NUM021-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n013.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 10:42:01 EDT 2023
% Result : Unsatisfiable 0.18s 0.50s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.13 % Command : do_cvc5 %s %d
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 10:12:32 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 %----Proving TF0_NAR, FOF, or CNF
% 0.18/0.46 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.u4PRTOwkiC/cvc5---1.0.5_17894.p...
% 0.18/0.47 ------- get file name : TPTP file name is NUM021-1
% 0.18/0.47 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_17894.smt2...
% 0.18/0.47 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.18/0.50 % SZS status Unsatisfiable for NUM021-1
% 0.18/0.50 % SZS output start Proof for NUM021-1
% 0.18/0.50 (
% 0.18/0.50 (let ((_let_1 (tptp.divides tptp.c tptp.a))) (let ((_let_2 (tptp.less tptp.b tptp.a))) (let ((_let_3 (not _let_2))) (let ((_let_4 (tptp.less tptp.b tptp.c))) (let ((_let_5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)) (tptp.equalish X Z))))) (let ((_let_6 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.divides A B)) (tptp.less A B) (tptp.equalish A B))))) (let ((_let_7 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.less A B)) (tptp.equalish (tptp.add (tptp.successor (tptp.predecessor_of_1st_minus_2nd B A)) A) B))))) (let ((_let_8 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.equalish (tptp.add (tptp.successor A) B) C)) (tptp.less B C))))) (let ((_let_9 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.less A B)) (not (tptp.less C A)) (tptp.less C B))))) (let ((_let_10 (not _let_4))) (let ((_let_11 (tptp.less tptp.c tptp.a))) (let ((_let_12 (not _let_11))) (let ((_let_13 (or _let_12 _let_10 _let_2))) (let ((_let_14 (_let_9))) (let ((_let_15 (ASSUME :args _let_14))) (let ((_let_16 (not _let_13))) (let ((_let_17 (tptp.equalish tptp.c tptp.a))) (let ((_let_18 (not _let_1))) (let ((_let_19 (or _let_18 _let_11 _let_17))) (let ((_let_20 (_let_6))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (tptp.predecessor_of_1st_minus_2nd tptp.c tptp.b))) (let ((_let_23 (tptp.add (tptp.successor _let_22) tptp.b))) (let ((_let_24 (tptp.equalish _let_23 tptp.a))) (let ((_let_25 (not _let_17))) (let ((_let_26 (tptp.equalish _let_23 tptp.c))) (let ((_let_27 (not _let_26))) (let ((_let_28 (or _let_27 _let_25 _let_24))) (let ((_let_29 (_let_5))) (let ((_let_30 (ASSUME :args _let_29))) (let ((_let_31 (not _let_24))) (let ((_let_32 (or _let_31 _let_2))) (let ((_let_33 (_let_8))) (let ((_let_34 (ASSUME :args _let_33))) (let ((_let_35 (ASSUME :args (_let_3)))) (let ((_let_36 (or _let_10 _let_26))) (let ((_let_37 (_let_7))) (let ((_let_38 (ASSUME :args _let_37))) (let ((_let_39 (ASSUME :args (_let_4)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_15 :args (tptp.c tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.less C A) false)) (not (= (tptp.less C B) true))))) :args _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_13)) :args ((or _let_2 _let_10 _let_12 _let_16))) _let_35 _let_39 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_11 _let_17 (not _let_19)))) (ASSUME :args (_let_1)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_28)) :args ((or _let_27 _let_25 _let_24 (not _let_28)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_36)) :args ((or _let_10 _let_26 (not _let_36)))) _let_39 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_38 :args (tptp.b tptp.c QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less A B) false))))) :args _let_37)) _let_38 :args (_let_36 false _let_7)) :args (_let_26 false _let_4 false _let_36)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_32)) :args ((or _let_2 _let_31 (not _let_32)))) _let_35 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_34 :args (_let_22 tptp.b tptp.a QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.equalish (tptp.add (tptp.successor A) B) C) false))))) :args _let_33)) _let_34 :args (_let_32 false _let_8)) :args (_let_31 true _let_2 false _let_32)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (_let_23 tptp.c tptp.a QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.equalish X Y) false)) (not (= (tptp.equalish Y Z) false))))) :args _let_29)) _let_30 :args (_let_28 false _let_5)) :args (_let_25 false _let_26 true _let_24 false _let_28)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.c tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.divides A B) false))))) :args _let_20)) _let_21 :args (_let_19 false _let_6)) :args (_let_11 false _let_1 true _let_17 false _let_19)) :args (_let_16 true _let_2 false _let_4 false _let_11)) _let_15 :args (false true _let_13 false _let_9)) :args ((forall ((A $$unsorted)) (tptp.equalish (tptp.add A tptp.n0) A)) (forall ((A $$unsorted) (B $$unsorted)) (tptp.equalish (tptp.add A (tptp.successor B)) (tptp.successor (tptp.add A B)))) (forall ((A $$unsorted)) (tptp.equalish (tptp.multiply A tptp.n0) tptp.n0)) (forall ((A $$unsorted) (B $$unsorted)) (tptp.equalish (tptp.multiply A (tptp.successor B)) (tptp.add (tptp.multiply A B) A))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.equalish (tptp.successor A) (tptp.successor B))) (tptp.equalish A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.equalish A B)) (tptp.equalish (tptp.successor A) (tptp.successor B)))) _let_9 _let_8 _let_7 _let_6 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.less A B)) (tptp.divides A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.equalish A B)) (tptp.divides A B))) (forall ((X $$unsorted)) (tptp.equalish X X)) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equalish X Y)) (tptp.equalish Y X))) _let_5 _let_4 _let_3 _let_1 (forall ((A $$unsorted)) (not (tptp.equalish (tptp.successor A) tptp.n0)))))))))))))))))))))))))))))))))))))))))))))
% 0.18/0.50 )
% 0.18/0.50 % SZS output end Proof for NUM021-1
% 0.18/0.51 % cvc5---1.0.5 exiting
% 0.18/0.51 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------