TSTP Solution File: NUM676^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUM676^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n003.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:59 EDT 2023
% Result : Theorem 3.62s 3.79s
% Output : Proof 3.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM676^1 : TPTP v8.1.2. Released v3.7.0.
% 0.13/0.13 % Command : duper %s
% 0.13/0.34 % Computer : n003.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 14:15:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.62/3.79 SZS status Theorem for theBenchmark.p
% 3.62/3.79 SZS output start Proof for theBenchmark.p
% 3.62/3.79 Clause #0 (by assumption #[]): Eq (Eq x y) True
% 3.62/3.79 Clause #1 (by assumption #[]): Eq (more z u) True
% 3.62/3.79 Clause #2 (by assumption #[]): Eq (∀ (Xx Xy Xz : nat), more Xx Xy → more (pl Xz Xx) (pl Xz Xy)) True
% 3.62/3.79 Clause #3 (by assumption #[]): Eq (Not (more (pl x z) (pl y u))) True
% 3.62/3.79 Clause #4 (by clausification #[0]): Eq x y
% 3.62/3.79 Clause #5 (by clausification #[3]): Eq (more (pl x z) (pl y u)) False
% 3.62/3.79 Clause #6 (by forward demodulation #[5, 4]): Eq (more (pl y z) (pl y u)) False
% 3.62/3.79 Clause #7 (by clausification #[2]): ∀ (a : nat), Eq (∀ (Xy Xz : nat), more a Xy → more (pl Xz a) (pl Xz Xy)) True
% 3.62/3.79 Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Eq (∀ (Xz : nat), more a a_1 → more (pl Xz a) (pl Xz a_1)) True
% 3.62/3.79 Clause #9 (by clausification #[8]): ∀ (a a_1 a_2 : nat), Eq (more a a_1 → more (pl a_2 a) (pl a_2 a_1)) True
% 3.62/3.79 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : nat), Or (Eq (more a a_1) False) (Eq (more (pl a_2 a) (pl a_2 a_1)) True)
% 3.62/3.79 Clause #11 (by superposition #[10, 1]): ∀ (a : nat), Or (Eq (more (pl a z) (pl a u)) True) (Eq False True)
% 3.62/3.79 Clause #12 (by clausification #[11]): ∀ (a : nat), Eq (more (pl a z) (pl a u)) True
% 3.62/3.79 Clause #13 (by superposition #[12, 6]): Eq True False
% 3.62/3.79 Clause #15 (by clausification #[13]): False
% 3.62/3.79 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------