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

% Computer : n004.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:36 EDT 2023

% Result   : Unsatisfiable 0.20s 0.54s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : FLD071-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun Aug 27 23:24:37 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.bslnKRoFkj/cvc5---1.0.5_15787.p...
% 0.20/0.51  ------- get file name : TPTP file name is FLD071-1
% 0.20/0.51  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15787.smt2...
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.54  % SZS status Unsatisfiable for FLD071-1
% 0.20/0.54  % SZS output start Proof for FLD071-1
% 0.20/0.54  (
% 0.20/0.54  (let ((_let_1 (tptp.less_or_equal tptp.additive_identity (tptp.multiply tptp.a tptp.b)))) (let ((_let_2 (not _let_1))) (let ((_let_3 (tptp.less_or_equal tptp.additive_identity tptp.b))) (let ((_let_4 (tptp.less_or_equal tptp.additive_identity tptp.a))) (let ((_let_5 (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)))))) (let ((_let_6 (not _let_3))) (let ((_let_7 (not _let_4))) (let ((_let_8 (or _let_1 _let_7 _let_6))) (let ((_let_9 (_let_5))) (let ((_let_10 (ASSUME :args _let_9))) (let ((_let_11 (not _let_8))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_10 :args (tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.multiply Y Z)))) :args _let_9)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_8)) :args ((or _let_1 _let_7 _let_6 _let_11))) (ASSUME :args (_let_2)) (ASSUME :args (_let_4)) (ASSUME :args (_let_3)) :args (_let_11 true _let_1 false _let_4 false _let_3)) _let_10 :args (false true _let_8 false _let_5)) :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)))) _let_5 (forall ((X $$unsorted)) (or (tptp.equalish X X) (not (tptp.defined X)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Y) (not (tptp.equalish Y X)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.equalish X Z) (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)))) (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)) (tptp.defined tptp.a) (tptp.defined tptp.b) _let_4 _let_3 _let_2))))))))))))))
% 0.20/0.54  )
% 0.20/0.55  % SZS output end Proof for FLD071-1
% 0.20/0.55  % cvc5---1.0.5 exiting
% 0.20/0.55  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------