TSTP Solution File: NUM787^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUM787^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n010.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:43 EDT 2023
% Result : Theorem 3.55s 3.74s
% Output : Proof 3.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM787^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14 % Command : duper %s
% 0.15/0.36 % Computer : n010.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 11:39:05 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.55/3.74 SZS status Theorem for theBenchmark.p
% 3.55/3.74 SZS output start Proof for theBenchmark.p
% 3.55/3.74 Clause #0 (by assumption #[]): Eq (Not (less x0 y0)) True
% 3.55/3.74 Clause #2 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), Not (is Xx0 Xy0) → Not (more Xx0 Xy0) → less Xx0 Xy0) True
% 3.55/3.74 Clause #3 (by assumption #[]): Eq (Not (Not (more x0 y0) → is x0 y0)) True
% 3.55/3.74 Clause #8 (by clausification #[0]): Eq (less x0 y0) False
% 3.55/3.74 Clause #9 (by clausification #[3]): Eq (Not (more x0 y0) → is x0 y0) False
% 3.55/3.74 Clause #10 (by clausification #[9]): Eq (Not (more x0 y0)) True
% 3.55/3.74 Clause #11 (by clausification #[9]): Eq (is x0 y0) False
% 3.55/3.74 Clause #12 (by clausification #[10]): Eq (more x0 y0) False
% 3.55/3.74 Clause #13 (by clausification #[2]): ∀ (a : rat), Eq (∀ (Xy0 : rat), Not (is a Xy0) → Not (more a Xy0) → less a Xy0) True
% 3.55/3.74 Clause #14 (by clausification #[13]): ∀ (a a_1 : rat), Eq (Not (is a a_1) → Not (more a a_1) → less a a_1) True
% 3.55/3.74 Clause #15 (by clausification #[14]): ∀ (a a_1 : rat), Or (Eq (Not (is a a_1)) False) (Eq (Not (more a a_1) → less a a_1) True)
% 3.55/3.74 Clause #16 (by clausification #[15]): ∀ (a a_1 : rat), Or (Eq (Not (more a a_1) → less a a_1) True) (Eq (is a a_1) True)
% 3.55/3.74 Clause #17 (by clausification #[16]): ∀ (a a_1 : rat), Or (Eq (is a a_1) True) (Or (Eq (Not (more a a_1)) False) (Eq (less a a_1) True))
% 3.55/3.74 Clause #18 (by clausification #[17]): ∀ (a a_1 : rat), Or (Eq (is a a_1) True) (Or (Eq (less a a_1) True) (Eq (more a a_1) True))
% 3.55/3.74 Clause #19 (by superposition #[18, 8]): Or (Eq (is x0 y0) True) (Or (Eq (more x0 y0) True) (Eq True False))
% 3.55/3.74 Clause #20 (by clausification #[19]): Or (Eq (is x0 y0) True) (Eq (more x0 y0) True)
% 3.55/3.74 Clause #21 (by forward demodulation #[20, 11]): Or (Eq False True) (Eq (more x0 y0) True)
% 3.55/3.74 Clause #22 (by clausification #[21]): Eq (more x0 y0) True
% 3.55/3.74 Clause #23 (by superposition #[22, 12]): Eq True False
% 3.55/3.74 Clause #24 (by clausification #[23]): False
% 3.55/3.74 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------