%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n013.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 : Thu Aug 31 21:48:54 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n013.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   : Tue Aug 29 10:39:46 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.jWE4Jt1z7B/cvc5---1.0.5_22921.p...
% 0.20/0.50  ------- get file name : TPTP file name is SWV005-1
% 0.20/0.50  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_22921.smt2...
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53  % SZS status Unsatisfiable for SWV005-1
% 0.20/0.53  % SZS output start Proof for SWV005-1
% 0.20/0.53  (
% 0.20/0.53  (let ((_let_1 (forall ((X $$unsorted)) (or (tptp.less_than X tptp.l) (tptp.less_than tptp.n X) (not (tptp.less_than tptp.one tptp.l)) (not (tptp.less_than (tptp.a X) (tptp.a (tptp.predecessor tptp.l)))))))) (let ((_let_2 (tptp.less_than (tptp.a tptp.k) (tptp.a (tptp.predecessor tptp.l))))) (let ((_let_3 (tptp.less_than tptp.one tptp.l))) (let ((_let_4 (tptp.less_than tptp.k tptp.l))) (let ((_let_5 (not _let_4))) (let ((_let_6 (tptp.less_than tptp.n tptp.k))) (let ((_let_7 (not _let_6))) (let ((_let_8 (forall ((X $$unsorted)) (or (tptp.less_than X tptp.l) (tptp.less_than tptp.n X) (not (tptp.less_than (tptp.a X) (tptp.a (tptp.predecessor tptp.l)))))))) (let ((_let_9 (not _let_2))) (let ((_let_10 (or _let_4 _let_6 _let_9))) (let ((_let_11 (not _let_10))) (let ((_let_12 (_let_8))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_12) :args (tptp.k QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less_than X tptp.l) true))))) :args _let_12)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_10)) :args ((or _let_6 _let_4 _let_9 _let_11))) (ASSUME :args (_let_7)) (ASSUME :args (_let_5)) (ASSUME :args (_let_2)) :args (_let_11 true _let_6 true _let_4 false _let_2)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (ASSUME :args (_let_3)) :args (_let_8 false _let_3)) :args (false true _let_10 false _let_8)) :args ((forall ((X $$unsorted)) (= (tptp.predecessor (tptp.successor X)) X)) (forall ((X $$unsorted)) (= (tptp.successor (tptp.predecessor X)) X)) (forall ((X $$unsorted) (Y $$unsorted)) (or (= X Y) (not (= (tptp.predecessor X) (tptp.predecessor Y))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (= X Y) (not (= (tptp.successor X) (tptp.successor Y))))) (forall ((X $$unsorted)) (tptp.less_than (tptp.predecessor X) X)) (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.less_than X Z) (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.less_than X Y) (tptp.less_than Y X) (= X Y))) (forall ((X $$unsorted)) (not (tptp.less_than X X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y X)))) (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (tptp.less_than Y Z) (not (= X Y)) (not (tptp.less_than X Z)))) (forall ((Z $$unsorted) (Y $$unsorted) (X $$unsorted)) (or (tptp.less_than Z Y) (not (= X Y)) (not (tptp.less_than Z X)))) _let_7 _let_5 (not (tptp.less_than tptp.k tptp.i)) (tptp.less_than tptp.l tptp.n) _let_3 _let_2 (forall ((X $$unsorted)) (or (tptp.less_than X tptp.l) (not (tptp.less_than X (tptp.successor tptp.n))) (not (tptp.less_than (tptp.a X) (tptp.a tptp.k))))) _let_1 (forall ((X $$unsorted)) (or (not (tptp.less_than tptp.one X)) (not (tptp.less_than X tptp.l)) (not (tptp.less_than (tptp.a X) (tptp.a (tptp.predecessor X)))))))))))))))))))))
% 0.20/0.53  )
% 0.20/0.53  % SZS output end Proof for SWV005-1
% 0.20/0.54  % cvc5---1.0.5 exiting
% 0.20/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------