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

% Computer : n006.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:56:50 EDT 2023

% Result   : Theorem 3.39s 3.61s
% Output   : Proof 3.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM660^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n006.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 13:31:37 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 3.39/3.61  SZS status Theorem for theBenchmark.p
% 3.39/3.61  SZS output start Proof for theBenchmark.p
% 3.39/3.61  Clause #0 (by assumption #[]): Eq (Not (more x y) → Eq x y) True
% 3.39/3.61  Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), more Xx Xy → less Xy Xx) True
% 3.39/3.61  Clause #2 (by assumption #[]): Eq (Not (Not (less y x) → Eq y x)) True
% 3.39/3.61  Clause #3 (by clausification #[0]): Or (Eq (Not (more x y)) False) (Eq (Eq x y) True)
% 3.39/3.61  Clause #4 (by clausification #[3]): Or (Eq (Eq x y) True) (Eq (more x y) True)
% 3.39/3.61  Clause #5 (by clausification #[4]): Or (Eq (more x y) True) (Eq x y)
% 3.39/3.61  Clause #6 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), more a Xy → less Xy a) True
% 3.39/3.61  Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Eq (more a a_1 → less a_1 a) True
% 3.39/3.61  Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Eq (less a_1 a) True)
% 3.39/3.61  Clause #9 (by superposition #[8, 5]): Or (Eq (less y x) True) (Or (Eq False True) (Eq x y))
% 3.39/3.61  Clause #10 (by clausification #[2]): Eq (Not (less y x) → Eq y x) False
% 3.39/3.61  Clause #11 (by clausification #[10]): Eq (Not (less y x)) True
% 3.39/3.61  Clause #12 (by clausification #[10]): Eq (Eq y x) False
% 3.39/3.61  Clause #13 (by clausification #[11]): Eq (less y x) False
% 3.39/3.61  Clause #14 (by clausification #[12]): Ne y x
% 3.39/3.61  Clause #17 (by clausification #[9]): Or (Eq (less y x) True) (Eq x y)
% 3.39/3.61  Clause #18 (by forward contextual literal cutting #[17, 14]): Eq (less y x) True
% 3.39/3.61  Clause #19 (by superposition #[18, 13]): Eq True False
% 3.39/3.61  Clause #20 (by clausification #[19]): False
% 3.39/3.61  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------