%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : PUZ082^1 : TPTP v9.2.0. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n011.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 07:58:20 PM UTC 2025 % Result : Theorem 4.21s 4.41s % Output : Proof 4.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.13 % Problem : PUZ082^1 : TPTP v9.2.0. Released v3.6.0. % 0.05/0.14 % Command : duper %s % 0.14/0.37 % Computer : n011.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 300 % 0.14/0.37 % DateTime : Thu Oct 2 20:57:08 EDT 2025 % 0.14/0.37 % CPUTime : % 4.21/4.41 SZS status Theorem for theBenchmark.p % 4.21/4.41 SZS output start Proof for theBenchmark.p % 4.21/4.41 Clause #0 (by assumption #[]): Eq (says peter (∀ (X : Prop), says peter X → Not X)) True % 4.21/4.41 Clause #1 (by assumption #[]): Eq (Not (Not (∀ (X : Prop), says peter X → Not X))) True % 4.21/4.41 Clause #2 (by clausification #[1]): Eq (Not (∀ (X : Prop), says peter X → Not X)) False % 4.21/4.41 Clause #3 (by clausification #[2]): Eq (∀ (X : Prop), says peter X → Not X) True % 4.21/4.41 Clause #4 (by clausification #[3]): ∀ (a : Prop), Eq (says peter a → Not a) True % 4.21/4.41 Clause #5 (by clausification #[4]): ∀ (a : Prop), Or (Eq (says peter a) False) (Eq (Not a) True) % 4.21/4.41 Clause #6 (by clausification #[5]): ∀ (a : Prop), Or (Eq (says peter a) False) (Eq a False) % 4.21/4.41 Clause #7 (by identity loobHoist #[6]): ∀ (a : Prop), Or (Eq a False) (Or (Eq (says peter True) False) (Eq a False)) % 4.21/4.41 Clause #9 (by eliminate duplicate literals #[7]): ∀ (a : Prop), Or (Eq a False) (Eq (says peter True) False) % 4.21/4.41 Clause #10 (by falseElim #[9]): Eq (says peter True) False % 4.21/4.41 Clause #11 (by bool simp #[0]): Eq (says peter (And (says peter True → Not True) (says peter False → Not False))) True % 4.21/4.41 Clause #12 (by bool simp #[11]): Eq (says peter (And (says peter True → Not True) (says peter False → True))) True % 4.21/4.41 Clause #13 (by bool simp #[12]): Eq (says peter (And (says peter True → Not True) True)) True % 4.21/4.41 Clause #14 (by bool simp #[13]): Eq (says peter (says peter True → Not True)) True % 4.21/4.41 Clause #15 (by bool simp #[14]): Eq (says peter (says peter True → False)) True % 4.21/4.41 Clause #16 (by bool simp #[15]): Eq (says peter (Not (says peter True))) True % 4.21/4.41 Clause #17 (by forward demodulation #[16, 10]): Eq (says peter (Not False)) True % 4.21/4.41 Clause #18 (by bool simp #[17]): Eq (says peter True) True % 4.21/4.41 Clause #19 (by superposition #[18, 10]): Eq True False % 4.21/4.41 Clause #20 (by clausification #[19]): False % 4.21/4.41 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------