↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : ITP341_1 : TPTP v9.2.0. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n020.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 : Fri Oct  3 07:52:09 PM UTC 2025

% Result   : Theorem 3.79s 3.99s
% Output   : Proof 3.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ITP341_1 : TPTP v9.2.0. Released v8.0.0.
% 0.13/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n020.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   : Thu Oct  2 23:06:23 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.79/3.99  SZS status Theorem for theBenchmark.p
% 3.79/3.99  SZS output start Proof for theBenchmark.p
% 3.79/3.99  Clause #3 (by assumption #[]): Eq (Not (Eq («matrix_matrix_mult$» («matrix_inv$» «p$») («mat$» «one$»)) («matrix_inv$» «p$»))) True
% 3.79/3.99  Clause #7 (by assumption #[]): Eq (Eq «a$» («matrix_matrix_mult$» («matrix_inv$» «p$») («mat$» «one$»))) True
% 3.79/3.99  Clause #9 (by assumption #[]): Eq
% 3.79/3.99    (∀ (A__questionmark_v0 : «A_n_vec_n_vec$»),
% 3.79/3.99      Eq («matrix_matrix_mult$» A__questionmark_v0 («mat$» «one$»)) A__questionmark_v0)
% 3.79/3.99    True
% 3.79/3.99  Clause #452 (by clausification #[3]): Eq (Eq («matrix_matrix_mult$» («matrix_inv$» «p$») («mat$» «one$»)) («matrix_inv$» «p$»)) False
% 3.79/3.99  Clause #453 (by clausification #[452]): Ne («matrix_matrix_mult$» («matrix_inv$» «p$») («mat$» «one$»)) («matrix_inv$» «p$»)
% 3.79/3.99  Clause #558 (by clausification #[7]): Eq «a$» («matrix_matrix_mult$» («matrix_inv$» «p$») («mat$» «one$»))
% 3.79/3.99  Clause #559 (by backward demodulation #[558, 453]): Ne «a$» («matrix_inv$» «p$»)
% 3.79/3.99  Clause #583 (by clausification #[9]): ∀ (a : «A_n_vec_n_vec$»), Eq (Eq («matrix_matrix_mult$» a («mat$» «one$»)) a) True
% 3.79/3.99  Clause #584 (by clausification #[583]): ∀ (a : «A_n_vec_n_vec$»), Eq («matrix_matrix_mult$» a («mat$» «one$»)) a
% 3.79/3.99  Clause #585 (by superposition #[584, 558]): Eq «a$» («matrix_inv$» «p$»)
% 3.79/3.99  Clause #586 (by forward contextual literal cutting #[585, 559]): False
% 3.79/3.99  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------