TSTP Solution File: FLD037-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n007.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:19 EDT 2023
% Result : Unsatisfiable 1.92s 2.11s
% Output : Proof 1.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun Aug 27 23:15:43 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.51 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.2CXJAfcTqn/cvc5---1.0.5_2164.p...
% 0.22/0.51 ------- get file name : TPTP file name is FLD037-1
% 0.22/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_2164.smt2...
% 0.22/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.92/2.11 % SZS status Unsatisfiable for FLD037-1
% 1.92/2.11 % SZS output start Proof for FLD037-1
% 1.92/2.11 (
% 1.92/2.11 (let ((_let_1 (tptp.multiplicative_inverse tptp.a))) (let ((_let_2 (tptp.multiply tptp.b _let_1))) (let ((_let_3 (tptp.equalish tptp.multiplicative_identity _let_2))) (let ((_let_4 (not _let_3))) (let ((_let_5 (tptp.equalish tptp.a tptp.b))) (let ((_let_6 (tptp.equalish tptp.a tptp.additive_identity))) (let ((_let_7 (not _let_6))) (let ((_let_8 (tptp.defined tptp.a))) (let ((_let_9 (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 ((_let_10 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Z) (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)))))) (let ((_let_11 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.equalish Y X)))))) (let ((_let_12 (forall ((X $$unsorted)) (or (tptp.defined (tptp.multiplicative_inverse X)) (not (tptp.defined X)) (tptp.equalish X tptp.additive_identity))))) (let ((_let_13 (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))))) (let ((_let_14 (tptp.multiply tptp.a _let_1))) (let ((_let_15 (tptp.equalish _let_14 _let_2))) (let ((_let_16 (not _let_15))) (let ((_let_17 (tptp.equalish tptp.multiplicative_identity _let_14))) (let ((_let_18 (not _let_17))) (let ((_let_19 (or _let_3 _let_18 _let_16))) (let ((_let_20 (_let_10))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (not _let_19))) (let ((_let_23 (not _let_5))) (let ((_let_24 (tptp.defined _let_1))) (let ((_let_25 (not _let_24))) (let ((_let_26 (or _let_15 _let_25 _let_23))) (let ((_let_27 (_let_9))) (let ((_let_28 (ASSUME :args _let_27))) (let ((_let_29 (not _let_8))) (let ((_let_30 (or _let_24 _let_29 _let_6))) (let ((_let_31 (_let_12))) (let ((_let_32 (ASSUME :args _let_31))) (let ((_let_33 (ASSUME :args (_let_8)))) (let ((_let_34 (ASSUME :args (_let_7)))) (let ((_let_35 (tptp.equalish _let_14 tptp.multiplicative_identity))) (let ((_let_36 (not _let_35))) (let ((_let_37 (or _let_17 _let_36))) (let ((_let_38 (_let_11))) (let ((_let_39 (ASSUME :args _let_38))) (let ((_let_40 (or _let_35 _let_29 _let_6))) (let ((_let_41 (_let_13))) (let ((_let_42 (ASSUME :args _let_41))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.multiplicative_identity _let_2 _let_14 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.equalish X Z) true)) (not (= (tptp.equalish X Y) false))))) :args _let_20)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_3 _let_18 _let_16 _let_22))) (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_37)) :args ((or _let_36 _let_17 (not _let_37)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_40)) :args ((or _let_6 _let_29 _let_35 (not _let_40)))) _let_34 _let_33 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_42 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.multiplicative_inverse X)))) :args _let_41)) _let_42 :args (_let_40 false _let_13)) :args (_let_35 true _let_6 false _let_8 false _let_40)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_39 :args (tptp.multiplicative_identity _let_14 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.equalish Y X) false))))) :args _let_38)) _let_39 :args (_let_37 false _let_11)) :args (_let_17 false _let_35 false _let_37)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_23 _let_25 _let_15 (not _let_26)))) (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_30)) :args ((or _let_6 _let_29 _let_24 (not _let_30)))) _let_34 _let_33 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_32 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.multiplicative_inverse X)))) :args _let_31)) _let_32 :args (_let_30 false _let_12)) :args (_let_24 true _let_6 false _let_8 false _let_30)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (tptp.a _let_1 tptp.b QUANTIFIERS_INST_E_MATCHING ((tptp.multiply Y Z) (tptp.multiply X Z)))) :args _let_27)) _let_28 :args (_let_26 false _let_9)) :args (_let_15 false _let_5 false _let_24 false _let_26)) :args (_let_22 true _let_3 false _let_17 false _let_15)) _let_21 :args (false true _let_19 false _let_10)) :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)))) (forall ((X $$unsorted)) (or (tptp.equalish (tptp.add tptp.additive_identity X) X) (not (tptp.defined X)))) (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)))) _let_13 (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) _let_12 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.less_or_equal X Y)) (not (tptp.less_or_equal Y X)))) (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)))) (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)))) (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)))) (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)))) _let_11 _let_10 (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)))) _let_9 (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)))) (not (tptp.equalish tptp.additive_identity tptp.multiplicative_identity)) _let_8 (tptp.defined tptp.b) _let_7 _let_5 _let_4)))))))))))))))))))))))))))))))))))))))))))))
% 1.92/2.11 )
% 1.92/2.12 % SZS output end Proof for FLD037-1
% 1.92/2.12 % cvc5---1.0.5 exiting
% 1.92/2.12 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------