TSTP Solution File: FLD058-1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : FLD058-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n019.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:29 EDT 2023

% Result   : Unsatisfiable 0.15s 0.47s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : FLD058-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10  % Command    : do_cvc5 %s %d
% 0.13/0.30  % Computer : n019.cluster.edu
% 0.13/0.30  % Model    : x86_64 x86_64
% 0.13/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.30  % Memory   : 8042.1875MB
% 0.13/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.30  % CPULimit   : 300
% 0.13/0.30  % WCLimit    : 300
% 0.13/0.30  % DateTime   : Sun Aug 27 23:12:28 EDT 2023
% 0.13/0.30  % CPUTime    : 
% 0.15/0.40  %----Proving TF0_NAR, FOF, or CNF
% 0.15/0.40  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.k45y4JDCwc/cvc5---1.0.5_25767.p...
% 0.15/0.41  ------- get file name : TPTP file name is FLD058-1
% 0.15/0.41  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_25767.smt2...
% 0.15/0.41  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.15/0.47  % SZS status Unsatisfiable for FLD058-1
% 0.15/0.47  % SZS output start Proof for FLD058-1
% 0.15/0.48  (
% 0.15/0.48  (let ((_let_1 (tptp.equalish tptp.b tptp.additive_identity))) (let ((_let_2 (tptp.equalish tptp.a tptp.additive_identity))) (let ((_let_3 (not _let_2))) (let ((_let_4 (tptp.less_or_equal tptp.a tptp.b))) (let ((_let_5 (tptp.less_or_equal tptp.additive_identity tptp.a))) (let ((_let_6 (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_7 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Z) (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)))))) (let ((_let_8 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.equalish Y X)))))) (let ((_let_9 (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 ((_let_10 (not _let_1))) (let ((_let_11 (tptp.equalish tptp.a tptp.b))) (let ((_let_12 (not _let_11))) (let ((_let_13 (or _let_2 _let_12 _let_10))) (let ((_let_14 (_let_7))) (let ((_let_15 (ASSUME :args _let_14))) (let ((_let_16 (not _let_13))) (let ((_let_17 (tptp.less_or_equal tptp.b tptp.a))) (let ((_let_18 (not _let_17))) (let ((_let_19 (not _let_4))) (let ((_let_20 (or _let_11 _let_19 _let_18))) (let ((_let_21 (_let_9))) (let ((_let_22 (ASSUME :args _let_21))) (let ((_let_23 (tptp.equalish tptp.additive_identity tptp.b))) (let ((_let_24 (not _let_23))) (let ((_let_25 (not _let_5))) (let ((_let_26 (or _let_17 _let_25 _let_24))) (let ((_let_27 (_let_6))) (let ((_let_28 (ASSUME :args _let_27))) (let ((_let_29 (or _let_23 _let_10))) (let ((_let_30 (_let_8))) (let ((_let_31 (ASSUME :args _let_30))) (let ((_let_32 (ASSUME :args (_let_1)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_15 :args (tptp.a tptp.additive_identity tptp.b QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.equalish X Z) true)) (not (= (tptp.equalish X Y) false))))) :args _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_13)) :args ((or _let_2 _let_10 _let_12 _let_16))) (ASSUME :args (_let_3)) _let_32 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_20)) :args ((or _let_19 _let_11 _let_18 (not _let_20)))) (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_25 _let_17 _let_24 (not _let_26)))) (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_29)) :args ((or _let_10 _let_23 (not _let_29)))) _let_32 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (tptp.additive_identity tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.equalish Y X) false))))) :args _let_30)) _let_31 :args (_let_29 false _let_8)) :args (_let_23 false _let_1 false _let_29)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (tptp.b tptp.a tptp.additive_identity QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.less_or_equal Y Z) true)) (not (= (tptp.less_or_equal X Z) false))))) :args _let_27)) _let_28 :args (_let_26 false _let_6)) :args (_let_17 false _let_5 false _let_23 false _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_22 :args (tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less_or_equal X Y) false))))) :args _let_21)) _let_22 :args (_let_20 false _let_9)) :args (_let_11 false _let_4 false _let_17 false _let_20)) :args (_let_16 true _let_2 false _let_1 false _let_11)) _let_15 :args (false true _let_13 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)))) (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)))) (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))) _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)))) (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_8 _let_7 (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_6 (not (tptp.equalish tptp.additive_identity tptp.multiplicative_identity)) (tptp.defined tptp.a) (tptp.defined tptp.b) _let_5 _let_4 _let_3 _let_1)))))))))))))))))))))))))))))))))))
% 0.15/0.48  )
% 0.15/0.48  % SZS output end Proof for FLD058-1
% 0.15/0.48  % cvc5---1.0.5 exiting
% 0.15/0.48  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------