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

% Computer : n026.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 6.79s 6.97s
% Output   : Proof 6.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWB002+4 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n026.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 07:43:34 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 6.79/6.97  SZS status Theorem for theBenchmark.p
% 6.79/6.97  SZS output start Proof for theBenchmark.p
% 6.79/6.97  Clause #78 (by assumption #[]): Eq
% 6.79/6.97    (Not
% 6.79/6.97      (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)))
% 6.79/6.97    True
% 6.79/6.97  Clause #79 (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
% 6.79/6.97  Clause #330 (by clausification #[78]): 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))
% 6.79/6.97    False
% 6.79/6.97  Clause #331 (by clausification #[330]): ∀ (a : Iota), Eq (Exists fun BNODE_y => And (iext uri_ex_p a BNODE_y) (iext uri_ex_q BNODE_y a)) False
% 6.79/6.97  Clause #332 (by clausification #[331]): ∀ (a a_1 : Iota), Eq (And (iext uri_ex_p a a_1) (iext uri_ex_q a_1 a)) False
% 6.79/6.97  Clause #333 (by clausification #[332]): ∀ (a a_1 : Iota), Or (Eq (iext uri_ex_p a a_1) False) (Eq (iext uri_ex_q a_1 a) False)
% 6.79/6.97  Clause #347 (by clausification #[79]): ∀ (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
% 6.79/6.97  Clause #348 (by clausification #[347]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) True
% 6.79/6.97  Clause #349 (by clausification #[347]): ∀ (a : Iota), Eq (iext uri_ex_p uri_ex_s (skS.0 0 a)) True
% 6.79/6.97  Clause #517 (by superposition #[349, 333]): ∀ (a : Iota), Or (Eq True False) (Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) False)
% 6.79/6.97  Clause #841 (by clausification #[517]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) False
% 6.79/6.97  Clause #842 (by superposition #[841, 348]): Eq False True
% 6.79/6.97  Clause #843 (by clausification #[842]): False
% 6.79/6.97  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------