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

% Computer : n032.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:57:14 EDT 2023

% Result   : Theorem 3.72s 3.96s
% Output   : Proof 3.72s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM702^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.12  % Command    : duper %s
% 0.10/0.31  % Computer : n032.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.31  % CPULimit   : 300
% 0.14/0.31  % WCLimit    : 300
% 0.14/0.31  % DateTime   : Fri Aug 25 12:21:42 EDT 2023
% 0.14/0.32  % CPUTime    : 
% 3.72/3.96  SZS status Theorem for theBenchmark.p
% 3.72/3.96  SZS output start Proof for theBenchmark.p
% 3.72/3.96  Clause #0 (by assumption #[]): Eq (some fun Xu => diffprop (pl y n_1) x Xu) True
% 3.72/3.96  Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), lessis Xx Xy → moreis Xy Xx) True
% 3.72/3.96  Clause #2 (by assumption #[]): Eq (∀ (Xx Xy : nat), (some fun Xv => diffprop (pl Xx n_1) Xy Xv) → lessis Xy Xx) True
% 3.72/3.96  Clause #3 (by assumption #[]): Eq (Not (moreis y x)) True
% 3.72/3.96  Clause #4 (by clausification #[3]): Eq (moreis y x) False
% 3.72/3.96  Clause #5 (by betaEtaReduce #[2]): Eq (∀ (Xx Xy : nat), some (diffprop (pl Xx n_1) Xy) → lessis Xy Xx) True
% 3.72/3.96  Clause #6 (by clausification #[5]): ∀ (a : nat), Eq (∀ (Xy : nat), some (diffprop (pl a n_1) Xy) → lessis Xy a) True
% 3.72/3.96  Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Eq (some (diffprop (pl a n_1) a_1) → lessis a_1 a) True
% 3.72/3.96  Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Or (Eq (some (diffprop (pl a n_1) a_1)) False) (Eq (lessis a_1 a) True)
% 3.72/3.96  Clause #9 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), lessis a Xy → moreis Xy a) True
% 3.72/3.96  Clause #10 (by clausification #[9]): ∀ (a a_1 : nat), Eq (lessis a a_1 → moreis a_1 a) True
% 3.72/3.96  Clause #11 (by clausification #[10]): ∀ (a a_1 : nat), Or (Eq (lessis a a_1) False) (Eq (moreis a_1 a) True)
% 3.72/3.96  Clause #12 (by betaEtaReduce #[0]): Eq (some (diffprop (pl y n_1) x)) True
% 3.72/3.96  Clause #13 (by superposition #[12, 8]): Or (Eq True False) (Eq (lessis x y) True)
% 3.72/3.96  Clause #14 (by clausification #[13]): Eq (lessis x y) True
% 3.72/3.96  Clause #15 (by superposition #[14, 11]): Or (Eq True False) (Eq (moreis y x) True)
% 3.72/3.96  Clause #16 (by clausification #[15]): Eq (moreis y x) True
% 3.72/3.96  Clause #17 (by superposition #[16, 4]): Eq True False
% 3.72/3.96  Clause #18 (by clausification #[17]): False
% 3.72/3.96  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------