%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SWB002+3 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n028.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 21.64s 21.81s
% Output   : Proof 21.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWB002+3 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n028.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   : Sun Aug 27 06:42:08 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 21.64/21.81  SZS status Theorem for theBenchmark.p
% 21.64/21.81  SZS output start Proof for theBenchmark.p
% 21.64/21.81  Clause #135 (by assumption #[]): Eq
% 21.64/21.81    (Not
% 21.64/21.81      (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)))
% 21.64/21.81    True
% 21.64/21.81  Clause #136 (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
% 21.64/21.81  Clause #955 (by clausification #[135]): 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))
% 21.64/21.81    False
% 21.64/21.81  Clause #956 (by clausification #[955]): ∀ (a : Iota), Eq (Exists fun BNODE_y => And (iext uri_ex_p a BNODE_y) (iext uri_ex_q BNODE_y a)) False
% 21.64/21.81  Clause #957 (by clausification #[956]): ∀ (a a_1 : Iota), Eq (And (iext uri_ex_p a a_1) (iext uri_ex_q a_1 a)) False
% 21.64/21.81  Clause #958 (by clausification #[957]): ∀ (a a_1 : Iota), Or (Eq (iext uri_ex_p a a_1) False) (Eq (iext uri_ex_q a_1 a) False)
% 21.64/21.81  Clause #965 (by clausification #[136]): ∀ (a : Iota), Eq (And (iext uri_ex_p uri_ex_s (skS.0 17 a)) (iext uri_ex_q (skS.0 17 a) uri_ex_s)) True
% 21.64/21.81  Clause #966 (by clausification #[965]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 17 a) uri_ex_s) True
% 21.64/21.81  Clause #967 (by clausification #[965]): ∀ (a : Iota), Eq (iext uri_ex_p uri_ex_s (skS.0 17 a)) True
% 21.64/21.81  Clause #1120 (by superposition #[967, 958]): ∀ (a : Iota), Or (Eq True False) (Eq (iext uri_ex_q (skS.0 17 a) uri_ex_s) False)
% 21.64/21.81  Clause #2889 (by clausification #[1120]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 17 a) uri_ex_s) False
% 21.64/21.81  Clause #2890 (by superposition #[2889, 966]): Eq False True
% 21.64/21.81  Clause #2891 (by clausification #[2890]): False
% 21.64/21.81  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------