TSTP Solution File: FLD070-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : FLD070-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n015.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 : Wed Aug 30 22:28:35 EDT 2023
% Result : Unsatisfiable 13.63s 13.99s
% Output : Proof 13.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : FLD070-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n015.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 : Mon Aug 28 00:48:55 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.f4XyuaZGVh/cvc5---1.0.5_5935.p...
% 0.21/0.51 ------- get file name : TPTP file name is FLD070-1
% 0.21/0.51 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_5935.smt2...
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.22/10.59 --- Run --no-e-matching --full-saturate-quant at 5...
% 13.63/13.99 % SZS status Unsatisfiable for FLD070-1
% 13.63/13.99 % SZS output start Proof for FLD070-1
% 13.63/13.99 (
% 13.63/13.99 (let ((_let_1 (tptp.add tptp.a tptp.b))) (let ((_let_2 (tptp.less_or_equal tptp.additive_identity _let_1))) (let ((_let_3 (not _let_2))) (let ((_let_4 (tptp.less_or_equal tptp.additive_identity tptp.b))) (let ((_let_5 (tptp.less_or_equal tptp.additive_identity tptp.a))) (let ((_let_6 (tptp.defined tptp.b))) (let ((_let_7 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (tptp.less_or_equal Y Z) (not (tptp.less_or_equal X Z)) (not (tptp.equalish X Y)))))) (let ((_let_8 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.less_or_equal (tptp.add X Z) (tptp.add Y Z)) (not (tptp.defined Z)) (not (tptp.less_or_equal X Y)))))) (let ((_let_9 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.less_or_equal X Z) (not (tptp.less_or_equal X Y)) (not (tptp.less_or_equal Y Z)))))) (let ((_let_10 (forall ((X $$unsorted)) (or (tptp.equalish (tptp.add tptp.additive_identity X) X) (not (tptp.defined X)))))) (let ((_let_11 (tptp.add tptp.additive_identity tptp.b))) (let ((_let_12 (tptp.equalish _let_11 tptp.b))) (let ((_let_13 (not _let_12))) (let ((_let_14 (tptp.less_or_equal _let_11 _let_1))) (let ((_let_15 (not _let_14))) (let ((_let_16 (tptp.less_or_equal tptp.b _let_1))) (let ((_let_17 (or _let_16 _let_15 _let_13))) (let ((_let_18 (_let_7))) (let ((_let_19 (ASSUME :args _let_18))) (let ((_let_20 (not _let_17))) (let ((_let_21 (not _let_5))) (let ((_let_22 (not _let_6))) (let ((_let_23 (or _let_14 _let_22 _let_21))) (let ((_let_24 (_let_8))) (let ((_let_25 (ASSUME :args _let_24))) (let ((_let_26 (ASSUME :args (_let_6)))) (let ((_let_27 (not _let_16))) (let ((_let_28 (not _let_4))) (let ((_let_29 (or _let_2 _let_28 _let_27))) (let ((_let_30 (_let_9))) (let ((_let_31 (ASSUME :args _let_30))) (let ((_let_32 (or _let_12 _let_22))) (let ((_let_33 (_let_10))) (let ((_let_34 (ASSUME :args _let_33))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_19 :args (tptp.b _let_1 _let_11 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_17)) :args ((or _let_13 _let_16 _let_15 _let_20))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_32)) :args ((or _let_22 _let_12 (not _let_32)))) _let_26 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_34 :args (tptp.b QUANTIFIERS_INST_ENUM)) :args _let_33)) _let_34 :args (_let_32 false _let_10)) :args (_let_12 false _let_6 false _let_32)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_29)) :args ((or _let_2 _let_28 _let_27 (not _let_29)))) (ASSUME :args (_let_3)) (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (tptp.additive_identity _let_1 tptp.b QUANTIFIERS_INST_ENUM)) :args _let_30)) _let_31 :args (_let_29 false _let_9)) :args (_let_27 true _let_2 false _let_4 false _let_29)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_23)) :args ((or _let_22 _let_21 _let_14 (not _let_23)))) _let_26 (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_25 :args (tptp.additive_identity tptp.b tptp.a QUANTIFIERS_INST_ENUM)) :args _let_24)) _let_25 :args (_let_23 false _let_8)) :args (_let_14 false _let_6 false _let_5 false _let_23)) :args (_let_20 false _let_12 true _let_16 false _let_14)) _let_19 :args (false true _let_17 false _let_7)) :args ((forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.equalish (tptp.add X (tptp.add Y Z)) (tptp.add (tptp.add X Y) Z)) (not (tptp.defined X)) (not (tptp.defined Y)) (not (tptp.defined Z)))) _let_10 (forall ((X $$unsorted)) (or (tptp.equalish (tptp.add X (tptp.additive_inverse X)) tptp.additive_identity) (not (tptp.defined X)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish (tptp.add X Y) (tptp.add Y X)) (not (tptp.defined X)) (not (tptp.defined Y)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.equalish (tptp.multiply X (tptp.multiply Y Z)) (tptp.multiply (tptp.multiply X Y) Z)) (not (tptp.defined X)) (not (tptp.defined Y)) (not (tptp.defined Z)))) (forall ((X $$unsorted)) (or (tptp.equalish (tptp.multiply tptp.multiplicative_identity X) X) (not (tptp.defined X)))) (forall ((X $$unsorted)) (or (tptp.equalish (tptp.multiply X (tptp.multiplicative_inverse X)) tptp.multiplicative_identity) (not (tptp.defined X)) (tptp.equalish X tptp.additive_identity))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish (tptp.multiply X Y) (tptp.multiply Y X)) (not (tptp.defined X)) (not (tptp.defined Y)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish (tptp.add (tptp.multiply X Z) (tptp.multiply Y Z)) (tptp.multiply (tptp.add X Y) Z)) (not (tptp.defined X)) (not (tptp.defined Y)) (not (tptp.defined Z)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.defined (tptp.add X Y)) (not (tptp.defined X)) (not (tptp.defined Y)))) (tptp.defined tptp.additive_identity) (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.defined (tptp.multiply X Y)) (not (tptp.defined X)) (not (tptp.defined Y)))) (tptp.defined tptp.multiplicative_identity) (forall ((X $$unsorted)) (or (tptp.defined (tptp.multiplicative_inverse X)) (not (tptp.defined X)) (tptp.equalish X tptp.additive_identity))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.less_or_equal X Y)) (not (tptp.less_or_equal Y X)))) _let_9 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.less_or_equal X Y) (tptp.less_or_equal Y X) (not (tptp.defined X)) (not (tptp.defined Y)))) _let_8 (forall ((Y $$unsorted) (Z $$unsorted)) (or (tptp.less_or_equal tptp.additive_identity (tptp.multiply Y Z)) (not (tptp.less_or_equal tptp.additive_identity Y)) (not (tptp.less_or_equal tptp.additive_identity Z)))) (forall ((X $$unsorted)) (or (tptp.equalish X X) (not (tptp.defined X)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.equalish Y X)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Z) (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish (tptp.add X Z) (tptp.add Y Z)) (not (tptp.defined Z)) (not (tptp.equalish X Y)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish (tptp.multiply X Z) (tptp.multiply Y Z)) (not (tptp.defined Z)) (not (tptp.equalish X Y)))) _let_7 (not (tptp.equalish tptp.additive_identity tptp.multiplicative_identity)) (tptp.defined tptp.a) _let_6 _let_5 _let_4 _let_3)))))))))))))))))))))))))))))))))))))
% 13.63/13.99 )
% 13.63/13.99 % SZS output end Proof for FLD070-1
% 13.63/13.99 % cvc5---1.0.5 exiting
% 13.63/13.99 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------