TSTP Solution File: NUM692^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUM692^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n020.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:05 EDT 2023
% Result : Theorem 3.32s 3.64s
% Output : Proof 3.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM692^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14 % Command : duper %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 18:01:45 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.32/3.64 SZS status Theorem for theBenchmark.p
% 3.32/3.64 SZS output start Proof for theBenchmark.p
% 3.32/3.64 Clause #0 (by assumption #[]): Eq (lessis x y) True
% 3.32/3.64 Clause #1 (by assumption #[]): Eq (lessis z u) True
% 3.32/3.64 Clause #2 (by assumption #[]): Eq (∀ (Xx Xy : nat), moreis Xx Xy → lessis Xy Xx) True
% 3.32/3.64 Clause #3 (by assumption #[]): Eq (∀ (Xx Xy Xz Xu : nat), moreis Xx Xy → moreis Xz Xu → moreis (ts Xx Xz) (ts Xy Xu)) True
% 3.32/3.64 Clause #4 (by assumption #[]): Eq (∀ (Xx Xy : nat), lessis Xx Xy → moreis Xy Xx) True
% 3.32/3.64 Clause #5 (by assumption #[]): Eq (Not (lessis (ts x z) (ts y u))) True
% 3.32/3.64 Clause #6 (by clausification #[2]): ∀ (a : nat), Eq (∀ (Xy : nat), moreis a Xy → lessis Xy a) True
% 3.32/3.64 Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Eq (moreis a a_1 → lessis a_1 a) True
% 3.32/3.64 Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Or (Eq (moreis a a_1) False) (Eq (lessis a_1 a) True)
% 3.32/3.64 Clause #9 (by clausification #[4]): ∀ (a : nat), Eq (∀ (Xy : nat), lessis a Xy → moreis Xy a) True
% 3.32/3.64 Clause #10 (by clausification #[9]): ∀ (a a_1 : nat), Eq (lessis a a_1 → moreis a_1 a) True
% 3.32/3.64 Clause #11 (by clausification #[10]): ∀ (a a_1 : nat), Or (Eq (lessis a a_1) False) (Eq (moreis a_1 a) True)
% 3.32/3.64 Clause #12 (by superposition #[11, 1]): Or (Eq (moreis u z) True) (Eq False True)
% 3.32/3.64 Clause #13 (by superposition #[11, 0]): Or (Eq (moreis y x) True) (Eq False True)
% 3.32/3.64 Clause #14 (by clausification #[13]): Eq (moreis y x) True
% 3.32/3.64 Clause #16 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy Xz Xu : nat), moreis a Xy → moreis Xz Xu → moreis (ts a Xz) (ts Xy Xu)) True
% 3.32/3.64 Clause #17 (by clausification #[16]): ∀ (a a_1 : nat), Eq (∀ (Xz Xu : nat), moreis a a_1 → moreis Xz Xu → moreis (ts a Xz) (ts a_1 Xu)) True
% 3.32/3.64 Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 : nat), Eq (∀ (Xu : nat), moreis a a_1 → moreis a_2 Xu → moreis (ts a a_2) (ts a_1 Xu)) True
% 3.32/3.64 Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 a_3 : nat), Eq (moreis a a_1 → moreis a_2 a_3 → moreis (ts a a_2) (ts a_1 a_3)) True
% 3.32/3.64 Clause #20 (by clausification #[19]): ∀ (a a_1 a_2 a_3 : nat), Or (Eq (moreis a a_1) False) (Eq (moreis a_2 a_3 → moreis (ts a a_2) (ts a_1 a_3)) True)
% 3.32/3.64 Clause #21 (by clausification #[20]): ∀ (a a_1 a_2 a_3 : nat),
% 3.32/3.64 Or (Eq (moreis a a_1) False) (Or (Eq (moreis a_2 a_3) False) (Eq (moreis (ts a a_2) (ts a_1 a_3)) True))
% 3.32/3.64 Clause #22 (by superposition #[21, 14]): ∀ (a a_1 : nat), Or (Eq (moreis a a_1) False) (Or (Eq (moreis (ts y a) (ts x a_1)) True) (Eq False True))
% 3.32/3.64 Clause #23 (by clausification #[12]): Eq (moreis u z) True
% 3.32/3.64 Clause #26 (by clausification #[5]): Eq (lessis (ts x z) (ts y u)) False
% 3.32/3.64 Clause #27 (by clausification #[22]): ∀ (a a_1 : nat), Or (Eq (moreis a a_1) False) (Eq (moreis (ts y a) (ts x a_1)) True)
% 3.32/3.64 Clause #29 (by superposition #[27, 23]): Or (Eq (moreis (ts y u) (ts x z)) True) (Eq False True)
% 3.32/3.64 Clause #40 (by clausification #[29]): Eq (moreis (ts y u) (ts x z)) True
% 3.32/3.64 Clause #41 (by superposition #[40, 8]): Or (Eq True False) (Eq (lessis (ts x z) (ts y u)) True)
% 3.32/3.64 Clause #45 (by clausification #[41]): Eq (lessis (ts x z) (ts y u)) True
% 3.32/3.64 Clause #46 (by superposition #[45, 26]): Eq True False
% 3.32/3.64 Clause #53 (by clausification #[46]): False
% 3.32/3.64 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------