%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : FLD023-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:13 EDT 2023

% Result   : Unsatisfiable 1.73s 2.04s
% Output   : Proof 1.73s
% Verified : 
% SZS Type : -

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