%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM300+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n010.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:55:11 EDT 2023

% Result   : Theorem 15.31s 15.47s
% Output   : Proof 15.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : NUM300+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n010.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri Aug 25 15:16:35 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 15.31/15.47  SZS status Theorem for theBenchmark.p
% 15.31/15.47  SZS output start Proof for theBenchmark.p
% 15.31/15.47  Clause #0 (by assumption #[]): Eq (rdn_translate n0 (rdn_pos (rdnn n0))) True
% 15.31/15.47  Clause #133 (by assumption #[]): Eq (rdn_translate nn6 (rdn_neg (rdnn n6))) True
% 15.31/15.47  Clause #281 (by assumption #[]): Eq (∀ (X Y RDN_X RDN_Y : Iota), And (rdn_translate X (rdn_neg RDN_X)) (rdn_translate Y (rdn_pos RDN_Y)) → less X Y) True
% 15.31/15.47  Clause #401 (by assumption #[]): Eq (Not (Exists fun X => less X n0)) True
% 15.31/15.47  Clause #427 (by clausification #[401]): Eq (Exists fun X => less X n0) False
% 15.31/15.47  Clause #428 (by clausification #[427]): ∀ (a : Iota), Eq (less a n0) False
% 15.31/15.47  Clause #445 (by clausification #[281]): ∀ (a : Iota),
% 15.31/15.47    Eq (∀ (Y RDN_X RDN_Y : Iota), And (rdn_translate a (rdn_neg RDN_X)) (rdn_translate Y (rdn_pos RDN_Y)) → less a Y) True
% 15.31/15.47  Clause #446 (by clausification #[445]): ∀ (a a_1 : Iota),
% 15.31/15.47    Eq (∀ (RDN_X RDN_Y : Iota), And (rdn_translate a (rdn_neg RDN_X)) (rdn_translate a_1 (rdn_pos RDN_Y)) → less a a_1)
% 15.31/15.47      True
% 15.31/15.47  Clause #447 (by clausification #[446]): ∀ (a a_1 a_2 : Iota),
% 15.31/15.47    Eq (∀ (RDN_Y : Iota), And (rdn_translate a (rdn_neg a_1)) (rdn_translate a_2 (rdn_pos RDN_Y)) → less a a_2) True
% 15.31/15.47  Clause #448 (by clausification #[447]): ∀ (a a_1 a_2 a_3 : Iota), Eq (And (rdn_translate a (rdn_neg a_1)) (rdn_translate a_2 (rdn_pos a_3)) → less a a_2) True
% 15.31/15.47  Clause #449 (by clausification #[448]): ∀ (a a_1 a_2 a_3 : Iota),
% 15.31/15.47    Or (Eq (And (rdn_translate a (rdn_neg a_1)) (rdn_translate a_2 (rdn_pos a_3))) False) (Eq (less a a_2) True)
% 15.31/15.47  Clause #450 (by clausification #[449]): ∀ (a a_1 a_2 a_3 : Iota),
% 15.31/15.47    Or (Eq (less a a_1) True) (Or (Eq (rdn_translate a (rdn_neg a_2)) False) (Eq (rdn_translate a_1 (rdn_pos a_3)) False))
% 15.31/15.47  Clause #454 (by superposition #[450, 133]): ∀ (a a_1 : Iota), Or (Eq (less nn6 a) True) (Or (Eq (rdn_translate a (rdn_pos a_1)) False) (Eq False True))
% 15.31/15.47  Clause #763 (by clausification #[454]): ∀ (a a_1 : Iota), Or (Eq (less nn6 a) True) (Eq (rdn_translate a (rdn_pos a_1)) False)
% 15.31/15.47  Clause #764 (by superposition #[763, 0]): Or (Eq (less nn6 n0) True) (Eq False True)
% 15.31/15.47  Clause #1011 (by clausification #[764]): Eq (less nn6 n0) True
% 15.31/15.47  Clause #1012 (by superposition #[1011, 428]): Eq True False
% 15.31/15.47  Clause #1013 (by clausification #[1012]): False
% 15.31/15.47  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------