TSTP Solution File: KLE001+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : KLE001+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n018.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 05:26:45 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE001+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n018.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 12:27:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.np1siOcp7X/cvc5---1.0.5_27980.p...
% 0.20/0.52 ------- get file name : TPTP file name is KLE001+1
% 0.20/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_27980.smt2...
% 0.20/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Theorem for KLE001+1
% 0.20/0.52 % SZS output start Proof for KLE001+1
% 0.20/0.52 (
% 0.20/0.52 (let ((_let_1 (not (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (let ((_let_1 (tptp.addition X0 X2))) (=> (tptp.leq X0 X1) (tptp.leq _let_1 _let_1))))))) (let ((_let_2 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.leq A B) (= (tptp.addition A B) B))))) (let ((_let_3 (forall ((A $$unsorted)) (= (tptp.addition A A) A)))) (let ((_let_4 (forall ((A $$unsorted)) (= A (tptp.addition A A))))) (let ((_let_5 (tptp.addition SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_6 (= _let_5 (tptp.addition _let_5 _let_5)))) (let ((_let_7 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_8 (tptp.leq _let_5 _let_5))) (let ((_let_9 (= _let_8 _let_6))) (let ((_let_10 (not _let_6))) (let ((_let_11 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.leq A B) (= B (tptp.addition A B)))))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_13 (or (not (tptp.leq SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3)) _let_8))) (let ((_let_14 (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (let ((_let_1 (tptp.addition X0 X2))) (or (not (tptp.leq X0 X1)) (tptp.leq _let_1 _let_1)))))) (let ((_let_15 (not _let_13))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_17 (not _let_14))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_7 :args (_let_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.addition A A)))) :args (_let_4))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_9)) :args ((or _let_8 _let_10 (not _let_9)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_13 1)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_16) :args (_let_17))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_17) _let_14))) (REFL :args (_let_15)) :args (or))) _let_16 :args (_let_15 true _let_14)) :args ((not _let_8) true _let_13)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (_let_5 _let_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.leq A B)))) :args (_let_11))) _let_12 :args (_let_9 false _let_11)) :args (_let_10 true _let_8 false _let_9)) _let_7 :args (false true _let_6 false _let_4)) :args ((forall ((A $$unsorted) (B $$unsorted)) (= (tptp.addition A B) (tptp.addition B A))) (forall ((C $$unsorted) (B $$unsorted) (A $$unsorted)) (= (tptp.addition A (tptp.addition B C)) (tptp.addition (tptp.addition A B) C))) (forall ((A $$unsorted)) (= (tptp.addition A tptp.zero) A)) _let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.multiplication A (tptp.multiplication B C)) (tptp.multiplication (tptp.multiplication A B) C))) (forall ((A $$unsorted)) (= (tptp.multiplication A tptp.one) A)) (forall ((A $$unsorted)) (= (tptp.multiplication tptp.one A) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.multiplication A (tptp.addition B C)) (tptp.addition (tptp.multiplication A B) (tptp.multiplication A C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.multiplication (tptp.addition A B) C) (tptp.addition (tptp.multiplication A C) (tptp.multiplication B C)))) (forall ((A $$unsorted)) (= (tptp.multiplication A tptp.zero) tptp.zero)) (forall ((A $$unsorted)) (= (tptp.multiplication tptp.zero A) tptp.zero)) _let_2 _let_1 true))))))))))))))))))))
% 0.20/0.52 )
% 0.20/0.52 % SZS output end Proof for KLE001+1
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------