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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : NUM025-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n009.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 10:42:02 EDT 2023

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM025-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.07/0.13  % Command    : do_cvc5 %s %d
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Aug 25 09:17:50 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.21/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.48  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.JzKwT0JzHp/cvc5---1.0.5_21183.p...
% 0.21/0.49  ------- get file name : TPTP file name is NUM025-1
% 0.21/0.49  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_21183.smt2...
% 0.21/0.49  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52  % SZS status Unsatisfiable for NUM025-1
% 0.21/0.52  % SZS output start Proof for NUM025-1
% 0.21/0.52  (
% 0.21/0.52  (let ((_let_1 (tptp.less tptp.b tptp.a))) (let ((_let_2 (tptp.less tptp.a tptp.b))) (let ((_let_3 (forall ((A $$unsorted)) (not (tptp.less A A))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.less A B)) (not (tptp.less C A)) (tptp.less C B))))) (let ((_let_5 (tptp.less tptp.a tptp.a))) (let ((_let_6 (_let_3))) (let ((_let_7 (ASSUME :args _let_6))) (let ((_let_8 (not _let_2))) (let ((_let_9 (not _let_1))) (let ((_let_10 (or _let_9 _let_8 _let_5))) (let ((_let_11 (_let_4))) (let ((_let_12 (ASSUME :args _let_11))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_7 :args (tptp.a QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.less A A) false))))) :args _let_6)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_10)) :args ((or _let_8 _let_9 _let_5 (not _let_10)))) (ASSUME :args (_let_2)) (ASSUME :args (_let_1)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (tptp.b tptp.a tptp.a QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.less A B) false)) (not (= (tptp.less C A) false))))) :args _let_11)) _let_12 :args (_let_10 false _let_4)) :args (_let_5 false _let_2 false _let_1 false _let_10)) _let_7 :args (false false _let_5 false _let_3)) :args ((forall ((A $$unsorted)) (tptp.equalish (tptp.add A tptp.n0) A)) (forall ((A $$unsorted) (B $$unsorted)) (tptp.equalish (tptp.add A (tptp.successor B)) (tptp.successor (tptp.add A B)))) (forall ((A $$unsorted)) (tptp.equalish (tptp.multiply A tptp.n0) tptp.n0)) (forall ((A $$unsorted) (B $$unsorted)) (tptp.equalish (tptp.multiply A (tptp.successor B)) (tptp.add (tptp.multiply A B) A))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.equalish (tptp.successor A) (tptp.successor B))) (tptp.equalish A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.equalish A B)) (tptp.equalish (tptp.successor A) (tptp.successor B)))) _let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.equalish (tptp.add (tptp.successor A) B) C)) (tptp.less B C))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.less A B)) (tptp.equalish (tptp.add (tptp.successor (tptp.predecessor_of_1st_minus_2nd B A)) A) B))) (forall ((X $$unsorted)) (tptp.equalish X X)) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.equalish X Y)) (tptp.equalish Y X))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equalish X Y)) (not (tptp.equalish Y Z)) (tptp.equalish X Z))) (forall ((A $$unsorted)) (not (tptp.equalish (tptp.successor A) tptp.n0))) _let_3 _let_2 _let_1)))))))))))))))
% 0.21/0.52  )
% 0.21/0.52  % SZS output end Proof for NUM025-1
% 0.21/0.52  % cvc5---1.0.5 exiting
% 0.21/0.52  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------