%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO206^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n021.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:08:45 PM UTC 2025 % Result : Theorem 3.41s 3.58s % Output : Proof 3.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.12 % Problem : SYO206^5 : TPTP v9.2.0. Released v4.0.0. % 0.02/0.13 % Command : duper %s % 0.14/0.34 % Computer : n021.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Oct 3 14:10:53 EDT 2025 % 0.14/0.34 % CPUTime : % 3.41/3.58 SZS status Theorem for theBenchmark.p % 3.41/3.58 SZS output start Proof for theBenchmark.p % 3.41/3.58 Clause #0 (by assumption #[]): Eq (Not (Exists fun Xx => ∀ (Xy : Prop), Eq (Eq Xx Xy) (Eq Xy Xx))) True % 3.41/3.58 Clause #1 (by clausification #[0]): Eq (Exists fun Xx => ∀ (Xy : Prop), Eq (Eq Xx Xy) (Eq Xy Xx)) False % 3.41/3.58 Clause #2 (by clausification #[1]): ∀ (a : Prop), Eq (∀ (Xy : Prop), Eq (Eq a Xy) (Eq Xy a)) False % 3.41/3.58 Clause #3 (by clausification #[2]): ∀ (a a_1 : Prop), Eq (Not (Eq (Eq a (skS.0 0 a a_1)) (Eq (skS.0 0 a a_1) a))) True % 3.41/3.58 Clause #4 (by clausification #[3]): ∀ (a a_1 : Prop), Eq (Eq (Eq a (skS.0 0 a a_1)) (Eq (skS.0 0 a a_1) a)) False % 3.41/3.58 Clause #5 (by clausification #[4]): ∀ (a a_1 : Prop), Ne (Eq a (skS.0 0 a a_1)) (Eq (skS.0 0 a a_1) a) % 3.41/3.58 Clause #6 (by clausification #[5]): ∀ (a a_1 : Prop), Or (Eq (Eq a (skS.0 0 a a_1)) False) (Eq (Eq (skS.0 0 a a_1) a) False) % 3.41/3.58 Clause #7 (by clausification #[5]): ∀ (a a_1 : Prop), Or (Eq (Eq a (skS.0 0 a a_1)) True) (Eq (Eq (skS.0 0 a a_1) a) True) % 3.41/3.58 Clause #8 (by clausification #[6]): ∀ (a a_1 : Prop), Or (Eq (Eq (skS.0 0 a a_1) a) False) (Ne a (skS.0 0 a a_1)) % 3.41/3.58 Clause #9 (by clausification #[8]): ∀ (a a_1 : Prop), Or (Ne a (skS.0 0 a a_1)) (Ne (skS.0 0 a a_1) a) % 3.41/3.58 Clause #10 (by clausification #[9]): ∀ (a a_1 : Prop), Or (Ne (skS.0 0 a a_1) a) (Or (Eq a False) (Eq (skS.0 0 a a_1) False)) % 3.41/3.58 Clause #12 (by clausification #[10]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq (skS.0 0 a a_1) False) (Or (Eq (skS.0 0 a a_1) False) (Eq a False))) % 3.41/3.58 Clause #14 (by eliminate duplicate literals #[12]): ∀ (a a_1 : Prop), Or (Eq a False) (Eq (skS.0 0 a a_1) False) % 3.41/3.58 Clause #15 (by identity loobHoist #[14]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq (skS.0 0 a True) False) (Eq a_1 False)) % 3.41/3.58 Clause #17 (by identity loobHoist #[15]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 False) (Or (Eq (skS.0 0 True True) False) (Eq a False))) % 3.41/3.58 Clause #19 (by eliminate duplicate literals #[17]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 False) (Eq (skS.0 0 True True) False)) % 3.41/3.58 Clause #20 (by falseElim #[19]): ∀ (a : Prop), Or (Eq a False) (Eq (skS.0 0 True True) False) % 3.41/3.58 Clause #21 (by falseElim #[20]): Eq (skS.0 0 True True) False % 3.41/3.58 Clause #26 (by clausification #[7]): ∀ (a a_1 : Prop), Or (Eq (Eq (skS.0 0 a a_1) a) True) (Eq a (skS.0 0 a a_1)) % 3.41/3.58 Clause #27 (by clausification #[26]): ∀ (a a_1 : Prop), Or (Eq a (skS.0 0 a a_1)) (Eq (skS.0 0 a a_1) a) % 3.41/3.58 Clause #28 (by eliminate duplicate literals #[27]): ∀ (a a_1 : Prop), Eq a (skS.0 0 a a_1) % 3.41/3.58 Clause #29 (by identity loobHoist #[28]): ∀ (a a_1 : Prop), Or (Eq a (skS.0 0 a True)) (Eq a_1 False) % 3.41/3.58 Clause #31 (by identity loobHoist #[29]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 (skS.0 0 True True)) (Eq a_1 False)) % 3.41/3.58 Clause #33 (by forward demodulation #[31, 21]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 False) (Eq a_1 False)) % 3.41/3.58 Clause #34 (by eliminate duplicate literals #[33]): ∀ (a a_1 : Prop), Or (Eq a False) (Eq a_1 False) % 3.41/3.58 Clause #35 (by falseElim #[34]): ∀ (a : Prop), Eq a False % 3.41/3.58 Clause #36 (by falseElim #[35]): False % 3.41/3.58 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------