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

View Problem - Process Solution

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

% Computer : n032.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:10 EDT 2023

% Result   : Unsatisfiable 0.60s 0.79s
% Output   : Proof 0.60s
% Verified : 
% SZS Type : -

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