%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV225^5 : TPTP v9.2.0. Bugfixed v5.3.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n016.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:02:58 PM UTC 2025 % Result : Theorem 3.43s 3.65s % Output : Proof 3.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SEV225^5 : TPTP v9.2.0. Bugfixed v5.3.0. % 0.08/0.15 % Command : duper %s % 0.15/0.35 % Computer : n016.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 Oct 3 01:20:53 EDT 2025 % 0.15/0.35 % CPUTime : % 3.43/3.65 SZS status Theorem for theBenchmark.p % 3.43/3.65 SZS output start Proof for theBenchmark.p % 3.43/3.65 Clause #0 (by assumption #[]): Eq (Eq cIRREFLEXIVE_LAW (∀ (Xx : r), Not (less Xx Xx))) True % 3.43/3.65 Clause #1 (by assumption #[]): Eq (Not (cIRREFLEXIVE_LAW → ∀ (Xx : r), Not (And (less Xx c0) (Eq Xx c0)))) True % 3.43/3.65 Clause #2 (by clausification #[0]): Eq cIRREFLEXIVE_LAW (∀ (Xx : r), Not (less Xx Xx)) % 3.43/3.65 Clause #4 (by clausify Prop equality #[2]): Or (Eq cIRREFLEXIVE_LAW False) (Eq (∀ (Xx : r), Not (less Xx Xx)) True) % 3.43/3.65 Clause #6 (by clausification #[4]): ∀ (a : r), Or (Eq cIRREFLEXIVE_LAW False) (Eq (Not (less a a)) True) % 3.43/3.65 Clause #7 (by clausification #[6]): ∀ (a : r), Or (Eq cIRREFLEXIVE_LAW False) (Eq (less a a) False) % 3.43/3.65 Clause #11 (by clausification #[1]): Eq (cIRREFLEXIVE_LAW → ∀ (Xx : r), Not (And (less Xx c0) (Eq Xx c0))) False % 3.43/3.65 Clause #12 (by clausification #[11]): Eq cIRREFLEXIVE_LAW True % 3.43/3.65 Clause #13 (by clausification #[11]): Eq (∀ (Xx : r), Not (And (less Xx c0) (Eq Xx c0))) False % 3.43/3.65 Clause #15 (by backward demodulation #[12, 7]): ∀ (a : r), Or (Eq True False) (Eq (less a a) False) % 3.43/3.65 Clause #17 (by clausification #[13]): ∀ (a : r), Eq (Not (Not (And (less (skS.0 1 a) c0) (Eq (skS.0 1 a) c0)))) True % 3.43/3.65 Clause #18 (by clausification #[17]): ∀ (a : r), Eq (Not (And (less (skS.0 1 a) c0) (Eq (skS.0 1 a) c0))) False % 3.43/3.65 Clause #19 (by clausification #[18]): ∀ (a : r), Eq (And (less (skS.0 1 a) c0) (Eq (skS.0 1 a) c0)) True % 3.43/3.65 Clause #20 (by clausification #[19]): ∀ (a : r), Eq (Eq (skS.0 1 a) c0) True % 3.43/3.65 Clause #21 (by clausification #[19]): ∀ (a : r), Eq (less (skS.0 1 a) c0) True % 3.43/3.65 Clause #22 (by clausification #[20]): ∀ (a : r), Eq (skS.0 1 a) c0 % 3.43/3.65 Clause #23 (by clausification #[15]): ∀ (a : r), Eq (less a a) False % 3.43/3.65 Clause #25 (by forward demodulation #[21, 22]): Eq (less c0 c0) True % 3.43/3.65 Clause #26 (by superposition #[25, 23]): Eq True False % 3.43/3.65 Clause #27 (by clausification #[26]): False % 3.43/3.65 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------