TSTP Solution File: SWB002+2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n005.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 20:03:50 EDT 2023
% Result : Theorem 3.47s 3.71s
% Output : Proof 3.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% 0.13/0.14 % Command : duper %s
% 0.15/0.36 % Computer : n005.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 : Sun Aug 27 07:20:53 EDT 2023
% 0.21/0.36 % CPUTime :
% 3.47/3.71 SZS status Theorem for theBenchmark.p
% 3.47/3.71 SZS output start Proof for theBenchmark.p
% 3.47/3.71 Clause #0 (by assumption #[]): Eq
% 3.47/3.71 (Not
% 3.47/3.71 (Exists fun BNODE_x => Exists fun BNODE_y => And (iext uri_ex_p BNODE_x BNODE_y) (iext uri_ex_q BNODE_y BNODE_x)))
% 3.47/3.71 True
% 3.47/3.71 Clause #1 (by assumption #[]): Eq (Exists fun BNODE_o => And (iext uri_ex_p uri_ex_s BNODE_o) (iext uri_ex_q BNODE_o uri_ex_s)) True
% 3.47/3.71 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (And (iext uri_ex_p uri_ex_s (skS.0 0 a)) (iext uri_ex_q (skS.0 0 a) uri_ex_s)) True
% 3.47/3.71 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) True
% 3.47/3.71 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (iext uri_ex_p uri_ex_s (skS.0 0 a)) True
% 3.47/3.71 Clause #5 (by clausification #[0]): Eq (Exists fun BNODE_x => Exists fun BNODE_y => And (iext uri_ex_p BNODE_x BNODE_y) (iext uri_ex_q BNODE_y BNODE_x))
% 3.47/3.71 False
% 3.47/3.71 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (Exists fun BNODE_y => And (iext uri_ex_p a BNODE_y) (iext uri_ex_q BNODE_y a)) False
% 3.47/3.71 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (And (iext uri_ex_p a a_1) (iext uri_ex_q a_1 a)) False
% 3.47/3.71 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (iext uri_ex_p a a_1) False) (Eq (iext uri_ex_q a_1 a) False)
% 3.47/3.71 Clause #9 (by superposition #[8, 4]): ∀ (a : Iota), Or (Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) False) (Eq False True)
% 3.47/3.71 Clause #10 (by clausification #[9]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) False
% 3.47/3.71 Clause #11 (by superposition #[10, 3]): Eq False True
% 3.47/3.71 Clause #12 (by clausification #[11]): False
% 3.47/3.71 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------