%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM967_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n022.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:58:27 EDT 2023

% Result   : Theorem 3.89s 4.25s
% Output   : Proof 3.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM967_5 : TPTP v8.1.2. Released v6.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n022.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 16:27:25 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.89/4.25  SZS status Theorem for theBenchmark.p
% 3.89/4.25  SZS output start Proof for theBenchmark.p
% 3.89/4.25  Clause #0 (by assumption #[]): Eq (Not (ord_less_eq int (one_one int) t)) True
% 3.89/4.25  Clause #42 (by assumption #[]): Eq (∀ (A : Type), linorder A → ∀ (Y X3 : A), Not (ord_less A X3 Y) → ord_less_eq A Y X3) True
% 3.89/4.25  Clause #99 (by assumption #[]): Eq (linorder int) True
% 3.89/4.25  Clause #110 (by assumption #[]): Eq (Not (ord_less int t (one_one int))) True
% 3.89/4.25  Clause #111 (by clausification #[0]): Eq (ord_less_eq int (one_one int) t) False
% 3.89/4.25  Clause #123 (by clausification #[110]): Eq (ord_less int t (one_one int)) False
% 3.89/4.25  Clause #312 (by clausification #[42]): ∀ (a : Type), Eq (linorder a → ∀ (Y X3 : a), Not (ord_less a X3 Y) → ord_less_eq a Y X3) True
% 3.89/4.25  Clause #313 (by clausification #[312]): ∀ (a : Type), Or (Eq (linorder a) False) (Eq (∀ (Y X3 : a), Not (ord_less a X3 Y) → ord_less_eq a Y X3) True)
% 3.89/4.25  Clause #314 (by clausification #[313]): ∀ (a : Type) (a_1 : a),
% 3.89/4.25    Or (Eq (linorder a) False) (Eq (∀ (X3 : a), Not (ord_less a X3 a_1) → ord_less_eq a a_1 X3) True)
% 3.89/4.25  Clause #315 (by clausification #[314]): ∀ (a : Type) (a_1 a_2 : a), Or (Eq (linorder a) False) (Eq (Not (ord_less a a_1 a_2) → ord_less_eq a a_2 a_1) True)
% 3.89/4.25  Clause #316 (by clausification #[315]): ∀ (a : Type) (a_1 a_2 : a),
% 3.89/4.25    Or (Eq (linorder a) False) (Or (Eq (Not (ord_less a a_1 a_2)) False) (Eq (ord_less_eq a a_2 a_1) True))
% 3.89/4.25  Clause #317 (by clausification #[316]): ∀ (a : Type) (a_1 a_2 : a),
% 3.89/4.25    Or (Eq (linorder a) False) (Or (Eq (ord_less_eq a a_1 a_2) True) (Eq (ord_less a a_2 a_1) True))
% 3.89/4.25  Clause #319 (by superposition #[317, 99]): ∀ (a a_1 : int), Or (Eq (ord_less_eq int a a_1) True) (Or (Eq (ord_less int a_1 a) True) (Eq False True))
% 3.89/4.25  Clause #497 (by clausification #[319]): ∀ (a a_1 : int), Or (Eq (ord_less_eq int a a_1) True) (Eq (ord_less int a_1 a) True)
% 3.89/4.25  Clause #498 (by superposition #[497, 123]): Or (Eq (ord_less_eq int (one_one int) t) True) (Eq True False)
% 3.89/4.25  Clause #501 (by clausification #[498]): Eq (ord_less_eq int (one_one int) t) True
% 3.89/4.25  Clause #502 (by superposition #[501, 111]): Eq True False
% 3.89/4.25  Clause #503 (by clausification #[502]): False
% 3.89/4.25  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------