TSTP Solution File: SWV002-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n024.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 21:48:53 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 02:48:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.5p4To8IOuk/cvc5---1.0.5_1115.p...
% 0.21/0.50 ------- get file name : TPTP file name is SWV002-1
% 0.21/0.51 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_1115.smt2...
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.54 % SZS status Unsatisfiable for SWV002-1
% 0.21/0.54 % SZS output start Proof for SWV002-1
% 0.21/0.55 (
% 0.21/0.55 (let ((_let_1 (tptp.a tptp.j))) (let ((_let_2 (tptp.a tptp.q))) (let ((_let_3 (tptp.less_than _let_2 _let_1))) (let ((_let_4 (tptp.less_than tptp.j tptp.q))) (let ((_let_5 (not _let_4))) (let ((_let_6 (tptp.less_than tptp.q tptp.i))) (let ((_let_7 (not _let_6))) (let ((_let_8 (forall ((X $$unsorted)) (or (tptp.less_than X tptp.i) (not (tptp.less_than X tptp.j)) (not (tptp.less_than (tptp.a X) (tptp.a tptp.k))))))) (let ((_let_9 (tptp.a tptp.k))) (let ((_let_10 (tptp.less_than _let_1 _let_9))) (let ((_let_11 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y X)))))) (let ((_let_12 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.less_than X Y) (tptp.less_than Y X) (= X Y))))) (let ((_let_13 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.less_than X Z) (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)))))) (let ((_let_14 (tptp.less_than _let_1 _let_2))) (let ((_let_15 (= tptp.j tptp.q))) (let ((_let_16 (ASSUME :args (_let_3)))) (let ((_let_17 (not _let_14))) (let ((_let_18 (not _let_3))) (let ((_let_19 (or _let_18 _let_17))) (let ((_let_20 (_let_11))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (tptp.less_than tptp.q tptp.j))) (let ((_let_23 (or _let_4 _let_22 _let_15))) (let ((_let_24 (_let_12))) (let ((_let_25 (ASSUME :args _let_24))) (let ((_let_26 (tptp.less_than _let_2 _let_9))) (let ((_let_27 (not _let_26))) (let ((_let_28 (not _let_22))) (let ((_let_29 (or _let_6 _let_28 _let_27))) (let ((_let_30 (_let_8))) (let ((_let_31 (ASSUME :args _let_30))) (let ((_let_32 (not _let_10))) (let ((_let_33 (or _let_26 _let_18 _let_32))) (let ((_let_34 (_let_13))) (let ((_let_35 (ASSUME :args _let_34))) (let ((_let_36 (not _let_15))) (let ((_let_37 (ASSUME :args (_let_17)))) (let ((_let_38 (ASSUME :args (_let_15)))) (let ((_let_39 (CONG (SYMM (SYMM _let_38)) :args (APPLY_UF tptp.a)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_37 _let_38 _let_16) :args (_let_3 _let_15 _let_17)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO _let_16)) (CONG (SYMM _let_39) _let_39 :args (APPLY_UF tptp.less_than)) (FALSE_INTRO _let_37))) :args (_let_17 _let_15 _let_3)) :args ((not (and _let_3 _let_15 _let_17)) SB_LITERAL))) (CONG (REFL :args (_let_18)) (REFL :args (_let_36)) (MACRO_SR_PRED_INTRO :args ((= (not _let_17) _let_14))) :args (or))) :args ((or _let_18 _let_14 _let_36))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_23)) :args ((or _let_4 _let_22 _let_15 (not _let_23)))) (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_29)) :args ((or _let_6 _let_28 _let_27 (not _let_29)))) (ASSUME :args (_let_7)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_33)) :args ((or _let_32 _let_18 _let_26 (not _let_33)))) (ASSUME :args (_let_10)) _let_16 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (_let_2 _let_9 _let_1 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.less_than X Z) true)) (not (= (tptp.less_than X Y) false))))) :args _let_34)) _let_35 :args (_let_33 false _let_13)) :args (_let_26 false _let_10 false _let_3 false _let_33)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (tptp.q QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less_than X tptp.i) true))))) :args _let_30)) _let_31 :args (_let_29 false _let_8)) :args (_let_28 true _let_6 false _let_26 false _let_29)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_25 :args (tptp.j tptp.q QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less_than X Y) true))))) :args _let_24)) _let_25 :args (_let_23 false _let_12)) :args (_let_15 true _let_4 true _let_22 false _let_23)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_17 (not _let_19)))) _let_16 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (_let_2 _let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less_than X Y) false))))) :args _let_20)) _let_21 :args (_let_19 false _let_11)) :args (_let_17 false _let_3 false _let_19)) _let_16 :args (false false _let_15 true _let_14 false _let_3)) :args ((forall ((X $$unsorted)) (= (tptp.predecessor (tptp.successor X)) X)) (forall ((X $$unsorted)) (= (tptp.successor (tptp.predecessor X)) X)) (forall ((X $$unsorted) (Y $$unsorted)) (or (= X Y) (not (= (tptp.predecessor X) (tptp.predecessor Y))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (= X Y) (not (= (tptp.successor X) (tptp.successor Y))))) (forall ((X $$unsorted)) (tptp.less_than (tptp.predecessor X) X)) (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) _let_13 _let_12 (forall ((X $$unsorted)) (not (tptp.less_than X X))) _let_11 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (tptp.less_than Y Z) (not (= X Y)) (not (tptp.less_than X Z)))) (forall ((Z $$unsorted) (Y $$unsorted) (X $$unsorted)) (or (tptp.less_than Z Y) (not (= X Y)) (not (tptp.less_than Z X)))) (not (tptp.less_than tptp.n tptp.j)) (tptp.less_than tptp.k tptp.j) (not (tptp.less_than tptp.k tptp.i)) (tptp.less_than tptp.i tptp.n) _let_10 _let_8 (forall ((X $$unsorted)) (or (tptp.less_than X tptp.i) (tptp.less_than tptp.n X) (not (tptp.less_than tptp.one tptp.i)) (not (tptp.less_than (tptp.a X) (tptp.a (tptp.predecessor tptp.i)))))) (forall ((X $$unsorted)) (or (not (tptp.less_than tptp.one X)) (not (tptp.less_than X tptp.i)) (not (tptp.less_than (tptp.a X) (tptp.a (tptp.predecessor X)))))) _let_7 _let_5 _let_3))))))))))))))))))))))))))))))))))))))))))
% 0.21/0.55 )
% 0.21/0.55 % SZS output end Proof for SWV002-1
% 0.21/0.55 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------