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

% Computer : n016.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:08 EDT 2023

% Result   : Theorem 3.41s 3.73s
% Output   : Proof 3.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : NUM697^1 : TPTP v8.1.2. Released v3.7.0.
% 0.13/0.15  % Command    : duper %s
% 0.15/0.36  % Computer : n016.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri Aug 25 10:57:25 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 3.41/3.73  SZS status Theorem for theBenchmark.p
% 3.41/3.73  SZS output start Proof for theBenchmark.p
% 3.41/3.73  Clause #0 (by assumption #[]): Eq (more y x) True
% 3.41/3.73  Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), more Xy Xx → moreis Xy (pl Xx n_1)) True
% 3.41/3.73  Clause #2 (by assumption #[]): Eq (∀ (Xx : nat), Eq (pl Xx n_1) (suc Xx)) True
% 3.41/3.73  Clause #3 (by assumption #[]): Eq (Not (moreis y (suc x))) True
% 3.41/3.73  Clause #4 (by clausification #[3]): Eq (moreis y (suc x)) False
% 3.41/3.73  Clause #5 (by clausification #[2]): ∀ (a : nat), Eq (Eq (pl a n_1) (suc a)) True
% 3.41/3.73  Clause #6 (by clausification #[5]): ∀ (a : nat), Eq (pl a n_1) (suc a)
% 3.41/3.73  Clause #7 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), more Xy a → moreis Xy (pl a n_1)) True
% 3.41/3.73  Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Eq (more a a_1 → moreis a (pl a_1 n_1)) True
% 3.41/3.73  Clause #9 (by clausification #[8]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Eq (moreis a (pl a_1 n_1)) True)
% 3.41/3.73  Clause #10 (by forward demodulation #[9, 6]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Eq (moreis a (suc a_1)) True)
% 3.41/3.73  Clause #11 (by superposition #[10, 0]): Or (Eq (moreis y (suc x)) True) (Eq False True)
% 3.41/3.73  Clause #12 (by clausification #[11]): Eq (moreis y (suc x)) True
% 3.41/3.73  Clause #13 (by superposition #[12, 4]): Eq True False
% 3.41/3.73  Clause #14 (by clausification #[13]): False
% 3.41/3.73  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------