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