TSTP Solution File: RNG011-5 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n012.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 13:49:28 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.12/0.12  % Problem    : RNG011-5 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun Aug 27 02:51:25 EDT 2023
% 0.14/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.s0zAqagJ32/cvc5---1.0.5_15974.p...
% 0.20/0.50  ------- get file name : TPTP file name is RNG011-5
% 0.20/0.51  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15974.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 RNG011-5
% 0.20/0.53  % SZS output start Proof for RNG011-5
% 0.20/0.53  (
% 0.20/0.53  (let ((_let_1 (tptp.associator tptp.a tptp.a tptp.b))) (let ((_let_2 (tptp.multiply (tptp.multiply _let_1 tptp.a) _let_1))) (let ((_let_3 (not (= _let_2 tptp.additive_identity)))) (let ((_let_4 (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.associator X X Y))) (= (tptp.multiply (tptp.multiply _let_1 X) _let_1) tptp.additive_identity))))) (let ((_let_5 (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.associator X X Y))) (= tptp.additive_identity (tptp.multiply (tptp.multiply _let_1 X) _let_1)))))) (let ((_let_6 (= tptp.additive_identity _let_2))) (let ((_let_7 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_7 :args (tptp.a tptp.b QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.associator X X Y)))) :args (_let_5))) :args ((or _let_6 (not _let_5)))) (SYMM (ASSUME :args (_let_3))) _let_7 :args (false true _let_6 false _let_5)) :args ((forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.add X Y) (tptp.add Y X))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.add (tptp.add X Y) Z) (tptp.add X (tptp.add Y Z)))) (forall ((X $$unsorted)) (= (tptp.add X tptp.additive_identity) X)) (forall ((X $$unsorted)) (= (tptp.add tptp.additive_identity X) X)) (forall ((X $$unsorted)) (= (tptp.add X (tptp.additive_inverse X)) tptp.additive_identity)) (forall ((X $$unsorted)) (= (tptp.add (tptp.additive_inverse X) X) tptp.additive_identity)) (= (tptp.additive_inverse tptp.additive_identity) tptp.additive_identity) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.add X (tptp.add (tptp.additive_inverse X) Y)) Y)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.additive_inverse (tptp.add X Y)) (tptp.add (tptp.additive_inverse X) (tptp.additive_inverse Y)))) (forall ((X $$unsorted)) (= (tptp.additive_inverse (tptp.additive_inverse X)) X)) (forall ((X $$unsorted)) (= (tptp.multiply X tptp.additive_identity) tptp.additive_identity)) (forall ((X $$unsorted)) (= (tptp.multiply tptp.additive_identity X) tptp.additive_identity)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.multiply (tptp.additive_inverse X) (tptp.additive_inverse Y)) (tptp.multiply X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.multiply X (tptp.additive_inverse Y)) (tptp.additive_inverse (tptp.multiply X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.multiply (tptp.additive_inverse X) Y) (tptp.additive_inverse (tptp.multiply X Y)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply X (tptp.add Y Z)) (tptp.add (tptp.multiply X Y) (tptp.multiply X Z)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply (tptp.add X Y) Z) (tptp.add (tptp.multiply X Z) (tptp.multiply Y Z)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.multiply (tptp.multiply X Y) Y) (tptp.multiply X (tptp.multiply Y Y)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.associator X Y Z) (tptp.add (tptp.multiply (tptp.multiply X Y) Z) (tptp.additive_inverse (tptp.multiply X (tptp.multiply Y Z)))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.commutator X Y) (tptp.add (tptp.multiply Y X) (tptp.additive_inverse (tptp.multiply X Y))))) _let_4 _let_3))))))))))
% 0.20/0.53  )
% 0.20/0.53  % SZS output end Proof for RNG011-5
% 0.20/0.54  % cvc5---1.0.5 exiting
% 0.20/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------