%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SWB002+2 : TPTP v9.2.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n004.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 : Fri Oct 3 08:03:20 PM UTC 2025 % Result : Theorem 3.60s 3.77s % Output : Proof 3.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWB002+2 : TPTP v9.2.0. Released v5.2.0. % 0.03/0.13 % Command : duper %s % 0.13/0.34 % Computer : n004.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 : Thu Oct 2 11:56:53 EDT 2025 % 0.13/0.34 % CPUTime : % 3.60/3.77 SZS status Theorem for theBenchmark.p % 3.60/3.77 SZS output start Proof for theBenchmark.p % 3.60/3.77 Clause #0 (by assumption #[]): Eq % 3.60/3.77 (Not % 3.60/3.77 (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.60/3.77 True % 3.60/3.77 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.60/3.77 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.60/3.77 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) True % 3.60/3.77 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (iext uri_ex_p uri_ex_s (skS.0 0 a)) True % 3.60/3.77 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.60/3.77 False % 3.60/3.77 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.60/3.77 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.60/3.77 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.60/3.77 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.60/3.77 Clause #10 (by clausification #[9]): ∀ (a : Iota), Eq (iext uri_ex_q (skS.0 0 a) uri_ex_s) False % 3.60/3.77 Clause #11 (by superposition #[10, 3]): Eq False True % 3.60/3.77 Clause #12 (by clausification #[11]): False % 3.60/3.77 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------