TSTP Solution File: FLD006-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : FLD006-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n010.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:05 EDT 2023
% Result : Unsatisfiable 0.96s 1.15s
% Output : Proof 0.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD006-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n010.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 : Sun Aug 27 23:45:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.48 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.iYHRgoaImh/cvc5---1.0.5_823.p...
% 0.21/0.49 ------- get file name : TPTP file name is FLD006-1
% 0.21/0.49 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_823.smt2...
% 0.21/0.49 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.96/1.15 % SZS status Unsatisfiable for FLD006-1
% 0.96/1.15 % SZS output start Proof for FLD006-1
% 0.96/1.15 (
% 0.96/1.15 (let ((_let_1 (tptp.additive_inverse tptp.additive_identity))) (let ((_let_2 (tptp.equalish _let_1 tptp.additive_identity))) (let ((_let_3 (not _let_2))) (let ((_let_4 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Z) (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)))))) (let ((_let_5 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.equalish Y X)))))) (let ((_let_6 (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))))) (let ((_let_7 (tptp.defined tptp.additive_identity))) (let ((_let_8 (forall ((X $$unsorted)) (or (tptp.equalish (tptp.add X (tptp.additive_inverse X)) tptp.additive_identity) (not (tptp.defined X)))))) (let ((_let_9 (forall ((X $$unsorted)) (or (tptp.equalish (tptp.add tptp.additive_identity X) X) (not (tptp.defined X)))))) (let ((_let_10 (tptp.add tptp.additive_identity _let_1))) (let ((_let_11 (tptp.equalish _let_10 tptp.additive_identity))) (let ((_let_12 (not _let_11))) (let ((_let_13 (tptp.equalish _let_1 _let_10))) (let ((_let_14 (not _let_13))) (let ((_let_15 (or _let_2 _let_14 _let_12))) (let ((_let_16 (_let_4))) (let ((_let_17 (ASSUME :args _let_16))) (let ((_let_18 (not _let_15))) (let ((_let_19 (tptp.equalish _let_10 _let_1))) (let ((_let_20 (not _let_19))) (let ((_let_21 (or _let_13 _let_20))) (let ((_let_22 (_let_5))) (let ((_let_23 (ASSUME :args _let_22))) (let ((_let_24 (tptp.defined _let_1))) (let ((_let_25 (not _let_24))) (let ((_let_26 (or _let_19 _let_25))) (let ((_let_27 (_let_9))) (let ((_let_28 (ASSUME :args _let_27))) (let ((_let_29 (not _let_7))) (let ((_let_30 (or _let_24 _let_29))) (let ((_let_31 (_let_6))) (let ((_let_32 (ASSUME :args _let_31))) (let ((_let_33 (ASSUME :args (_let_7)))) (let ((_let_34 (or _let_11 _let_29))) (let ((_let_35 (_let_8))) (let ((_let_36 (ASSUME :args _let_35))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (_let_1 tptp.additive_identity _let_10 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.equalish X Z) true)) (not (= (tptp.equalish X Y) false))))) :args _let_16)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_15)) :args ((or _let_2 _let_12 _let_14 _let_18))) (ASSUME :args (_let_3)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_34)) :args ((or _let_29 _let_11 (not _let_34)))) _let_33 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_36 :args (tptp.additive_identity QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.additive_inverse X)))) :args _let_35)) _let_36 :args (_let_34 false _let_8)) :args (_let_11 false _let_7 false _let_34)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_21)) :args ((or _let_20 _let_13 (not _let_21)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_25 _let_19 (not _let_26)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_30)) :args ((or _let_29 _let_24 (not _let_30)))) _let_33 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_32 :args (tptp.additive_identity QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.additive_inverse X)))) :args _let_31)) _let_32 :args (_let_30 false _let_6)) :args (_let_24 false _let_7 false _let_30)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (_let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.add tptp.additive_identity X)))) :args _let_27)) _let_28 :args (_let_26 false _let_9)) :args (_let_19 false _let_24 false _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (_let_1 _let_10 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.equalish Y X) false))))) :args _let_22)) _let_23 :args (_let_21 false _let_5)) :args (_let_13 false _let_19 false _let_21)) :args (_let_18 true _let_2 false _let_11 false _let_13)) _let_17 :args (false true _let_15 false _let_4)) :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_9 _let_8 (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)))) _let_7 _let_6 (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)))) (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_5 _let_4 (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)))) (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_3)))))))))))))))))))))))))))))))))))))))
% 0.96/1.15 )
% 0.96/1.16 % SZS output end Proof for FLD006-1
% 0.96/1.16 % cvc5---1.0.5 exiting
% 0.96/1.16 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------